** Question No : 1**

Which if the following is/are the levels of implementation of data structure

Application level

Abstract level

Implementation level

All of the above

** 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 ?

3,4,5,2,1

3,4,5,1,2

5,4,3,1,2

1,5,2,3,4

** Question No : 3**

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

** 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 ?

3 additions and 2 deletions

2 deletions and 3 additions

3 deletions and 4 additions

3 deletions and 3 additions

** Question No : 5**

_______ level is where the model becomes compatible executable code

Abstract level

Implementation level

Application level

All of the above

** Question No : 6**

Linked list are not suitable data structure of which one of the following problems ?

Binary search

Insertion sort

Radix sort

Polynomial manipulation

** Question No : 7**

Stack is also called as

Last in first out

First in last out

Last in last out

First in first out

Wanna test your skill? Here are some exams we prepared for you. So if you need to test your skill just attempt any exam from bellow.

Exam Name | No. Of Q | Link |

Computer set 1 | 30 | Start |

Computer set 2 | 30 | Start |

Computer set 3 | 30 | Start |

Computer set 4 | 30 | Start |

Computer set 5 | 30 | Start |

Computer set 6 | 30 | Start |

Computer set 7 | 30 | Start |

Computer set 8 | 30 | Start |

Computer set 9 | 30 | Start |

Computer set 10 | 30 | Start |

Computer set 11 | 30 | Start |

Computer set 12 | 30 | Start |