a) Stacks b) Queues c) Priority Queues d) All of the mentioned Answer: a Explanation: DFS ...
View QuestionWhich data structure conveniently used to implement BFS?
a) Stacks b) Queues c) Priority Queues d) All of the mentioned Answer: ...
View QuestionWhich 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
View QuestionStrategies 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 & ...
View QuestionWhat is the general term of Blind searching?
a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) Heuristic Search Answer: ...
View QuestionWhich search implements stack operation for searching the states?
a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned Answer: b Explanation: ...
View QuestionWhich search algorithm imposes a fixed depth limit on nodes?
a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional ...
View QuestionWhich 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 Answer: b
View QuestionHow many parts does a problem consists of?
a) 1 b) 2 c) 3 d) 4 Answer: d Explanation: The four parts of the problem are ...
View QuestionWhat is the space complexity of Depth-first search?
a) O(b) b) O(bl) c) O(m) d) O(bm) Answer: d Explanation: O(bm) is the space complexity ...
View Question