In providing services in computer science, transport, and operations research a queue is a buffer where various entities such as data,

objects, persons, or even ts are stored and waiting to be processed. The most well known operation of the queue is the First-In-First-Out (FIFO) queue process In a FIFO queue, the first element in the queue will be the first one out; this is equivalent to the requir ement that whenever an element is added, all elements that were added before hav e to be removed before the new element can be invoked. There are two basic operations associated with a queue: enqueue and dequeue. Enq ueue means adding a new item to the rear of the queue while dequeue refers to re moving the front item from queue and returns it in item. Following code shows how to implement a queue using arrays: // // // // // // // // // // // // ArrayQueue class CONSTRUCTION: with no initializer ******************PUBLIC OPERATIONS********************* void enqueue( x ) --> Insert x Object getFront( ) --> Return least recently inserted item Object dequeue( ) --> Return and remove least recent item boolean isEmpty( ) --> Return true if empty; else false void makeEmpty( ) --> Remove all items ******************ERRORS******************************** getFront or dequeue on empty queue

/** * Array-based implementation of the queue. * @author Mark Allen Weiss */ public class ArrayQueue implements Queue { /** * Construct the queue. */ public ArrayQueue( ) { theArray = new Object[ DEFAULT_CAPACITY ]; makeEmpty( ); } /** * Test if the queue is logically empty. * @return true if empty, false otherwise. */ public boolean isEmpty( ) { return currentSize == 0; } /** * Make the queue logically empty. */ public void makeEmpty( ) { currentSize = 0; front = 0; back = -1; }

/** * Return and remove the least recently inserted item * from the queue. * @return the least recently inserted item in the queue. * @throws UnderflowException if the queue is empty. */ public Object dequeue( ) { if( isEmpty( ) ) throw new UnderflowException( "ArrayQueue dequeue" ); currentSize--; Object returnValue = theArray[ front ]; front = increment( front ); return returnValue; } /** * Get the least recently inserted item in the queue. * Does not alter the queue. * @return the least recently inserted item in the queue. * @throws UnderflowException if the queue is empty. */ public Object getFront( ) { if( isEmpty( ) ) throw new UnderflowException( "ArrayQueue getFront" ); return theArray[ front ]; } /** * Insert a new item into the queue. * @param x the item to insert. */ public void enqueue( Object x ) { if( currentSize == theArray.length ) doubleQueue( ); back = increment( back ); theArray[ back ] = x; currentSize++; } /** * Internal method to increment with wraparound. * @param x any index in theArray's range. * @return x+1, or 0 if x is at the end of theArray. */ private int increment( int x ) { if( ++x == theArray.length ) x = 0; return x; } /** * Internal method to expand theArray. */ private void doubleQueue( )

{ Object [ ] newArray; newArray = new Object[ theArray.length * 2 ]; // Copy elements that are logically in the queue for( int i = 0; i < currentSize; i++, front = increment( front ) ) newArray[ i ] = theArray[ front ]; theArray = newArray; front = 0; back = currentSize - 1; } private private private private Object [ ] theArray; int currentSize; int front; int back;

private static final int DEFAULT_CAPACITY = 10; } /** * Exception class for access in empty containers * such as stacks, queues, and priority queues. * @author Mark Allen Weiss */ public class UnderflowException extends RuntimeException { /** * Construct this exception object. * @param message the error message. */ public UnderflowException( String message ) { super( message ); } } // // // // // // // // // // Queue interface ******************PUBLIC OPERATIONS********************* void enqueue( x ) --> Insert x Object getFront( ) --> Return least recently inserted item Object dequeue( ) --> Return and remove least recent item boolean isEmpty( ) --> Return true if empty; else false void makeEmpty( ) --> Remove all items ******************ERRORS******************************** getFront or dequeue on empty queue

/** * Protocol for queues. * @author Mark Allen Weiss */ public interface Queue { /** * Insert a new item into the queue.

* @param x the item to insert. */ void enqueue( Object x ); /** * Get the least recently inserted item in the queue. * Does not alter the queue. * @return the least recently inserted item in the queue. * @exception UnderflowException if the queue is empty. */ Object getFront( ); /** * Return and remove the least recently inserted item * from the queue. * @return the least recently inserted item in the queue. * @exception UnderflowException if the queue is empty. */ Object dequeue( ); /** * Test if the queue is logically empty. * @return true if empty, false otherwise. */ boolean isEmpty( ); /** * Make the queue logically empty. */ void makeEmpty( ); }