Public class cricularqueue // cyclic queue <br/>{< br/> string [] queues; <br/> int head = 0; <br/> int rear = 0; <br/> Public cricularqueue () <br/>{< br/> queues = new string [10]; <br/>}< br/> Public cricularqueue (INT length) <br/>{< br/> queues = new string [length]; <br/>}</P> <p> Public bool empty () // The cyclic queue is empty. <br/>{< br/> If (Head = rear) <br/>{< br/> return true; <br/>}< br/> else <br/> return false; </ P> <p >}< br/> Public bool full () // The cyclic queue is full <br/>{< br/> If (Rear + 1) % queues. length = head) <br/>{< br/> return true; <br/>}< br/> else <br/> return false; <br/>}</P> <p> Public void enter (string Val) // enter the queue <br/>{< br/> If (! Full () <br/>{< br/> queues [rear] = val; <br/> rear = (Rear + 1) % queues. length; <br/>}</P> <p >}< br/> Public String outqueue () // output queue <br/>{< br/> string val = ""; <br/> If (! Empty () <br/>{</P> <p> val = queues [head]; <br/> head = (Head + 1) % queues. length; <br/> return val; <br/>}</P> <p> Public int getlength () <br/>{< br/> return (Rear + queues. length-head) % queues. length; </P> <p >}< br/>}