Search Algos

Which is true regarding BFS (Breadth First Search)?

• BFS will get trapped exploring a single path

• The entire tree so far been generated must be stored in BFS

• BFS is not guaranteed to find a solution if exists

• BFS is nothing but Binary First Search

Answer explanation

Explanation: Regarding BFS-The entire tree so far been generated must be stored in BFS.

What is a heuristic function?

• A function to solve mathematical problems

• A function which takes parameters of type string and returns an integer value

• A function whose return type is nothing

• A function that maps from problem state descriptions to measures of desirability

Which of the following mentioned searches are heuristic searches?

(i) Random Search

(ii) Depth First Search

(iii) Breadth First Search

(iv) Best First Search

• Only iv.

• All i., ii., iii. and iv.

• ii. and iv.

• None of the above

Answer explanation

In the best first search, which is also known as the heuristic search, the agent picks up the best node based upon the heuristic value irrespective of where the node is.

Consider the following statement:"The search first begins from the root node and the first one of the child node’s sub-tree is completely traversed. That is, first all the one-sided nodes are checked, and then the other sided nodes are checked."Which search algorithm is described in the above definition?

• The Breadth First Search (BFS)

• The Depth First Search (DFS)

• The Depth First Search (DFS)

• The Depth First Search (DFS)

Which search is implemented with an empty first-in-first-out queue?

• DFS

• BFS

• Bidirectional seach

• None of the mentioned

When is breadth-first search is optimal?

• When there is less number of nodes

• When all step costs are equal

• When all step costs are unequal

• None of the mentioned

How many successors are generated in backtracking search?

• 1

• 2

• 3

• 4

Answer explanation

Explanation: Each partially expanded node remembers which successor to generate next because of

these condition, it uses less memory.

Which search strategy is also called as blind search?

• Uninformed search

• Informed search

• Simple reflex search

• All of the mentioned

What is the other name of informed search strategy?

• Simple search

• Heuristic search

• Online search

• None of the mentioned

Today is

• Chor 9

• Chor 7

• Chor 8

• I'm still in Chor 1