Which if the following is/are the levels of implementation of data structure

A. Application level

B. Abstract level

C. Implementation level

D. All of the above

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. Which of the following name does not relate to stacks?
  2. Binary search algorithm can not be applied to
  3. The complexity of merge sort algorithm is
  4. The situation when in a linked list START=NULL is
  5. Each array declaration need not give, implicitly or explicitly, the information about
  6. Which of the following data structure is not linear data structure?
  7. The complexity of Binary search algorithm is
  8. Which of the following is not a limitation of binary search algorithm?
  9. If the values of a variable in one module is indirectly changed by another module, this situation is…
  10. _____ is not the component of data structure.
  11. Arrays are best data structures
  12. _______ level is where the model becomes compatible executable code
  13. Linked list are not suitable data structure of which one of the following problems ?
  14. Which one of the following permutations can be obtained the output using stack assuming that the input…
  15. A variable P is called pointer if
  16. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  17. To represent hierarchical relationship between elements, Which data structure is suitable?
  18. The complexity of linear search algorithm is
  19. Two dimensional arrays are also called
  20. The Average case occur in linear search algorithm
  21. For an algorithm the complexity of the average case is
  22. Which of the following data structure cant store the non-homogeneous data elements?
  23. Which of the following statement is false?
  24. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  25. Which of the following data structure is linear data structure?
  26. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  27. Stack is also called as
  28. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  29. Merge sort uses ?
  30. The term push and pop is related to the