Quiz on Queue Operations

Which of the following is true about a normal queue?

• It follows the Last-In-First-Out (LIFO) principle.

• It follows the First-In-First-Out (FIFO) principle.

• It allows insertion at both ends.

• None of the above.

What operation is performed when an element is added to a queue?

• Dequeue

• Enqueue

• Insert

• Append

What operation is performed when an element is removed from a queue?

• Dequeue

• Enqueue

• Delete

• Remove

If the elements "A", "B", and "C" are added to a queue in that order, what will be the order of removal?

• C, B, A

• A, C, B

• A, B, C

• C, A, B

Which of the following is an application of a normal queue?

• Recursion

• Balancing symbols

• CPU scheduling

• Backtracking

In a normal queue, where is the new element added?

• At the front

• At the rear

• In the middle

• At any position

In a normal queue, where is the element removed from?

• At the front

• At the rear

• In the middle

• At any position

What happens when you try to dequeue an element from an empty queue?

• The operation succeeds.

• The operation fails and returns null.

• The queue goes into an underflow state.

• An element with a default value is returned.

What is the time complexity of the enqueue operation in a simple queue implemented using an array?

• O(1)

• O(n)

• O(log n)

• O(n^2)

What is the time complexity of the dequeue operation in a simple queue implemented using an array?

• O(1)

• O(n)

• O(log n)

• O(n^2)