CSE 382 Algorithms and Data Structures
Barbara Nostrand, Ph.D.
Electrical Engineering and Computer Science
Simulate a checkout area of a supermarket consisting of one super-express counter, two express counters,nbsp; and numStandLines standard counters. All customers with numSuper or fiewer items proceed to a super-express counter with the fewest customers, p; unless there is a free express or regular line, and those with between numSuper and numExp proceed to the express counter with the shortest line unless there is a free standard line.
The number of items bought will be a random numer in the range 1 to maxItems. The time required to process a customer is 5 seconds per item.
Calculate the following statistics:
|numSuper||The number of items allowed in the super-express line.|
|numExp||The number of items allowed in the express line.|
|numStandLines||The number of regular lines.|
|arrivalRate||The arrival rate of customers per hour.|
|maxItems||The maximum number of items.|
|maxSimTime||The simulation time.|
|Collaboration||You will complete this project with your lab partner.|
|Implementation||You must implement your system as a Java application. You may use Jgrasp. Do not use netbeans or produce a Java applet.|
|Environment||Your program must execute on the podium computer in our classroom.|
|Turn in||You must turn in both a report containing complete program sources and an executable electronic version of your program.|