Chapter 8, Problem 51CRP

Explanation of Solution

Modified interface for Queue and its code:

The modified interface for queue and its corresponding queue of integer’s implementation in java and C# is shown below:

//Interface for QueueType

interface QueueType

{

  //Function declaration to add a value to queue

  public void insertQueue(int item);

  //Function declaration to remove a value from queue

  public int removeQueue();

  //Function declaration for check if queue is empty

  public boolean isEmpty();

  //Function declaration for check if queue is Full

  public boolean isFull();

}

//Class for QueueOfInteger

class QueueOfIntegers implements QueueType

{

  //Initializes the size of queue

  private int size = 20;

  //Create an array for QueueEntries

  private int[] QueueEntries = new int[size];

/* Declare the variable for front of queue, rear of queue and length of queue*/

  private int frontQueue, rearQueue, queueLength;

  //Function definition for insert Queue

  public void insertQueue(int NewEntry)

  {

    //If the rearQueue is equal to '-1', then

    if (rearQueue == -1)

    {

      //Assign the frontQueue to "0"

      frontQueue = 0;

      //Assign the rearQueue to "0"

      rearQueue = 0;

/* Assign the Array of QueueEntries to NewEntry */

      QueueEntries[rearQueue] = NewEntry;

    }

/* If the rearQueue+1 is greater than or equal to "size" */

    else if (rearQueue + 1 >= size)

System.out.println("Queue Overflow Exception");

    //If the rearQueue+1 is less than "size"

    else if ( rearQueue + 1 < size)

/* Assign the Array of QueueEntries to NewEntry */

      QueueEntries[++rearQueue] = NewEntry;  

      //Increment the queue length

      queueLength++ ;   

  }

  //Function definition for remove a value from queue

  public int removeQueue()

  {

    //If the queue is not empty, then

    if(!isEmpty())

      //Decrement the length of queue

      queueLength--;

/* Assign the front of queue entries to element */

      int element = QueueEntries[front];

      //If the queue front is equal to rear

      if(frontQueue == rearQueue)

      {

/* Assign the value to front and rear of queue */

        frontQueue = -1;

        rear...