Yes, only one general
Yes, that is how it works. This of course has its own problems, but seems to make the current implementation easier.
As i have mentioned, the output
by hand in the interest of trying to get uniformity.
looked at my
actual code and I count the person in the chair as
This of course puts the counts off for
type at almost all the printouts.
Thinking about it, I
are arguments for various ways; (counting them done as
soon as they
leave the chair set, not counting them until they are
actually done, etc.)
So my answer at this time is to count the person in the chair however you want, but explain how you counted them in your write up.
No. the key problem is managing priorities within existing queues. your approach would get around that...
Your question is interesting in that logically the buffer is circular, but physically it is not. i would argue that the general CANNOT sit in 19/0. this is based purely on my physical view of the world. if you really want to do it otherwise, then do so, but present the argument in your writeup....
The project desciption says "Assume that you DO NOT have a pointer datatype for the Barber Shop." Specifically, you are not supposed to use pointers for any of the linked lists needed to implement the queues.Instead, you must use array indices. The queues should be linked lists implemented inside an array, with the "next" pointers being array indices.
Yes. There are two ways, both done stupidly because the effect is
"sticky". The easiest way is with setw:
You have to do setw(0) or you'll
wind up with everything else you
out taking a minimum of two
columns.That's why it's stupid.