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

24) Which of the following expressions accesses the (i,j)th entry of an (m x n) matrix stored in column major form?

25) Sparse matrices does not have

26) The minimum number of edges in a connected cyclic graph on 11 vertices is

27) Which of the following is a collection of items into which items can be inserted arbitrarily and from which only the smallest item can be removed