1. In this case study, we develop a program to simulate supermarket checkout stations. To keep the program simple, we omit some important factors found in a realistic supermarket situation and ask the reader to add them back as part of the exercises.
2. Suggest a strategy for an array-based implementation of a priority queue. Will its space/time complexity be any different from the linked implementation? What are the trade-offs?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here