Match the pairs in the following, assuming depth-first search runs on an…
PYQ GATE 1989Modified — slightly modified from the official paper; see the solution
Match the pairs in the following, assuming depth-first search runs on an n-vertex graph represented by an adjacency matrix: (A) O(log n) (p) Heapsort (B) O(n) (q) Depth-first search (C) O(n log n) (r) Binary search (D) O(n²) (s) Selection of the kth smallest element in a set of n elements.
Attempted by 3 students.
Sign up free to check your answer
Sign up freeLoading lesson…