Explanation: Several uninformed search techniques includes BFS, DFS, Uniform-cost, Depth-limited, bi-directional search etc. 4. Which data structure conveniently used to implement BFS?
A. Stacks
B. Queues
C. Priority Queues
D. Circular Queues
Answer:A
Explanation: Several uninformed search techniques includes BFS, DFS, Uniform-cost, Depth-limited, bi-directional search etc. 4. Which data structure conveniently used to implement BFS?
A. Stacks B. Queues C. Priority Queues D. Circular Queues
Explanation: Queue is the most convenient data structure, but memory used to store nodes can be reduced by using circular queues. 5. Which data structure conveniently used to implement DFS?