we present simple realization of queue by means of an arrayqof fixed capacitystoring its elements since the main rule with the queue adt is that we insert and delete objects according to the fifo principlewe must decide how we are going to keep track of the front and rear of the queue