2.7: Start by computing the demand for hamburgers each day using the given table and system logic
4.4: Start by letting Dn be the number of hamburgers demanded on the nth day, and assume that demand between days is independent
Sep 12 2.10, 4.6
2.10: Keep track of the number of jobs waiting to be processed by CPU A and CPU B
4.6: Let B be a random variable that takes value 0 with probability 1/2, and 1 with probability 1/2. Map B = 0 to CPU A, and B = 1 to CPU B.
Sep 26 5.1, 5.3abcd, 5.5, 5.6
Oct 1 5.3ef, 5.8, 5.10, 5.12
Oct 3 5.15, 5.17, 5.20, 5.21
5.21: take the average number of cars in each hour and round
to obtain an estimate for the arrival rate in that hour; ignore the
standard error part of the question
Oct 8 5.13, 5.14
Oct 10 redo 5.20, 5.21
Oct 15 6.4, 6.5
6.4: assume the process starts in state 1 with certainty