# Queues MCQs Questions Answers – Data Structures

## Data Structures

1. Which deletion can be insertion take place only at the other end(rear) and done from one end (front)?
b) Stack
c) Tree
d) queue
e)both a&c

1. For Breadth-First Traversal on a graph is the data structure required?
a) Stack
b) queue
c) array
d) Tree
2. e) Both a&b

1. Queue follows __________
a) FIFO (First In First Out) principle
b) LIFO (Last In First Out) principle
c) Linear tree
d) Ordered array
2. e) all of these

1. Circular Queue is also called ________
a) Square Buffer
b) Ring Buffer
c) Rectangle Buffer
d) Curve Buffer
2. e) None of these

1. In what order will they be removed If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time
a) ABCD
b) DCAB
c) DCBA
d) ABDC
2. e) All of the above

1. Which elements not in middle but can be inserted or deleted at/from both the ends?
a) Circular queue
b) Priority queue
c) Queue
d) DE queue
2. e) All of these

1. if implemented using an array of size MAX_SIZE, gets full when
a) Front = (rear + 1)mod MAX_SIZE
b) Front = rear + 1
c) Rear = MAX_SIZE – 1
d) Rear = front
2. e) None of above

1. Major role of queue server in ______________
a) Simulation of heapsort
b) Simulation of arbitrary linked list
c) Simulation of limited resource allocation
d) Simulation of recursion
2. e) Both a&b

1. Which is not the type of queue?
a) Single ended queue
b) Ordinary queue
c) Circular queue
d) Priority queue
2. e) Both c&d

1. ……… form of access is used to add and remove nodes from a queue.
a) LIFO, Last In First Out
b) FIFO, First In First Out
c) Both a and b
d) None of these
2. e) INFO

1. Which fields holds the elements of the stack.
a) INFO
b) TOP
d) NULL
2. e) None

1. Which form of access is used to add remove nodes from a stack?
a) LIFO
b) FIFO
c) Both A and B
d) None of these
2. e) INFO

1. Which pointer behaves as the top pointer variable of the stack.
a) Stop pointer
b) Begin pointer
c) avail pointer
d) start pointer
2. e) Both b&c

1. ……… of the queue added a new nodes
a) Front
b) middle
c) back
d) Both A and B
2. e) None

1. A null pointer of the last node in the list signals ……….
a) Beginning of the stack
b) Bottom of the stack
c) Middle of the stack
d) In between some value
2. e) Both a&b

1. The queue is a ………
a) FIFO
b) LIFO
c) LOFI
d) FILO
2. e) All of these

1. Which name does not relate to stacks?
a) FIFO lists
b) LIFO lists
c) Push down lists
d) Piles
2. e) both a&b