1. ► Heuristics are based on proper mathematical proofs

2. ► Searching is more expensive in sorted sequence

3. ► Program and data structures are two separate entities

4. ► Merge sort can be parallelized

5. ► Approximation algorithms provide bounds on the quality of the solution mathematically

6. ► Heap sort can be parallelized

7. ► O(1) is linear time complexity

8. ► Which of the following problem does not have exponential complexity

9. ► Stable sorting always preserves the order

10. ► Initial distance on unconnected nodes from the source node is infinite in Dijkstra’s algorithm

11. ► Merge sort is not a stable sort

12. ► Average case complexity of Rabin-Karp is O(nm)

13. ► For overlapping optimal substructure, dynamic programming gives optimal solution

14. ► For faster and frequent searches, sorted sequences are better to work on

15. ► Amortized analysis is applicable when there is certain relationship between cheap and expensive operations