Consider the following class ArrayQueue: class ArrayQueue { } public static final int CAPACITY private int...

Transcribed Image Text:

Consider the following class ArrayQueue: class ArrayQueue { } public static final int CAPACITY private int [] data; private int front = 0; private int qSize = 0; public ArrayQueue() {} public ArrayQueue (int capacity) { } public int size() {} public boolean isEmpty() {} public void enqueue (int e) { } public int first () { } public int dequeue() { } public String toString() { } Write a method removeOccurences = 1000; (int num) that removes all occurences of num from the queue. The remaining elements should keep their original order in the queue. Solution Consider the following class ArrayQueue: class ArrayQueue { } public static final int CAPACITY private int [] data; private int front = 0; private int qSize = 0; public ArrayQueue() {} public ArrayQueue (int capacity) { } public int size() {} public boolean isEmpty() {} public void enqueue (int e) { } public int first () { } public int dequeue() { } public String toString() { } Write a method removeOccurences = 1000; (int num) that removes all occurences of num from the queue. The remaining elements should keep their original order in the queue. Solution

Answer rating: 100% (QA)

The purpose of this question is to evaluate the candidates comprehension and skill in executing fundamental queue operations and algorithms Specifically the question aims to assess the candidates capa... View the full answer