Problem 1 Consider an array-based queue implementation. Suppose we wish to use an extra bit in queue records to indicate whether a queue is empty. 1. Modify the declarations and operations for a circular queue to accommodate this feature. 2. Would you expect the change to be worthwhile?

Problem 1

Consider an array-based queue implementation. Suppose we wish to use an extra bit
in queue records to indicate whether a queue is empty.
1. Modify the declarations and operations for a circular queue to accommodate this feature.
2. Would you expect the change to be worthwhile?

Problem 2

Given the following specification of a front operation for queue:
ItemType Front
Function: Returns a copy of the front item on the queue.
Precondition: Queue is not empty.
Postcondition: Queue is not changed.
1. Write this operation as client code, using operations from the QueType class. (Remember,
the client code has no access to the private variables of the class).
2. Write this function as a new member function of the QueType class.

Problem 3

Implement the following specification for a Boolean function in the client program
that returns true if two queues are identical and false otherwise.
Boolean Identical(QueType queue1, QueType queue2)
Function: Determines if two queues are identical.
Precondition: queue1 and queue2 have been initialized.
Postconditions: Queues are unchanged.
You may use any of the member functions of QueType. But, you may not assume any
knowledge of the queue’s implementation.

Problem 4

Write the body for a function that replaces each copy of an item in a queue with
another item. Use the following specification. (This function is in the client program.)
ReplaceItem(QueType queue, int oldItem, int newItem)
Function: Replaces all occurrences of oldItem with newItem.
Precondition: Queue has been initialized.
Postcondition: Each occurrence of oldItem in queue replaced by newItem.
You may use any of the member functions of QueType. But, you may not assume any
knowledge of the queue’s implementation.