Across
- 4. is a procedure for solving a problem
- 8. sorting technique with worst case time complexity O(n2)
- 9. Which knapsack problem, is solved most efficiently using greedy approach
- 10. graph problem solved by using dynamic programming
- 12. approach to solve activity selection problem
Down
- 1. dynamic programming uses principle of
- 2. bit is reserved as a parity bit in an ASCII set
- 3. is used for solving the N Queens Problem
- 5. Best feasible solution
- 6. Search technique needs sorted input list
- 7. invented all pair shortest path
- 11. Which is external sorting algorithm