Tag: Breadth-First Search

With your own example explain breadth first traversal technique, and analyze its complexity

Breadth First Search (BFS) Breadth-first-search is a graph search algorithm that begins at the root node (or arbitrarily selected vertex in graph) and explores all the neighboring nodes. Then for each of those nearest nodes it explores their unexplored neighbo...

Tagged As: Algorithm, BFS, Breadth-First Search, Complexity of BFS, example

6 Comments

Draw a graph and illustrate how depth-first search and breadth-first search differ

This was the first question in Computer Officer Examination in 2010 conducted by Public Service Commission (Lok Sewa Aayog). This question is from the section ‘Data Structures and Algorithms’. The question carries 10 marks. Answer Breadth-first search (BFS...

Tagged As: BFS, Breadth-First Search, computer officer exam, Data Structures and Algorithms, Depth-First Search, DFS, Graphs, Lok Sewa Aayog, Public Service Commission, Solved Question of Computer Officer

2 Comments