×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
Which if the following is/are the levels of implementation of data structure
2.
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called
3.
………….. level is where the model becomes compatible executable code
4.
Stack is also called as
5.
Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
i) It exports a type.
ii) It exports a set of operations
6.
…………… is not the component of data structure.
7.
Which of the following is not the part of ADT description?
8.
Inserting an item into the stack when stack is not full is called
9.
……………. Is a pile in which items are added at one end and removed from the other.
10.
………… is very useful in situation when data have to stored and then retrieved in reverse order.