Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search

Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search
by

1 Answer

Answer :

(D) Depth first search
by

Related questions

Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Last Answer : d) Unify algorithm

Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Last Answer : b) State-space search

Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Description : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Last Answer : b) Depth-first search algorithm

A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Description : A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Last Answer : c) Best-First-Search

A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Description : A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Last Answer : A : Best-First-Search

A* algorithm is based on (A) Breadth-First-Search (B) Depth-First –Search (C) Best-First-Search (D) Hill climbing

Description : A* algorithm is based on (A) Breadth-First-Search (B) Depth-First –Search (C) Best-First-Search (D) Hill climbing

Last Answer : (C) Best-First-Search

How does randomized hill-climbing choose the next move each time? (A) It generates a random move from the moveset, and accepts this move. (B) It generates a random move from the whole state space, and accepts this move. (C) It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function. (D) It generates a random move from the whole state space, and accepts this move only if this move improves the evaluation function.

Description : How does randomized hill-climbing choose the next move each time? (A) It generates a random move from the moveset, and accepts this move. (B) It generates a random move from the whole state ... move from the whole state space, and accepts this move only if this move improves the evaluation function.

Last Answer : (C) It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function. 

Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Description : Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Last Answer : a) Informed search

Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

__________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Description : __________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Last Answer : b) Local Beam search

Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Description : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Last Answer : c) Greedy local search

What are the main cons of hill-climbing search? a) Terminates at local optimum & Does not find optimum solution b) Terminates at global optimum & Does not find optimum solution c) Does not find optimum solution & Fail to find a solution

Description : What are the main cons of hill-climbing search? a) Terminates at local optimum & Does not find optimum solution b) Terminates at global optimum & Does not find optimum solution c) Does not find optimum solution & Fail to find a solution

Last Answer : a) Terminates at local optimum & Does not find optimum solution

______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

Description : ______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Hill-Climbing

Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Description : Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Last Answer : d) Both RBFS & SMA*

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

Define Hill Climbing search.

Description : Define Hill Climbing search.

Last Answer : It is a loop that continually moves in a increasing value direction (i.e.) up hill and terminates when it reaches a “peak” where no neighbor has a higher value. 

The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search

Description : The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search

Last Answer : (B) Constraint satisfaction

Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search

Description : Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search

Last Answer : (A) Breadth First Search

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Last Answer : (D) (a), (b) , (c) and (d)

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. Image It shows which of the following depth first forest? (A) {a,b,e} {c,d,f,g,h} (B) {a,b,e} {c,d,h} {f,g} (C) {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.  It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Last Answer : Answer: A

Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) D

Description : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D 

Last Answer : Answer: 2

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Description : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Backtrack search

Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Description : Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Last Answer : d) All of the mentioned

What energy does a train have climbing up a hill at a steady speed?

Description : What energy does a train have climbing up a hill at a steady speed?

Last Answer : The train is expending mechanical energy to be lifted higher in the earth's gravity well. As it is lifted higher, it is collecting and storing potential energy because of the fact that it is in that gravity well.

A person climbing a hill bends forward in order to (a) avoid slipping (b) increase speed (c) reduce fatigue (d) increase stability

Description : A person climbing a hill bends forward in order to (a) avoid slipping (b) increase speed (c) reduce fatigue (d) increase stability

Last Answer : Ans:(d)

Why do we lean forward while climbing a hill?

Description : Why do we lean forward while climbing a hill?

Last Answer : Answer: In order to keeps the vertical line passing through our centre of gravity always between our feet, which is essential to attain equilibrium or stability.

Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

Description : Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

Last Answer : a) True

When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned

Description : When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned

Last Answer : c) No neighbor has higher value

When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Description : When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Last Answer : C : No neighbour has higher value

What are the variants of hill climbing?

Description : What are the variants of hill climbing?

Last Answer : i. Stochastic hill climbing  ii. First choice hill climbing  iii. Simulated annealing search  iv. Local beam search  v. Stochastic beam search

List some drawbacks of hill climbing process.

Description : List some drawbacks of hill climbing process. 

Last Answer : Local maxima: A local maxima as opposed to a goal maximum is a peak that is lower that the highest peak in the state space. Once a local maxima is reached the algorithm will halt even though ... of the state space where the evaluation fn is essentially flat. The search will conduct a random walk.

Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function returning highest evaluation c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Description : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Last Answer : a) Evaluation function returning lowest evaluation

Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : Evaluation function returning highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Description : Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : ... highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Last Answer : A : Evaluation function returning lowest evaluation

Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : Evaluation function returning highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Description : Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : ... highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Last Answer : A : Evaluation function returning lowest evaluation

Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : Evaluation function returning highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Description : Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : ... highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function

Last Answer : A : Evaluation function returning lowest evaluation

Question Long-Form: I have an interview for a new job next week and they have informed me that I will need to undergo a criminal records search. Where can I get one done and can I get it done for free?

Description : Question Long-Form: I have an interview for a new job next week and they have informed me that I will need to undergo a criminal records search. Where can I get one done and can I get it done for free?

Last Answer : You can get one done at your local police station. Just ask them to do it on you; however, it will not be free of charge, as all stations require a fee.

Uninformed search strategies are better than informed search strategies. a) True b) False

Description : Uninformed search strategies are better than informed search strategies. a) True b) False

Last Answer : a) True

What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

Description : What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

Last Answer : b) Heuristic search

Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search

Description : Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search

Last Answer : d) Informed & Heuristic Search

What is the general term of Blind searching? a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) Heuristic Search

Description : What is the general term of Blind searching? a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) Heuristic Search

Last Answer : b) Uninformed Search