Virtual Labs

What is the primary purpose of Depth-First Search (DFS)?

To explore all vertices and edges of a graph
To find the shortest path in a graph
To perform level-order traversal
To detect cycles in a graph

Which data structure is commonly used to implement DFS?

Stack
Queue
Priority Queue
Hash Table

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

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

In DFS, how are vertices visited?

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

What type of graph can DFS be applied to?

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

Depth-First Search (DFS) Posttest