Question No : 1
Which if the following is/are the levels of implementation of data structure
Question No : 2
Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
Question No : 3
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called
Question No : 4
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
Question No : 5
_______ level is where the model becomes compatible executable code
Question No : 6
Linked list are not suitable data structure of which one of the following problems ?
Question No : 7
Stack is also called as