Virtual Labs

What is the primary purpose of Breadth-First Search (BFS)?

To traverse a graph level by level
To find the shortest path in a weighted graph
To detect cycles in a graph
To sort vertices in topological order

Which data structure is commonly used to implement BFS?

Queue
Stack
Priority Queue
Linked List

What is the time complexity of BFS for a graph with V vertices and E edges?

O(V + E)
O(V²)
O(E log V)
O(V log E)

Which type of graph is suitable for BFS traversal?

Both directed and undirected graphs
Only weighted graphs
Only acyclic graphs
Only connected graphs

What is the first step in BFS traversal?

Enqueue the starting vertex
Mark all vertices as visited
Dequeue all vertices
Sort all vertices in ascending order

Breadth-First Search (BFS) Pretest