191CSC401T Design and Analysis of Algorithm

123456789101112131415161718192021222324
Across
  1. 3. problems maximize or minimize an function
  2. 5. Strassen
  3. 6. optimal merge problem is associated with way merge
  4. 7. spanning tree that is associated with the minimum cost is called a tree
  5. 10. algorithm like quick sort does not require extra memory for carrying out the sorting procedure the technique is
  6. 11. code is a length code
  7. 13. spanning tree that is used to partition an array in aquick sort is called the element
  8. 14. max heap the largest key is at the
  9. 16. collection of feasible points that offer a solution is called region
  10. 17. traversal
  11. 21. and space
  12. 22. node that can potentially lead to a solution is called a node
  13. 24. polynomial time
Down
  1. 1. knapsack problems use the ratio of profit to
  2. 2. main measure for the efficiency of an algorithm are
  3. 4. data structure
  4. 7. and bound uses a stack as well as datastruture
  5. 8. region
  6. 9. uses search
  7. 12. sort
  8. 13. part of the maintenance work you are entrusted with the work of rearranging the library book in a shelf in proper order at the end of each day .the ideal arranging choice will be sort
  9. 15. faster matrix multiplication algorithm was developed by
  10. 18. means polynomial
  11. 19. is defined to be a
  12. 20. spanning
  13. 23. time factor when determine the efficiency of algorithm is measured by counting the number of