Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Perform and Visualize Breadth First Traversal

Choose difficulty:

Beginner

Intermediate

Advanced

Which data structure is used to implement BFS?

a: Stack Explanation

Explanation

b: Queue Explanation

Explanation

c: Priority Queue Explanation

Explanation

d: Tree Explanation

Explanation

Consider the graph: 1 -- 2 -- 4 | | 3 -- 5 If BFS starts at node 1, what is the order of traversal?

a: 1, 2, 3, 4, 5 Explanation

Explanation

b: 1, 3, 2, 5, 4 Explanation

Explanation

c: 1, 2, 3, 5, 4 Explanation

Explanation

d: 1, 3, 2, 4, 5 Explanation

Explanation

BFS can be used to determine:

a: Shortest path in an unweighted graph Explanation

Explanation

b: Cycle detection in a directed graph Explanation

Explanation

c: Topological sorting Explanation

Explanation

d: Finding strongly connected components Explanation

Explanation

In BFS, which of the following statements is true?

a: It may visit a node multiple times Explanation

Explanation

b: It always uses DFS stack internally Explanation

Explanation

c: It visits all neighbors of a node before moving deeper Explanation

Explanation

d: It is not suitable for finding shortest paths Explanation

Explanation

Consider the following weighted graph (all edges have weight 1) and start BFS at node A: A -- B -- D | C -- E What is the BFS traversal order?

a: A, B, C, D, E Explanation

Explanation

b: A, C, B, E, D Explanation

Explanation

c: A, B, C, E, D Explanation

Explanation

d: A, C, B, D, E Explanation

Explanation

Which of the following BFS applications is incorrect?

a: Level-order traversal of a tree Explanation

Explanation

b: Finding shortest path in an unweighted graph Explanation

Explanation

c: Finding connected components Explanation

Explanation

d: Depth-first exploration of nodes Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)