Give a complete implementation of a priority queue using an array of ordinary queues. For your ordinary queue, use the version from edu.colorado.collections.ArrayQueue in Figure 7.9.

Transcribed Image Text:

FIGURE 7.9 Specification and Implementation of the Array Version of the Generic Queue Class Generic Class ArrayQueue * public class ArrayQueue from the package edu.colorado.collections An ArrayQueue is a queue of references to E objects. Limitations: (1) The capacity of one of these queues can change after it's created, but the maximum capacity is limited by the amount of free memory on the machine. The constructors, clone, ensureCapacity, add, and trimToSize will result in an OutOfMemoryError when free memory is exhausted. (2) A queue's capacity cannot exceed the largest integer, 2,147,483,647 (Integer.MAX_VALUE). Any attempt to create a larger capacity results in failure due to an arithmetic overflow.