Queues and Circular Queues

Which of the following properties is associated with a queue?

• First In Last Out

• First In First Out

• Last In First Out

• Last In Last Out

In a circular queue, how do you increment the rear end of the queue?

• rear++

• (rear+1) % SIZE

• (rear % SIZE)+1

• d) rear–-

What is the time complexity of enqueue operation?

• O(logn)

• O(nlogn)

• O(n)

• O(1)

A circular queue is implemented using an array of size 10.

The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index.

• 0

• 7

• 9

• 10

Which is not the type of queue?

• Single ended queue

• Ordinary queue

• Circular queue

• Priority queue

A queue(ARR) of size 5:

enqueue(1)

enqueue(2)

enqueue(3)

enqueue(4)

enqueue(5)

dequeue()

Now how many more elements can be enqueued ARR?

• 1

• 2

• 0

• 3

In Circular Queue (ARR) of size 3:

enqueue(1)

enqueue(2)

enqueue(3)

dequeue()

enqueue(4)

Index of Element 4?

• 0

• 1

• 2

• 3

Circular Queue (Arr) of Size 3:

enqueue(1)

enqueue(2)

enqueue(3)

dequeue()

dequeue()

dequeue()

enqueue(4)

Index of element 4 in Arr?

• 0

• 1

• 2

• 3

Check in Circular Queue is Empty:

int isEmpty() {

if (front == 0){

return 1;

}

return 0;

}

Find the mistake in the above code?

• front == -1

• No Mistake

• front == rear+1

• front == rear -1

// Check if the queue is full

int isFull() {

if ((front == rear + 1) || (front == 0 && rear == SIZE - 1)) {

return 1;

}

return 0;

}

• front == rear - 1

• front == 1

• No Mistake

• rear == SIZE - 1