Question No : 15
Inserting an item into the stack when stack is not full is called _______ Operation and deletion of item form the stack, when stack is not empty is called _______operation.
Question No : 16
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Question No : 17
……………. Is a pile in which items are added at one end and removed from the other.
Question No : 18
Which data structure allows deleting data elements from and inserting at rear?
Question No : 19
Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?
Question No : 20
Which of the following data structure can't store the non-homogeneous data elements?
Question No : 21
A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one 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 |