Basics
1. Which of the following is/are the levels of implementation of data structure
A.  Abstract level B.  Application level C.  Implementation level D.  All of the above
2. ……………….. level is where the model becomes compatible executable code.
A.  Abstract level B.  Application level C.  Implementation level D.  All of the above
3.

________ is not the component of data structure.
A.  Operations B.  Storage Structures C.  Algorithms D.  None of the above
4. Which of the following is not the part of ADT description?
A.  Data B.  Operations C.  Both of the above D.  None of the above
5. Which of the following is non-liner data structure?
A.  Stacks B.  List C.  Strings D.  Trees
6. Which of the following data structure is non linear type?
A.  Strings B.  Lists C.  Stacks D.  Graph
7. Which of the following data structure is linear type?
A.  Graph B.  Trees C.  Binary tree D.  Stack
8. To represent hierarchical relationship between elements, Which data structure is suitable?
A.  Dequeue B.  Priority C.  Tree D.  Graph
9.

Match the following.

a) Completeness 

i) How long does it take to find a solution

b) Time Complexity 

ii) How much memory need to perform the search.

c) Space Complexity 

iii) Is the strategy guaranteed to find the solution when there in one.
A.  a-iii, b-ii, c-i B.  a-i, b-ii, c-iii C.  a-iii, b-i, c-ii D.  a-i, b-iii, c-ii
10. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….
A.  Underflow B.  overflow C.  houseful D.  saturated