19) Which of the following is useful in traversing a given graph by breadth first search

20) Which of the following is useful in implementing quick sort

21) The maximum degree of any vertex in a simple graph with n vertices is

22) The number of edges in a regular graph of degree d and n vertices is

23) The correct matching for the following pairs is
(A) All pairs shortest path
(B) Quick sort
(C) Minimum weight spanning tree
(D) Connected Components
(1) Greedy
(2) Depth-first search
(3) Dynamic programming
(4) Divide and conquer