Data Structures — Queue

What is the primary characteristic of a Queue data structure?

Which operation in a queue removes an element?

In a queue implemented using an array, what happens when the rear reaches the last index but there is space at the front?

Which of the following is NOT a valid application of a queue?

What is the time complexity of enqueue and dequeue operations in a queue implemented using a linked list?

Consider a circular queue of size 5. If front = 3 and rear = 1, how many elements are currently in the queue?

Which of the following statements is TRUE for a circular queue?

What is the main advantage of using a circular queue over a simple linear queue?

In which scenario is a priority queue more appropriate than a simple queue?

Which of the following is the correct sequence of front and rear pointers after three enqueue operations on an empty queue?