class CircularList
{
  int front;
  int rear;
  int[] array;

  CircularList(int size)  //the constructor  
    //initialize front
    //initialize rear
    //declare array to be of size size

  void InsertFront(int element)
    //this method should insert the given element at the 
    //front of array, updating front and rear as 
    //appropriate.

  void InsertRear(int element)
    //this method should insert the given element at the 
    //rear of array, updating front and rear as 
    //appropriate.

  int RemoveFront()
    //this method should remove the front element from 
    //array and return it, updating front and rear as 
    //appropriate.

  int RemoveRear()
    //this method should remove the rear element from 
    //array and return it, updating front and rear as 
    //appropriate.

  boolean IsEmpty()
    //this method returns true if array is empty, false 
    //otherwise.

  boolean IsFull()
    //this method returns true if array is full, false 
    //otherwise.

} //end CircularList class