Question

this is a data structures course

21. (20 points) We want to define a generic class ArrayQueue, which uses a circular array. public class Array Queue< II (1) List all the instance variables needed for the class 11 (2) define a constructor with a parameter specifying the initial capacity // (3) define the remove method

Answer 1

Please find the answer below, all the details are mentioned as the comments.

Answer 1:

//to save the default capacity
private static final int DEFAULT_CAPACITY = 10;
//to store the elements of the queue
private T[] queue; 
// total number of elements currently in the queue
private int size,
// front element index
private int front, 
// back element index
private int back;        

Answer 2:

//constructor  
public ArrayQueue (int initialCapacity){
   //initialization of elements
   size = 0;
   front = 0;
   rear = 0;
//creation of the array for the initialCapacity passed
   queue = (T[])(new Object[initialCapacity]);
}

Answer 3:

public T remove(){
   //get the front element
   T e = getFront();
   //free the location
   A[front%size] = null;
   //increment the front
   front++;
   //decrease the size
   size--;
   //return the element
   return e;
}

Please let us know in the comments if you face any problems.