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

push, pop

insert, delete

pop, push

delete, insert

** Question No : 16**

______ is very useful in situation when data have to stored and then retrieved in reverse order.

Stack

Queue

List

Link list

** Question No : 17**

……………. Is a pile in which items are added at one end and removed from the other.

Queue

Stack

List

None of the above

** Question No : 18**

Which data structure allows deleting data elements from and inserting at rear?

Stacks

Dequeues

Queues

Binary search tree

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

mn

max(m,n)

min(m,n)

m+n-1

** Question No : 20**

Which of the following data structure can't store the non-homogeneous data elements?

Arrays

Records

Pointers

Stacks

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

Stacks linked list

Queue linked list

Both of them

Neither of them