1. ► String matching is quite common in scripting languages

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

3. ► Greedy algorithm works in bottom up manner

4. ► Greedy algorithm doesn’t guarantee global optimal

5. ► Dijkstra’s algorithm makes greedy choice

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

7. ► Dynamic programming works in the top down manner

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

9. ► Greedy algorithms always select local best possible solution

10. ► Dynamic programming makes use of previously calculated solution

11. ► Graph coloring can be used to solve processor register allocation in compilers

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

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

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

15. ► Greedy choice can never give optimal result