# Stacks and Queues Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Stacks and Queues ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Stacks and Queues comprehensively.

## 2. In stack terminology, the __________operations are known as push and pop operations respectively.

Delete

Insert

Both (a) and (b)

None of the above

## 3. A common example of a queue is people waiting in line at a__________.

Bus stop

Movie hall

Shopping mall

None of the above

## Answer & Solution

**A . Bus stop**

No Solution for this Answer..! Report or Discus this Question

## 4. A data structure in which an element is added and removed only from one end, is known as

Queue

Stack

In-built structure

None of the above

## 5. A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

Queue

Circular queue

Dequeue

Priority queue

## 6. A data structure where elements can be added or removed at either end but not in the middle

Linked lists

Stacks

Queues

Deque

## 7. A data structure where elements can be added or removed at either end but not in the middle is called …

Linked lists

Stacks

Queues

Dequeue

## 8. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

Queue

Stack

Tree

Linked list

## 9. A normal queue, if implemented using an array of size MAX_SIZE, gets full when

Rear = MAX_SIZE – 1

Front = (rear + 1)mod MAX_SIZE

Front = rear + 1

Rear = front

## Answer & Solution

**A . Rear = MAX_SIZE – 1**

No Solution for this Answer..! Report or Discus this Question

## 10. A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DELETEMIN(Q)(Q). For a sequence of operations, the keys chosen are in

Non-increasing order

Non-decreasing order

Strictly increasing order

Strictly decreasing order

## Answer & Solution

**D . Strictly decreasing order**

No Solution for this Answer..! Report or Discus this Question

## 11. A queue data-structure can be used for −

Expression parsing

Recursion

Resource allocation

All of the above

## Answer & Solution

**C . Resource allocation**

No Solution for this Answer..! Report or Discus this Question

## 12. A queue is a ?

FIFO (First In First Out) list

LIFO (Last In First Out) list

Ordered array

Linear tree

## Answer & Solution

**A . FIFO (First In First Out) list**

No Solution for this Answer..! Report or Discus this Question

## 13. A queue is a,

FIFO (First In First Out) list

LIFO (Last In First Out) list

Ordered array

Linear tree

## Answer & Solution

**A . FIFO (First In First Out) list**

No Solution for this Answer..! Report or Discus this Question

## 14. A stack works on the principle of____________.

LIFO

LAFO

LIFF

None of the above

## 15. 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.

Queue linked list

Stacks linked list

Both of them

Neither of them

## Answer & Solution

**A . Queue linked list**

No Solution for this Answer..! Report or Discus this Question