Write a program that simulates a supermarket with a number of checkouts. Checkouts in a linked list, and each fund has in turn a queue consisting of a linked list of customers. Service time for a customer randomly using the boundary and is assumed to be rectangular distributed in the range [30.150] (OK, that persist can run with exponential instead). A simple model for how often customers arrive is the following: Every minute will be n customers where n is 0, 1, 2, 3 or 4 with equal probability. (the ambitious using the Poisson distribution instead). Each new arrival customer goes into the currently shortest queue. Use a simple status printout showing the number of customers in each queue. The number of customers served and the average waiting time for each cash may also be interesting to see. As an alternative to the linked list in the implementation can be vectors (vector or array) to be used. In this case, the allocation be dynamic and the number of funds determined at runtime.
9 freelancers are bidding on average $107 for this job
I have 4 years of working experience and 10 years of c++ and java programming experience. My main working environment is linux and c++, so I think I can fulfill your job very soon and beautifully. Plz trust me.