How many types are available in uninformed search method?
a) 3
b) 4
c) 5
d) 6
Explanation: The five types of uninformed search method are Breadth-first, Uniform-cost, Depth-first, Depth-limited and Bidirectional search.
Which search is implemented with an empty first-in-first-out queue?
a) Depth-first search
b) Breadth-first search
c) Bidirectional search
d) None of these
Explanation: Because of FIFO queue, it will assure that the nodes that are visited first will be expanded first.
When breadth-first search is optimal?
a) When there is less number of nodes
b) When all step costs are equal
c) When all step costs are unequal
d) None of the mentioned
Explanation: Because it always expands the shallowest unexpanded node.
How many successors are generated in backtracking search?
a) 1
b) 2
c) 3
d) 4
Explanation: Each partially expanded node remembers which successor to generate next because of these conditions, it uses less memory.
What is the space complexity of Depth-first search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)
Explanation: O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree.
How many parts do a problem consists of?
a) 1
b) 2
c) 3
d) 4
Explanation: The four parts of the problem are initial state, set of actions, goal test and path cost.
