Queues can be represented using linear arrays and have the variable REAR that point to the position from where insertions can be done. Suppose the size of the array is 20, REAR=5. What is the value of the REAR after adding three elements to the queue?

Queues can be implemented using linear arrays; such that when items are added or removed from the queue, the queue repositions its front and rear elements.

The value of the REAR after adding 3 elements is 5

Given that:

--- the rear value

--- size of array

--- number of elements to be added

When 3 elements are added, the position of the REAR element will move 3 elements backward.

However, the value of the REAR element will remain unchanged because the new elements that are added will only change the positioning of the REAR element and not the value of the REAR element.

Read more about queues at: