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
Explanation: Strategies that know whether one non-goal state is “more promising” than another are called informed search or heuristic search strategies.
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
Explanation: Several uninformed search techniques includes BFS, DFS, Uniform-cost, Depth-limited, Bidirectional search etc.
Which data structure conveniently used to implement BFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of these
Explanation: Queue is the most convenient data structure, but memory used to store nodes can be reduced by using circular queues.
Which data structure conveniently used to implement DFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of these
Explanation: DFS requires node to be expanded the one most recent visited, hence stack is convenient to implement.
Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node.
a) True
b) False
Explanation: Breadth-first search is optimal when all step costs are equal, because it always expands the shallowest unexpanded node. If the solution exists in shallowest node no irrelevant nodes are expanded.
uniform-cost search expands the node n with the………..
a) Lowest path cost
b) Heuristic cost
c) Highest path cost
d) Average path cost
Explanation: Uniform-cost search expands the node n with the lowest path cost. Note that if all step costs are equal, this is identical to breadth-first search.
