1 In the circular array implementation of a queue a the front index chases the rear index around the array b the front index is always less than or equal to the rear index 2 The items in a priority...

1 In the circular array implementation of a queue

a the front index chases the rear index around the array

b the front index is always less than or equal to the rear index

2 The items in a priority queue are ranked from

a smallest (highest priority) to largest (lowest priority)

b largest (highest priority) to smallest (lowest priority)

3 Complete the linked implementation of the queue ADT discussed in this chapter. Verify that exceptions are raised when preconditions are violated.