array implementing this circular view of is actually pretty easy each time we increment or rwe compute this increment as "( mod nor "( mod ,respectively recall that operator "modis the modulo operatorwhich is computed by taking the remainder after an integral division for example divided by is with remainder so mod specificallygiven integers and such that > and we have mod / that isif mod ythen there is nonnegative integer qsuch that qy java uses "%to denote the modulo operator by using the modulo operatorwe can view as circular array and implement each queue method in constant amount of time (that iso( timewe describe how to use this approach to implement queue in code fragment code fragment implementation of queue using circular array the implementation uses the modulo operator to "wrapindices around the end of the array and it also includes two instance variablesf and rwhich index the front of the queue and first empty cell after the rear of the queue respectively