Unit C
Unit C
102
Q.37 What is the best-case time complexity of selection sort?
(a) 1 (b) O (nlog (n)
(c) O (n2)
Q.38 What is the average-case time complexity of selection sort?
(a) 1 (b) O (log (n))
(c) O (n2)
Q.39 What is the worst-case time complexity of selection sort?
(a) 1 (b) O (n)
(c) O (n2)
Q.40 What is the best-case time complexity of quick sort?
(a) 1 (b) O (nlog (n)
(c) O (n2)
Q.41 What is the average-case time complexity of quick sort?
(a) 1 (b) O (log (n)
(c) O (n2)
Q.42 What is the worst-case time complexity of quick sort?
(a) 1 (b) O (n)
(c) O (n2)
Q.43 What is the average- case time complexity of merge sort?
(a) 1 (b) O (nlog (n)
(c) O (n2)
Q.44 Merge sort is also called
(a) partition exchange Sort (b) exchange sort
(c) binary sort
Q.45 Bubble sort is also called
(a) partition exchange sort (b) exchange sort
(c) binary sort
Q.46 Time complexity is inversely proportional to
(a) space complexity (b) diverse complexity
(c) none
Q.47 What is the worst-case time complexity of merge sort?
(a) 1 (b) O (nlogn)
(c) O (n2)
Q.48 Bubble sort is yet another sorting technique which works on the design of
(a) Brute force (b) greedy technique
(c) divide and conquer (d) dynamic programming
Q.49 What are the methods available in storing sequential files?
(a) Straight merging
(b) Natural merging
(c) Polyphase sort
103
(d) Distribution of Initial runs
(e) All the above
Q.50 Linear search works on the principle of
(a) brute force (b) greedy technique
(c) divide and conquer (d) dynamic programming
Q.51 Linear search is also called
(a) sequential search (b) binary search
(c) both (d) none
Q.5 Binary search works on the strategy of
(a) divide and conquer (b) brute force
(c) greedy technique (d) dynamic programming
Q.53 Bubble sort is yet another sorting technique which works on the design of
(a) brute force (b) greedy technique
(c) divide and conquer (d) dynamic programming
Answers
1. (a) 2. (a) 3. (a) 4. (b)
5. (d) 6. (c) 7. (d) 8. (a)
9. (b) 10. (c) 11. (a) 12. (b)
13. (c) 14. (b) 15. (b) 16. (a)
17. (a) 18. (c) 19. (b) 20. (b)
21. (c) 22. (c) 23. (a) 24. (d)
25. (b) 26. (b) 27. (a) 28. (a)
29. (b) 30. (b) 31. (c) 32. (c)
33. (c) 34. (c) 35. (c) 36. (c)
37. (c) 38. (c) 39. (c) 40. (b)
41. (c) 42. (c) 43. (b) 44. (a)
45. (b) 46. (a) 47. (c) 48. (a)
49. (e) 50. (a) 51. (a) 52. (a)
53. (a)
104