Question 7 Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h 1 and h 2 . Further suppose […]

Question 8 Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of […]

Question 3 Consider the following recurrence: Then, which of the following statements is/are TRUE? A f (2^ n -1) 2^ n -1 B f (2 ^n […]

Question 11 Merge sort uses A Divide and conquer strategy B Backtracking approach C Heuristic search D Greedy approach AlgorithmsSortingGATE 1995 Question 11 Explanation:  Merge sort […]