1. The front will always be pointing to the first element of the queue.
2. Each time a new element is inserted into the queue, the value of rear is incremented by one i.e., Rear = (Rear + 1);
3. Each time when an existing element is deleted from the queue, the value of rear is incremented by one i.e., Front = (Front + 1);
4. The front is the initial or first location of the queue where Rear indicates the last entry location in the queue.
First read the answer fully, then try to explain it in your own words. After that, open a few related questions and compare the concepts. This method helps you remember the topic for a longer time and improves exam preparation.