1. | Which of the following is/are the levels of implementation of data structure |
Answer: (d).All of the above
|
2. | ……………….. level is where the model becomes compatible executable code. |
Answer: (c).Implementation level
|
3. | …………… is not the component of data structure. |
Answer: (d).None of the above
|
4. | Which of the following is not the part of ADT description? |
Answer: (d).None of the above
|
5. | Which of the following is non-liner data structure? |
Answer: (d).Trees
|
6. | Which of the following data structure is non linear type? |
Answer: (d).Graph
|
7. | Which of the following data structure is linear type? |
Answer: (d).Stack
|
8. | To represent hierarchical relationship between elements, Which data structure is suitable? |
Answer: (c).Tree
|
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. |
Answer: (c).a-iii, b-i, 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 …. |
Answer: (b).overflow
|