Breadth first search

Depth first search

Topological sort

None of these

A queue can be created using two stack data-structures.

A stack can be created using two queue data-structures.

Both the above statements (a and b) are true.

Both the above statements (a and b) are false.

A depth-first search traversal of a graph.

A breadth-first search traversal of a graph.

Computing the minimum spanning tree of a graph.

Computing the all-pairs shortest path in a graph.

O(n)

O(n log n)

O(n²)

O(n³)

Flow maximization algorithm

Shortest path algorithm

Minimum spanning tree algorithm

Topological sort