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 […]

Question 19 The postfix expression for the infix expression A + B*(C + D)/F + D*E is: A AB + CD + *F/D + E* B […]

Question 1 FORTRAN implementation do not permit recursion because A they use static allocation for variables B they use dynamic allocation for variables C stacks are […]

Question 19 The recurrence relation that arises in relation with the complexity of binary search is: A T(n) = T(n/2) + k, k a constant B T(n) […]

Question 11 Which of the following algorithm design techniques is used in the quicksort algorithm? A Dynamic programming B Backtracking C Divide and conquer D Greedy method […]

Question 20 In which one of the following cases is it possible to obtain different results for call-by reference and call-by-name parameter passing methods? A Passing a […]

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 […]

Question 49 Let T(n) be a function defined by the recurrence T(n) = 2T(n/2) + √n for n ≥ 2 and T(1) = 1 Which of […]