Homework Laboratory Assignment 4:
The next assignment of the semester is to experiment with queues. Assume for the moment that you have completely forgotten how t0 use structures. Yet, you wish to implement a queue of integers, say a. About the only choice you have is to implement the queue of integers in an array alone. You decide to maintain a pointer to the front of the queue in a[0], and a pointer to the rear of the queue in a[1]. At a particular instance in time, the queue might look like a[0] = 4 a[1] = 7 a[2] = garbage a[3] = garbage a[4] = 234 a[5] = 345 a[6] = 456 a[7] = 567 In this way, we can pass the array name to functions and know that we have all the information necessary. Implement a queue of integers using this model. Decide what you will do as the queue travels up the array. Implement a suitable Full() function as well as a suitable Empty() function, as well as, of course, functions for Arrive() and Serve(). Model your queue application with a menu. Program due date: TR class: Thursday, 12 FEB 1998 9:55 am. MWF class: Friday, 13 FEB 1998, 9:30am. (Yes, reviewing for the test can be accomplished by working on a homework assignment as long as you do your own work.)
Standard handin requirements.