Home

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

Correct Answer : D.


Download Objective type questions of Data Structure PDF

Get all objective type questions of Data Structure MCQ

Also checkout these categories

Kidney cysts and tumors MCQ Solids, Liquides, Gases MCQ Rearrangement Set 15 MCQ Statement & Assumption MCQ C# Programming MCQ Phylum - Amphibia MCQ Electric Current MCQ Transmission of Heat MCQ Rearrangement Set 9 MCQ Profit and Loss MCQ Fact MCQ Astronomy MCQ

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

Submit
Load More..
You can do it
  1. Which of the following data structure is non linear type?
  2. Merge sort uses ?
  3. Which data structure is used in breadth first search of a graph to hold nodes?
  4. ……………. Is a pile in which items are added at one end and removed from…
  5. In linear search algorithm the Worst case occurs when
  6. Which of the following is two way list?
  7. The operation of processing each element in the list is known as
  8. Finding the location of the element with a given value is:
  9. Which of the following data structure is linear type?
  10. The difference between linear array and a record is
  11. When determining the efficiency of algorithm the time factor is measured by
  12. Two dimensional arrays are also called
  13. _______ level is where the model becomes compatible executable code
  14. Herder node is used as sentinel in ____
  15. Which of the following is not a limitation of binary search algorithm?
  16. Which of the following data structure is linear data structure?
  17. Which of the following data structures are indexed structures?
  18. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  19. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  20. Stack is also called as
  21. The complexity of Bubble sort algorithm is
  22. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  23. Which of the following case does not exist in complexity theory
  24. Which of the following is not the required condition for binary search algorithm?
  25. The complexity of merge sort algorithm is
  26. The memory address of the first element of an array is called
  27. Which of the following data structure cant store the non-homogeneous data elements?
  28. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  29. Arrays are best data structures
  30. The number of possible ordered trees with three nodes A,B,C is?