You can do it
  1. Merge sort uses ?
  2. The elements of an array are stored successively in memory cells because
  3. Which data structure allows deleting data elements from and inserting at rear?
  4. Linked list are not suitable data structure of which one of the following problems ?
  5. Which of the following algorithm design technique is used in the quick sort algorithm?
  6. Which data structure is used in breadth first search of a graph to hold nodes?
  7. ……………. Is a pile in which items are added at one end and removed from…
  8. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  9. Which of the following is two way list?
  10. In linear search algorithm the Worst case occurs when
  11. Which of the following is not a limitation of binary search algorithm?
  12. The complexity of Binary search algorithm is
  13. Which of the following data structure can't store the non-homogeneous data elements?
  14. The situation when in a linked list START=NULL is
  15. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  16. The Average case occur in linear search algorithm
  17. Arrays are best data structures
  18. Which of the following data structure cant store the non-homogeneous data elements?
  19. The operation of processing each element in the list is known as
  20. The memory address of fifth element of an array can be calculated by the formula
  21. The complexity of merge sort algorithm is
  22. The term push and pop is related to the
  23. Which of the following data structure store the homogeneous data elements?
  24. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  25. To represent hierarchical relationship between elements, Which data structure is suitable?
  26. Which of the following data structure is not linear data structure?
  27. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  28. If the values of a variable in one module is indirectly changed by another module, this situation is…
  29. Two main measures for the efficiency of an algorithm are
  30. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…