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 perform depth-first traversal
To detect cycles in a graph

Which data structure is commonly used to implement BFS?

Stack
Queue
Priority Queue
Hash Table

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 V)

In BFS, how are vertices visited?

In depth-first order
In breadth-first order
In random order
In reverse order

What type of graph can BFS be applied to?

Directed and undirected graphs
Only directed graphs
Only undirected graphs
Only weighted graphs

Breadth-First Search (BFS) Posttest