Log In
3 votes

Which one of the following is not an informed search technique?

  1. Hill climbing search
  2. Best first search
  3. A* search
  4. Depth first search
in Algorithms
recategorized by

3 Answers

3 votes
Best answer

Answer : DFS

Hill Climbing : It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by incrementally changing a single element of the solution. If the change produces a better solution, an incremental change is made to the new solution, repeating until no further improvements can be found.

Reference : Detailed Explanation for what is informed search technique | What is Best first search in this context | what is A* search is Here Link 1 | Link 2

selected by
2 votes
first three are informed search or heuristics search(with some kind of guide or information. situation is just like u go for visit to a historical place with a guide he will take u to the main points and leaving unimportant points    without guide u will probably search each and every point as u don t have information in advance)

Best first is greedy algo can move either BFS or DFS so also known as OR search. A* is a variation of BFS . Hill climbing is also greedy algo look for local max or min soln while it may not be  global soln

so clearly ans is D   DFS as its move blindly in depth wise direction while soln may be at somewhere else
1 vote

Answer D

Uninformed search  is an Exhaustive search using brute force methods: search all possible paths

Eg: depth-first, Breadth-first

Other options are informed search.

informed search used Heuristic approaches (choose path likely to give solution)


Related questions

0 votes
1 answer
The solution of recurrence relation, $T(n) = 2T (floor (\sqrt{n}))+\log n$ is $O(n \log \log \log n)$ $O(n \log \log n)$ $O(\log \log n)$ $O(\log n \log \log n)$
asked Jul 16, 2016 in Algorithms jothee 727 views
1 vote
1 answer
Consider a single perception with weights as given in the following figure: and $f(t)$ is defined as $f(t) \bigg\{ 1, t>0 \: 0, t \leq 0$ The above perception can solve OR problem AND problem XOR problem All of the above
asked Jul 19, 2016 in Others jothee 1.9k views
1 vote
1 answer
If A and B are two fuzzy sets with membership functions $\mu _A (x)=\{0.6,0.5,0.1,0.7,0.8\}$ $\mu_B(x)=\{0.9, 0.2, 0.6, 0.8, 0.5\}$ Then the value of $\mu_{\overline{A \cup B} }(x)$ will be $\{0.9, 0.5, 0.6, 0.8, 0.8\}$ $\{0.6, 0.2, 0.1, 0.7, 0.5 \}$ $\{0.1, 0.5, 0.4, 0.2, 0.2\}$ $\{0.1, 0.5, 0.4, 0.2, 0.3 \}$
asked Jul 19, 2016 in Others jothee 6.1k views
2 votes
1 answer
A fuzzy set A on R is ______ iff $A(\lambda x_1 + (1- \lambda)x_2) \geq min [A(x_1), A(x_2)]$ for all $x_1, x_2 \in R$ and all $\lambda \in [0,1]$ where minimum denotes the minimum operator. Support $\alpha$ - cut Convex Concave
asked Jul 19, 2016 in Others jothee 1.3k views