**Nov 5**Solutions to Exam 2 have been posted.**Oct 24**Information on Exam 2 has been posted.**Oct 17**A revised syllabus has been posted.**Sep 24**Information on the course project have been posted.**Sep 24**Solutions to Exam 1 have been posted.

- Course policy statement
- Syllabus (revised Oct 17)
- Solutions manual

**Aug 20**2.1**Aug 22**3.1, 3.2, 3.3, 3.5**Aug 27**3.6, 3.8, 3.9**Aug 29**3.31**Sep 5**3.17, 3.18, 3.19, 3.20**Sep 10**2.7, 4.4- 2.7: Start by computing the demand for hamburgers each day using the given table and system logic
- 4.4: Start by letting D
_{n}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
- 6.5: draw the transition diagram only

**Oct 17**modified 6.11, 6.17ab, 6.18- 6.18: start by finding the
*probabilities*of preferred beer brands in years 1979 and 2013 - solutions to modified 6.11

- 6.18: start by finding the
**Oct 22**finish Example 5 in Lesson 16, 6.5 (now do all parts), 6.6ac, 6.8, 6.11**Oct 24**6.14 (we did this in class), 6.16, 6.17c, 6.20, 6.21**Nov 5**7.1, 7.10**Nov 7**7.14 (warning: the solutions appear to be slightly off)**Nov 12**finish Example 1 in Lesson 20, 8.6a, 8.11a**Nov 19**8.5, 8.8abc, 8.10abcd

- 1. Sample paths (Aug 20)
- 2. Probability review (Aug 22)
- 3. Conditional probability review (Aug 27)
- 4. Conditional probability review, cont. (Aug 29)
- 5. Random variate generation (Sep 4)
- 6. Introduction to stochastic processes (Sep 10)
- 7. A general stochastic process model (Sep 12)
- 8. Arrival counting processes (Sep 24)
- 9. The Poisson arrival process (Sep 26)
- 10. Poisson processes - decomposition and superposition (Oct 1)
- 11. Nonstationary Poisson processes (Oct 3)
- 12. Poisson processes - review (Oct 8)
- 13. Nonstationary Poisson processes - review (Oct 10)
- 14. Introduction to Markov chains (Oct 15)
- 15. Markov chains - time-dependent performance measures (Oct 17)
- 16. Markov chains - time-independent performance measures (Oct 22)
- 17. Markov chains - modeling and assumptions (Oct 24)
- 18. A quick start guide to Markov processes (Nov 5)
- 19. An introduction to queueing processes (Nov 7)
- 20. The birth-death process (Nov 12)
- 21. The birth-death process - performance measures (Nov 14)
- 22. Standard queueing models (Nov 19) - updated Nov 21
- 23. Lab - helicopter maintenance (Nov 21)
- Solutions
- MATLAB code: experiment.m, simulation.m, event.m, print_info.m
- MATLAB code solutions: experiment.m, simulation.m, event.m, print_info.m

- 24. Lab - how to win at Monopoly (Nov 26)
- Solutions
- MATLAB code: transition.m

- 25. Spatial Poisson processes (Dec 3)
- MATLAB code: poisson.m
- MATLAB code solutions: poisson_sol.m

Now that the semester is over, I have taken down the quiz solutions.

- 1. Aug 29
- 2. Sep 5
- 3. Sep 12
- 4. Sep 26 - not really a quiz
- 5. Oct 3
- 6. Oct 10
- 7. Oct 17
- 8. Oct 24
- 9. Nov 14

Now that the semester is over, I have taken down the solutions to the exams and review problems.

- Exam 1 (Sep 19)
- Information and review problems
- Solutions to review problems
- Solutions

- Exam 2 (Oct 31)
- Information and review problems
- Solutions to review problems
- Solutions

- Final Exam (Dec 11)
- Information and review problems
- Solutions to review problems