Which of the following statements is true?
I. As the number of entries inthe hash table incrases, the number of collisions increases.
II. Recursive programs are efficient.
III. The worst time complexity of quick sort is O (n2).
IV. Binary search implemented using a linked list is efficient.
| A. | I and II |
| B. | II and III |
| C. | I and IV |
| D. | I and III |
Answer : D Explanation : Recursive programs take more time than the equivalent non-recursive version and so not efficient. This is because of the function call overhead. In binary search, since every time the current list is probed at the middle, random access is preferred. Since linked list does not support random access, binary search implemented this way in inefficient. |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
