1. ► Dijkstra’s algorithm makes greedy choice

2. ► Greedy choice can never give optimal result

3. ► String matching is quite common in scripting languages

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

5. ► Only mobility based heuristic can be applied in list scheduling

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

7. ► Heuristic solutions can provide reasonable solutions quite fast

8. ► Brute force string matching relies on char by char comparison

9. ► Rabin-Karp algorithm relies on hash function to convert strings to numbers

10. ► Greedy algorithm works in bottom up manner

11. ► Dynamic programming makes use of previously calculated solution

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

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

14. ► Heuristics are based on proper mathematical proofs

15. ► Dynamic programming works in the top down manner