This assignment involves changing your assignment #8 (or the sample solution) to use a queue, implemented as a dynamically allocated ring array. See Chapter #16 for details on ring arrays.

This means that our customers are now always added at the end (tail) of the queue and removed from the front (head) of our queue.

When the queue becomes too small it is enlarged.

You are provided with the main program ("a11main.cpp"). The Customer class ("Customer.h" and "Customer.cpp") is unchanged from previous assignments. You are given the Customer DB header file ("CustomerDB.h"), and a sample executable ("a11soln.exe").

You are to complete and submit "CustomerDB.cpp".

Updated: Tue Mar 15th, 2011