Data Structures Set I

123456789101112131415161718192021222324252627
Across
  1. 4. BTREE is an example of a _____ tree-8
  2. 5. Sort which is done completely in RAM-8
  3. 6. Insert is middle easier than array for this data structure 6,4
  4. 8. HEAP is implemented using this _______ - 5
  5. 9. Creator of Quick Sort-5
  6. 12. Creator of Shortest Path Algo for Graph-6,8
  7. 14. Algorithm for Minimum Spanning Tree -7
  8. 17. We can do binary search in array because it is ....... 6
  9. 20. When we convert infix to postfix notation, what do we put in the stack? - 8
  10. 21. BUBBLE and QUICK Sort are categorised as _____ sort-8
  11. 22. Data Structure used for creating Index-5
  12. 23. Data Structure used to get n largest number-4
  13. 24. Name of city where there is 7 bridge problem-10
  14. 27. Where do you found collisions in buckets 7
Down
  1. 1. Data Structure used in recursion-5
  2. 2. Data Structure used in Breadth First Search-5
  3. 3. Name of Data Stucture Professor! 6,4 or 7,3 or 5,5
  4. 7. Rotate RTAOIPNTI quickly !!-9
  5. 8. The list used by graphs - 9
  6. 10. What is A in ADT
  7. 11. Example of LOSSLESS COMPRESSION - 7
  8. 13. Creator of BTREE-6,5
  9. 15. This is a balanced Binary Search Tree-3
  10. 16. Tower of ______-5
  11. 18. This sort has efficency of n log n-5
  12. 19. The sort where we find the minimum in each pass (9)
  13. 25. In which data structure do we use the MATRIX? -5
  14. 26. Sort named after Donald-5