Question 17 Which one of the following statements is false? A Optimal binary search tree construction can be performed efficiently using dynamic programming. B Breadth-first search […]

Question 18 Consider the following two functions: Which of the following is true? A g1(n) is O(g2(n)) B g1 (n) is O(3) C g2 (n) is […]

Question 44 The numbers 1, 2, …. n are inserted in a binary search tree in some order. In the resulting tree, the right subtree of […]

Question 14 In a depth-first traversal of a graph G with n vertices, k edges are marked as tree edges. The number of connected components in […]