Design and Analysis of Algorithm

1234567891011
Across
  1. 3. Searching method start at beginning of the list and check one by one element
  2. 4. technique for arranging elements in an order
  3. 5. all pair shortest path problem
  4. 7. data structure used in FIFO branch and bound technique?
  5. 8. data structure is used to perform recursion
  6. 11. algorithm to find transitive closure matrix
Down
  1. 1. pop() operation is called on an empty queue, what is the condition called?
  2. 2. graph is usually represented in the form of?
  3. 5. collection of tress?
  4. 6. collection of related, similar or dissimilar elements
  5. 9. algorithm to find single source shortest path problem with negative edge weights.
  6. 10. Data structure represented as essential complete binary tree?