SA402 ⬝ Fall 2019 ⬝ Section 3001
Assoc. Prof. Nelson Uhan
2 Dec (updated 3 Dec) | Final Exam
Resubmissions
|
||||||||||||||||||
30 Oct | Upcoming schedule:
Exam 2
|
||||||||||||||||||
25 Oct |
|
||||||||||||||||||
11 Oct | Upcoming schedule:
|
||||||||||||||||||
23 Sep | The deadline to resubmit a quiz/exam for the 6-week marking period is in class on Friday 27 September. |
||||||||||||||||||
11 Sep | Upcoming schedule:
Exam 1
|
||||||||||||||||||
30 Aug | Instructions for resubmissions
Here's an example of a resubmission for a fictional quiz. Follow the guidelines in the course policy statement. In particular,
|
||||||||||||||||||
19 Aug | Welcome! |
Dates | Problems |
25 Nov | 8.5, 8.8, 8.10 |
20 Nov | Finish the exercises in Lesson 16 |
18 Nov | 8.4, 8.6, 8.11 |
15 Nov | 8.4 (just model the system as a birth-death process) |
8 Nov | 7.10, finish Problem 1 of Lesson 14 |
30 Oct | 6.20, 6.21 |
25 Oct | 6.11, 6.17c, 6.8 |
23 Oct | 6.5 (classify each state as transient or recurrent), 6.6 |
18 Oct | Finish the problems in Lesson 11A. |
11 Oct | 6.4b, 6.17ab, 6.18 (start by finding the probabilities of preferred beer brands in 1979 and 2016) |
9 Oct | 6.4ac, 6.5 (draw the transition diagram only) |
2 Oct | Finish 5.20. |
30 Sep | 5.20 |
27 Sep | 5.3ef, 5.10, 5.12, 5.15. Finish the examples in Lesson 8a. |
25 Sep | 5.13, 5.17 |
23 Sep | 5.1, 5.3abcd, 5.5, 5.6, 5.8, 5.14 |
13 Sep | 4.4. Hint. Use Exercise 2.7 as a warm up if you're having trouble understanding how the system works. Start by computing the demand for hamburgers each day using the given table and system logic. In your algorithm, let D be a random variable representing the number of hamburgers demanded on each day. You may assume that demand between days is identical and independent. |
11 Sep | 4.8 |
9 Sep | 4.6. Hint. You'll need to keep track of the number of jobs waiting to be processed by CPU A and CPU B. 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. |
6 Sep | 3.17ab, 3.18ab, 3.19ab, 3.20ab |
4 Sep | 3.17c, 3.18c, 3.19c, 3.20c |
3 Sep | Finish the homework assigned for 28 Aug and 30 Aug. |
30 Aug | 3.6, 3.9b, 3.31 |
28 Aug | 3.8, 3.9a |
26 Aug | 3.3, 3.5 |
23 Aug | 3.1, 3.2 |
21 Aug | 2.1 — Finish the simulation of the self-service system we started in class, complete the simulation of the proposed full-service system. Template for self-service system Template for full-service system |
19 Aug | Familiarize yourself with the course policy statement. Read the section on grading carefully! |
Dates | Lesson | ||
|
17 | Standard queueing models | |
|
16 | The birth-death process - performance measures | |
|
15 | An introduction to queueing processes | |
|
14 | A very brief introduction to Markov processes | |
|
How to win at Monopoly | ||
|
13 | Markov chains - modeling and assumptions | |
|
12 | Markov chains - time-independent performance measures | |
|
11a | Markov chains - time-dependent performance measures, cont. | |
|
11 | Markov chains - time-dependent performance measures | |
|
10 | Introduction to Markov chains | |
|
Poisson processes for fun and profit | ||
|
9 | Nonstationary Poisson processes | |
|
8a | Poisson arrival processes, cont. | |
|
8 | Poisson arrival processes, cont. | |
|
7 | Arrival counting processes and the Poisson arrival process | |
|
6 | A general stochastic process model | |
|
5 | Introduction to stochastic processes | |
|
4 | Random variate generation | |
|
3 | Conditional probability review | |
|
2 | Probability review | |
|
1 | Sample paths |
Date | Quiz | |
20 Nov | Quiz 7 | |
21 Oct | Quiz 6 | |
9 Oct | Quiz 5 | |
2 Oct | Quiz 4 | |
11 Sep | Quiz 3 | |
4 Sep | Quiz 2 | |
28 Aug | Quiz 1 |
Date | Exam | |
17 Dec | Final Exam | |
6 Nov | Exam 2 | |
18 Sep | Exam 1 |