Question 71 : What is the space complexity of Depth-first search?
1. O(
2. b) O(bl)
3. O(m)
4. O(bm)
View Answer   Discuss with Members

Question 72 : How many successors are generated in backtracking search?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 73 : When is breadth-first search is optimal?
1. When there is less number of nodes
2. When all step costs are equal
3. When all step costs are unequal
4. None of the mentioned
View Answer   Discuss with Members

Question 74 : Which search is implemented with an empty first-in-first-out queue?
1. Depth-first search
2. Breadth-first search
3. Bidirectional search
4. None of the mentioned
View Answer   Discuss with Members

Question 75 : How many types are available in uninformed search method?
1. 3
2. 4
3. 5
4. 6
View Answer   Discuss with Members

Question 76 : Which search strategy is also called as blind search?
1. Uninformed search
2. Informed search
3. Simple reflex search
4. All of the mentioned
View Answer   Discuss with Members

Question 77 : Which is the best way to go for Game playing problem?
1. Linear approach
2. Heuristic approach (Some knowledge is stored)
3. Random approach
4. An Optimal approach
View Answer   Discuss with Members

Question 78 : Which search method takes less memory?
1. Depth-First Search
2. Breadth-First search
3. Linear Search
4. Optimal search
View Answer   Discuss with Members

Question 79 : A production rule consists of
1. A set of Rule
2. A sequence of steps
3. Set of Rule & sequence of steps
4. Arbitrary representation to problem
View Answer   Discuss with Members

Question 80 : The major component/components for measuring the performance of problem solving
1. Completeness
2. Optimality
3. Time and Space complexity
4. All of the mentioned
View Answer   Discuss with Members