first consider the situation that occurs if we enqueue objects into without dequeuing any of them we would have rwhich is the same condition that occurs when the queue is empty hencewe would not be able to tell the difference between full queue and an empty one in this case fortunatelythis is not big problemand number of ways for dealing with it exist the solution we describe here is to insist that can never hold more than objects this simple rule for handling full queue takes care of the final problem with our implementationand leads to the pseudo-coded descriptions of the queue methods given in code fragment note our introduction of an implementation-specific exceptioncalled fullqueueexceptionto signal that no more elements can be inserted in the queue also note the way we compute the size of the queue by means of the expression ( rmod