NIELIT 2017 July Scientist B (IT) - Section B: 4

Question

What are the appropriate data structures for graph traversal using Breadth First Search(BFS) and Depth First Search(DFS) algorithms?

• A. Stack for BFS and Queue for DFS
• B. Queue for BFS and Stack for DFS
• C. Stack for BFS and Stack for DFS
• D. Queue for BFS and Queue for DFS

Comments

Option B

Answer 1

BFS stands for Breadth First Search is a vertex based technique for finding a shortest path in graph. It uses a Queue data structure which follows first in first out. In BFS, one vertex is selected at a time when it is visited and marked then its adjacent are visited and stored in the queue.

 

DFS stands for Depth First Search is a edge based technique. It uses the Stack data structure, performs two stages, first visited vertices are pushed into stack and second if there is no vertices then visited vertices are popped.

Answer 2

(B) Queue - BFS and Stack -DFS