Queue ADT

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?

• ABCD

• DCBA

• ABDA

• ABDC

Let size of queue is 4. The following operations are performed in order.

enqueue(10)

enqueue(20)

enqueue(30)

enqueue(40)

what will be the result after executing enqueue(50)?

• Queue Empty

• Queue Full

• None

• 5

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

In a Queue head pointer is incremented by one

• Each enqueue

• Each Dequeue

• Both

• None

Insertion and Deletion operation in Queue is known as ?

• Push and Pop

• Enqueue and Dequeue

• Array and Linked List

• Stack and Linked List

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

• Only front pointer

• Only rear pointer

• Both front and rear pointer

• None of the front and rear pointer

Robin Robin Scheduling uses

• Stack

• Queue

• Array

• Linked list