Question 61 : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.)
1. O(bd+1) and O(bd+1)
2. O(b2) and O(d2)
3. O(d2) and O(b2)
4. O(d2) and O(d2)
View Answer   Discuss with Members

Question 62 : Which data structure conveniently used to implement DFS?
1. Stacks
2. Queues
3. Priority Queues
4. All of the mentioned
View Answer   Discuss with Members

Question 63 : Which data structure conveniently used to implement BFS?
1. Stacks
2. Queues
3. Priority Queues
4. All of the mentioned
View Answer   Discuss with Members

Question 64 : Which of the following is/are Uninformed Search technique/techniques
1. Breadth First Search (BFS)
2. Depth First Search (DFS)
3. Bidirectional Search
4. All of the mentioned
View Answer   Discuss with Members

Question 65 : Strategies that know whether one non-goal state is “more promising” than another are called
1. Informed & Unformed Search
2. Unformed Search
3. Heuristic & Unformed Search
4. Informed & Heuristic Search
View Answer   Discuss with Members

Question 66 : Blind searching is general term for
1. Informed Search
2. Uninformed Search
3. Informed & Unformed Search
4. Heuristic Search
View Answer   Discuss with Members

Question 67 : Which search implements stack operation for searching the states?
1. Depth-limited search
2. Depth-first search
3. Breadth-first search
4. None of the mentioned
View Answer   Discuss with Members

Question 68 : Which search algorithm imposes a fixed depth limit on nodes?
1. Depth-limited search
2. Depth-first search
3. Iterative deepening search
4. Bidirectional search
View Answer   Discuss with Members

Question 69 : Which algorithm is used to solve any kind of problem?
1. Breadth-first algorithm
2. Tree algorithm
3. Bidirectional search algorithm
4. None of the mentioned
View Answer   Discuss with Members

Question 70 : How many parts does a problem consists of?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members