Data Structures and Algorithms MCQ

Which if the following is/are the levels of implementation of data structure Abstract level Application level Implementation level Allof the above

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called …… AVL tree Red-black tree Lemma tree None of the above

3 level iswherethe modelbecomes compatibleexecutablecode Abstract level Application level Implementation level All of the above

Stack isalso called Last in first First in last Last in last First in first

Which of the following is true about the characteristics of abstract data types? It exports a type. It exports a set of operations True, False False, True True, True False, False

6 is notthe componentof datastructure. Operations Storage Structures Algorithms None of above

Which of the following is not the part of ADT description? Data Operations Both of the above None of the above

Inserting an item into the stack when stack is not full is called Operation and deletion of item form the stack, when stackis notempty is called operation.

Isa pilein whichitems areadded at one andremoved from theother. Stack Queue List None of the above

isveryusefulinsituationwhendatahave stored and then retrieved in reverseorder. Stack Queue List Link list