ADS Quiz 5

Which data structure is used to implement a queue?

• Array

• Linked List

• Both A and B

• Tree

A queue follows which principle?

• LIFO

• FILO

• FIFO

• LILO

What are the basic operations of a queue?

• insert, delete

• enqueue, dequeue

• push, pop

• add, remove

What is the condition for queue overflow in an array implementation?

• rear < max

• rear = max - 1

• front > rear

• front = rear

Which pointer in a queue indicates the position from where element is deleted?

• rear

• front

• mid

• temp

In array implementation, initially front and rear are set to:

• 0

• -1

• 1

• null

Which operation will be used to add an element to the queue?

• enqueue

• pop

• insert

• addNode

Which of the following is not true for a queue?

• It has two ends

• Insertion is at front

• Deletion is from front

• Insertion is at rear

In linked list implementation of a queue, enqueue operation is performed at:

• head

• tail

• front

• middle

Queue overflow can be avoided in array implementation by:

• Using linked list

• Using circular queue

• Increasing size

• All of the above