You can do it
  1. The memory address of the first element of an array is called
  2. The Average case occur in linear search algorithm
  3. Which of the following is two way list?
  4. Which of the following statement is false?
  5. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  6. Which of the following data structure is non linear type?
  7. Binary search algorithm can not be applied to
  8. When determining the efficiency of algorithm the time factor is measured by
  9. Each array declaration need not give, implicitly or explicitly, the information about
  10. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  11. Which of the following algorithm design technique is used in the quick sort algorithm?
  12. _______ level is where the model becomes compatible executable code
  13. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  14. To represent hierarchical relationship between elements, Which data structure is suitable?
  15. Which of the following data structures are indexed structures?
  16. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  17. The difference between linear array and a record is
  18. For an algorithm the complexity of the average case is
  19. _____ is not the component of data structure.
  20. The memory address of fifth element of an array can be calculated by the formula
  21. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  22. Which of the following is not the required condition for binary search algorithm?
  23. Linked list are not suitable data structure of which one of the following problems ?
  24. If the values of a variable in one module is indirectly changed by another module, this situation is…
  25. The complexity of linear search algorithm is
  26. Stack is also called as
  27. Which of the following name does not relate to stacks?
  28. The operation of processing each element in the list is known as
  29. ……………. Is a pile in which items are added at one end and removed from…
  30. When new data are to be inserted into a data structure, but there is no available space; this situation…