Which algorithm is used to solve any kind of problem?
a) Breadth-first algorithm
b) Tree algorithm
c) Bidirectional search algorithm
d) None of the mentioned
Explanation: Tree algorithm is used because specific variants of the algorithm embed different strategies.
Which search algorithm imposes a fixed depth limit on nodes?
a) Depth-limited search
b) Depth-first search
c) Iterative deepening search
d) Bidirectional search
Which search implements stack operation for searching the states?
a) Depth-limited search
b) Depth-first search
c) Breadth-first search
d) None of these
Explanation: It implements stack operation because it always expands the deepest node in the current tree.
Which search implements stack operation for searching the states?
a) Depth-limited search
b) Depth-first search
c) Breadth-first search
d) None of these
Explanation: It implements stack operation because it always expands the deepest node in the current tree.
What is the general term of Blind searching?
a) Informed Search
b) Uninformed Search
c) Informed & Unformed Search
d) Heuristic Search
Explanation: In case of uninformed search no additional information except the problem definition is given.
