Question 35 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 36 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 37 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 38 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 […]