CC204: DSA Prefinals

What is the purpose of the pointers FRONT and REAR in a queue?

• They track the first and last elements, respectively.

• They manage the size of the queue.

• They point to the middle element.

• They are irrelevant in queue implementation.

What is the initial value of FRONT and REAR when a queue is empty?

• 0

• -1

• 1

• null

What does the Enqueue operation do in a queue?

• Removes an element

• Adds an element to the front

• Adds an element to the end

• Checks if the queue is full

How is the Dequeue operation performed in a queue?

• Removes the last element

• Removes the middle element

• Removes the first element

• Removes all elements simultaneously

What does the IsEmpty operation check in a queue?

• If the queue is partially filled

• If the queue is full

• If the queue is empty

• If the queue has a certain size

What is the purpose of the Peek operation in a queue?

• Remove the front element

• Get the value of the front without removing it

• Check if the queue is full

• Add an element to the front

What is the primary limitation of a standard queue?

• It cannot store elements

• It cannot perform Dequeue operation

• It can only add elements to the front

• It cannot utilize empty spaces after dequeueing

When initializing a circular queue, what values are set for FRONT and REAR?

• 0

• 1

• -1

• null

What is the purpose of the Enqueue operation in a circular queue?

• Remove an element

• Add an element to the front

• Add an element to the end

• Check if the queue is full

What is the purpose of the Dequeue operation in a circular queue?

• Add an element to the front

• Remove an element from the front

• Remove an element from the end

• Check if the queue is empty