1. ► String matching is quite common in scripting languages

2. ► Greedy algorithm doesn’t guarantee global optimal

3. ► Dijkstra’s algorithm makes greedy choice

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

5. ► Dynamic programming also follows divide and conquer approach

6. ► Fibonacci series can be calculated efficiently with dynamic programming

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

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

9. ► Rabin-Karp algorithm reuses previously calculated hash values

10. ► Dynamic programming makes use of previously calculated solution

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

12. ► Heuristics are based on proper mathematical proofs

13. ► Heuristic solutions can provide reasonable solutions quite fast

14. ► Dynamic programming works in the top down manner

15. ► Greedy algorithm works in bottom up manner