If a queue is represented by using arrays, once the rear pointer reaches the maximum, we cannot add any more item to the queue even if we delete all the items. To do so, we have to reset the rear pointer whenever both rear and front are pointing to the maximum possible position. Another clever way is to use circular lists, which uses the modulo arithmetic, to automatically readjust the rear pointer back to the first position after the last position.