A priority queue is a queue where a numeric priority is associated with each element. Access to elements that have been inserted into the queue is limited to inspection and removal of the elements with smallest and largest priority only. A priority queue may have multiple items that are of equal priority. By bounded, it is meant that the priority queue has a maximum capacity specified when it is created, and it can never contain more than that number of items. Your specification must specify the following operations:

newPriorityQueue: make a new queue

insert: inserts an element with a certain priority

isEmpty: test if the queue is empty

isFull: test if the queue is full

maxItem: obtain the item in the queue with the highest priority

minItem: obtain the item in the queue with the lowest priority

deleteMax: remove from the queue the item with the highest priority

deleteAllMax: remove from the queue all items that are tied for the highest priority

deleteMin: remove from the queue the item with the lowest priority frequency: obtain the number of times a certain item occurs in the queue (with any priority)

please divide it into the form of

a queue adt

DIVIDED INTO

sets

signatures

preconditions

semantics

need a solution like this

Name: Queue<G>

Sets:

Q : set of queues containing items from G G : set of items that can be in the queue B : {true, false} N0: set of non-negative integers

Signatures:

newQueue<G>(n) : N0 Q Q.isEmpty: B Q.isFull: B Q.add(g): G Q

Q.remove: G

Preconditions: For all q Q, g G newQueue<G>(n): n > 0 q.isEmpty: none q.isFull: none

q.add(g): q is not full q.remove:q is not empty

Semantics: For q Q, g G, n N0 newQueue<G>(n) : create a queue of items from G with capacity n q.isEmpty: returns true if q is empty, false otherwise q.isFull: return true if q is full, false otherwise q.add(g): enqueues g at the back of the queue q.remove: removes then returns the item at the front of the queue