Topological sorting

Stack operations

Depth-First Search (DFS) on Transposed Graph

Graph Transposition

Depth-First Search (DFS)

Θ(n²) 

O(m logm) 

O(n+m)

Θ(mn)

O(m)

BFS works only on directed graphs

BFS uses a stack while DFS uses a queue

BFS is faster than DFS in all cases

DFS uses a priority queue, while BFS uses a simple list

BFS explores nodes level by level, while DFS explores as deep as possible before backtracking

T[k]=Θ(5^2k)

T[k]=O(5^k)

T[k]=Θ(k³⋅5^k)

T[k]=Θ(k²⋅5^k)

T[k]=O(k⋅5^k)

n^1.9999

logn

n²-10n

None of these

n

n logn

In a weakly connected graph, there is an undirected path between every pair of

A weakly connected graph has a directed path between every pair of nodes,

A weakly connected graph must also be strongly connected.

A weakly connected graph has a directed path between every pair of nodes, but

A weakly connected graph has no directed path between any pair of nodes.

Quicksort always uses the last element of the array as the pivot.

Quicksort is a stable sorting algorithm.

Quicksort has a worst-case time complexity of O( n log⁡n ).

Quicksort performs better than merge sort in all cases.

The efficiency of quicksort depends heavily on the choice of the pivot.

O( n logn ), with the primary operation being partitioning.

O( n² ), with the primary operation being swapping adjacent elements.

O( n logn ), with the primary operation being merging two sorted halves.

O( n²  ), with the primary operation being finding the minimum element in the unsorted portion.

O( n ), with the primary operation being comparing elements.

[3, 7, 5, 10, 8, 6]

[3, 5, 6, 7, 10, 8]

[3, 7, 5, 8, 10, 6]

[3, 7, 6, 10, 5, 8]

[3, 6, 5, 7, 10, 8]