This chapter described another array-based implementation of a queue that uses no special data field—such as count or full (see Programming Problem 3)—to distinguish between the full and empty conditions. In this implementation, you declare max_queue + 1 locations for the array items, but use only max_queue of them for queue items. You sacrifice one array location by making front the index of the location before the front of the queue. The queue is full if front equals(back+1) % (MAX_QUEUE+1), but the queue is empty if front equals back.
a. Does this implementation have the same space requirements as the count or full implementations? Why?
b. Implement dais array-based approach.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.