public class Queue
{
	int DEFAULT_MAX_SIZE = 100;
	int [] queue = new int[DEFAULT_MAX_SIZE];
	int head = 0;	//the index of the head data element
	int tail = -1;	//the index of the tail data element
	int size = 0; 
	
	public Queue()
	{
		
	}
	
	public Queue(int newSize)
	{
		queue = new int[newSize];
	}
	
	public void add(int data)
	{
		//check if the queue is not full b/c then you can add an element
			//increment tail to next slot
			//assign the data value to the tail element
			//increment size
	}
	
	public int remove()
	{
		//check if the queue is not empty b/c then you can remove an element
			//increment head to next slot
			//decrement size
			//return the value from the old head element 
	}
	
	public void print()
	{
		//iterate through the array and print out all the elements from head to tail	
	}
	
	public boolean isFull()
	{
		//if the tail is at the end of the array, return true
		//return false otherwise
	}
	
	public boolean isEmpty()
	{
		//return true if the size is 0, and false otherwise
	}
}