- They were allowed to convert their code to whatever worked best as many found problems that were fixed in Priority Barbershop. I believe that if they used their Priority Barbership code, there will be some movement of grunts, but they should show you that.
- Look at the output runs and use those to determine if the programs work. if you have real questions then we can ask for a realtime run at a later time.
Introduction
10 for the runs. If the student has highlighted the runs appropriately, grading should be quick.
- 5 Points max for correct performance on each of the 2 input files. They either work, are highlighted, and commented or they are not.
-
If the highlights and comments do not cover the following, then
take off points:
- 5 points if they did not highlight and comment.
- 3 points if they did not comment after highlighting.
Input Files:
-
input3.2 -
- consumer sleep = 1
- print shop contents
- producer sleep = 2
-
Demonstrates: priority;
should see a total of 5 officers, 5 noncoms, 6 grunts.
- 3 officers should get hair cut 1st
- then some number of noncoms,
- then a new officer (#4)
- then noncoms and maybe a grunt
- then another officer (last input)
- then finish noncoms & grunts.
- highlight: each officer entering Barber Shop and getting hair cut, and processes dying.
25 25 25 13 13 13 13 13 25 02 02 02 02 02 02 25
-
input3.3 -
- consumer sleep = 66
- print shop contents
- producer sleep = 3
- highlight: officer entrance into Barber Shop and hair cut, grunt enter into Barber Shop, grunt hair cut.
- Demonstrates: ability to handle full queue and to handle new entries having a higher priority then those currently waiting.
should see queue fill up, 18 nc, 1 g, 3 officer. officers should get hair cut 1st, then nc, then grunts.11 12 13 14 15 15 14 12 13 11 23 24 12 13 11 12 13 11 12 13 03 25
Last modified December 21, 01 by mike@cs.hmc.edu