List the various informed search strategy.

List the various informed search strategy.
by

1 Answer

Answer :

Best first search –greedy search ,A* search Memory bounded search-Iterative deepening A*search -simplified memory bounded A*search -Iterative improvement search –hill climbing -simulated annealing 
by

Related questions

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

Which search strategy is also called as blind search? a) Uninformed search b) Informed search c) Simple reflex search d) All of the mentioned

Description : Which search strategy is also called as blind search? a) Uninformed search b) Informed search c) Simple reflex search d) All of the mentioned

Last Answer : a) Uninformed search

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

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

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

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

What is informed search?

Description : What is informed search?

Last Answer : One that uses problem – specific knowledge beyond the definition of the problem itself and it can find solutions more efficiently than an uninformed strategy.

List the various search strategies.

Description : List the various search strategies.

Last Answer : a. BFS b. Uniform cost search c. DFS d. Depth limited search e. Iterative deepening search f. Bidirectional search

Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned

Description : Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned

Last Answer : b) Least commitment

Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Last Answer : c) The one closest to the goal node

Mention the criteria for the evaluation of search strategy.

Description : Mention the criteria for the evaluation of search strategy.

Last Answer :  There are 4 criteria: Completeness, time complexity, space complexity, optimality

A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical

Description : A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical

Last Answer : A. Heuristic 

List the various type of agent program.

Description : List the various type of agent program.

Last Answer : Simple reflex agent program. Agent that keep track of the world. Goal based agent program. Utility based agent program

List some properties of SMA* search.

Description : List some properties of SMA* search. 

Last Answer : * It will utilize whatever memory is made available to it.  * It avoids repeated states as for as its memory allow.  * It is complete if the available memory is sufficient to store ... available for entire search tree, the search is optimally efficient.  *Hill climbing.  *Simulated annealing.

List the performance measures of search strategies.

Description : List the performance measures of search strategies.

Last Answer : i. Completeness ii. Optimality iii. Time complexity iv. Space complexity

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.

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

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

Description : 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

Last Answer : (D) Depth first search

Which inverts a complete resolution strategy? a) Inverse resolution b) Resolution c) Trilogy d) None of the mentioned

Description : Which inverts a complete resolution strategy? a) Inverse resolution b) Resolution c) Trilogy d) None of the mentioned

Last Answer : a) Inverse resolution

In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Last Answer : b) The entire tree so far been generated must be stored in BFS

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

What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Description : What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Last Answer : a) Search & Logic

To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Last Answer : d) Planning Graphs

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

Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Description : Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Last Answer : c) Problem decomposition

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

There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

Inheritance Search a) True b) False

Description : Inheritance Search a) True b) False

Last Answer : a) True

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 sentence will be unsatisfiable if the CNF sentence is unsatisfiable? a) Search statement b) Reading statement c) Replaced statement d) Original statement

Description : Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable? a) Search statement b) Reading statement c) Replaced statement d) Original statement

Last Answer : d) Original statement

A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Description : A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Last Answer : a) Deductive Systems

What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Description : What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Last Answer : b) Hash table of previously seen positions

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 values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Description : Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Last Answer : a) Pruned leaves x and y

Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Last Answer : c) Alpha-beta pruning

What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Description : What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Last Answer : a) Regression planning

What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Description : What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Last Answer : c) Relevant actions

How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : d) 4

What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Description : What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Last Answer : a) Progression planning

How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : b) 2

What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects

Description : What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects

Last Answer : d) Both Preconditions & Effects

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

General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Description :  The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Last Answer : b) Game Tree

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned