Queue c++

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

Which of the following is not the type of queue?

• Ordinary queue

• Single ended queue

• Circular queue

• Priority queue

What is the term for inserting into a full queue known as?

• overflow

• underflow

• null pointer exception

• program won’t be compiled

Insertion and deletion operation in queue is known as

• Push and Pop

• Insert and Delete

• Enqueue and Dequeue

• None of the above

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• DCBA

• ABDC

• ABCD

• DCAB

What is the time complexity of enqueue operation?

• O(logn)

• O(nlogn)

• O(n)

• O(1)

After performing these set of operations, what does the final list look contain?

InsertFront(10);

InsertFront(20);

InsertRear(30);

DeleteFront();

InsertRear(40);

InsertRear(10);

DeleteRear();

InsertRear(15);

display();

• 10 30 10 15

• 20 30 40 15

• 20 30 40 10

• 10 30 40 15

In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?

• Only front pointer

• Only rear pointer

• Both front and rear pointer

• None of the front and rear pointer

Which of the following is not a real-life example of a Queue? 

• Waiting in line to order food at a restaurant 

• Waiting in line to buy movie tickets 

• Managing tasks on a CPU 

• Using a stack of dishes 

Where would pointers be pointing if...

1. Eli leaves the Queue.
2. Hanna joins the Queue.
3. Adam joins the Queue.
4. Jason leaves the Queue.

• front = 0 rear = 5

• front = 1 rear = 4

• front = 2 rear = 4

• front = 0 rear = 4

• front = 2 rear = 5