Design analysis and algorithms(21AML42)

1234567891011121314151617
Across
  1. 2. String matching
  2. 3. Greedy techique
  3. 8. Dynamic problem
  4. 9. Combining all the elements
  5. 13. Matrix multiplication
  6. 14. involves dividing the problem
  7. 15. Encoding, decoding
  8. 16. partition
  9. 17. Graph algorithms
Down
  1. 1. Optimal solution
  2. 4. analyzing algorithms
  3. 5. Shortest distance
  4. 6. backtracking
  5. 7. Minimum spanning tree
  6. 8. state space tree
  7. 10. Decrease and conquer
  8. 11. Traversing algorithm
  9. 12. branch and bound