| 11. | Travelling salesman problem is an example of |
| a. | Dynamic Algorithm |
| b. | Greedy Algorithm |
| c. | Recursive Approach |
| d. | Divide & Conquer |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).Greedy Algorithm
|
| 12. | Project scheduling is an example of |
| a. | greedy programming |
| b. | dynamic programming |
| c. | divide and conquer |
| d. | none of the above. |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).dynamic programming
|
| 13. | Which of the following is an example of dynamic programming approach? |
| a. | Fibonacci Series |
| b. | Tower of Hanoi |
| c. | Dijkstra Shortest Path |
| d. | All of the above |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (d).All of the above
|
| 14. | Which of the following uses memoization? |
| a. | Greedy approach |
| b. | Divide and conquer approach |
| c. | Dynamic programming approach |
| d. | None of the above |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (c).Dynamic programming approach
|
| 15. | Which of the following asymptotic notation is the worst among all? |
| a. | Ο(n+9378) |
| b. | Ο(n3) |
| c. | nΟ(1) |
| d. | 2Ο(n) |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).Ο(n3)
|
| 16. | Minimum number of moves required to solve a Tower of Hanoi puzzle is |
| a. | 2n2 |
| b. | 2n-1 |
| c. | 2n - 1 |
| d. | 2n - 1 |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (d).2n - 1
|
| 17. | Program with highest run-time complexity is |
| a. | Tower of Hanoi |
| b. | Fibonacci Series |
| c. | Prime Number Series |
| d. | None of the above |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (a).Tower of Hanoi
|
| 18. | The time complexity of quick sort is ………….. |
| a. | O(n) |
| b. | O(n2) |
| c. | O(n log n) |
| d. | O(log n) |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (c).O(n log n)
|
| 19. | Two main measures for the efficiency of an algorithm are |
| a. | Processor and memory |
| b. | Complexity and capacity |
| c. | Time and space |
| d. | Data and space |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (c).Time and space
|
| 20. | The time factor when determining the efficiency of algorithm is measured by |
| a. | Counting microseconds |
| b. | Counting the number of key operations |
| c. | Counting the number of statements |
| d. | Counting the kilobytes of algorithm |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).Counting the number of key operations
|
