|
Take home examinations
Written examination
The students will have to answer two
out of 9 theoretical questions given in the list below.
Theoretical questions for the written
examination
Problem solving, discussions
Problem numbers in the book |
Date and place |
1.1, 1.4, 1.6(a), 1,11, 1.16, Example 1.1.5 |
11/2, Pascal |
2.1, 2.3, Example 2.21, 2.13 |
11/9, MVH12 |
Example 2.2.3, 2.6, 2.13, Example 2.2.4 |
11/16, MVH12 |
On the waiting-time paradox; 3.1, 3.3 |
11/23, MVH12 |
Example 3.1.3, 3.6, 3.7, 3.14 |
11/30, MVH12 |
3.16, 4.1, 4.4, 4.5, 4.8 |
12/7, MVH12 |
The M/M/1 Queue Model |
12/11, Pascal |
Problem solving is the science of converting a problem statement
into a form that
is easy to understand and solve.
Problem solving is a skill needed in many fields of mathematics,
science and engineering.
|
|
Lectures
Lecture topic |
Date and place |
The Poisson
process and related processes 1
|
10/30, MVH11 |
The Poisson
process and related processes 2
|
11/1, Pascal |
The Poisson
process and related processes 3
|
11/6, MVF21 |
Renewal-reword processes 1
|
11/8, MVH12 |
Renewal-reword processes 2
|
11/13, Pascal |
Renewal-reword processes 3
|
11/15, Pascal |
Discrete-time Markov chains 1
|
11/20, Pascal |
Discrete-time Markov chains 2
|
11/22, Pascal |
Discrete-time Markov chains 3
|
11/27, Pascal |
Discrete-time Markov chains 4
|
11/29, Pascal |
Continuous-time Markov chains 1
|
12/4, Pascal |
Continuous-time Markov chains 2
|
12/6, Pascal |
Markov chains and queues
|
12/11, Pascal |
Revision and discussions
|
12/13, Pascal |
Material from the book included in the course
Compendium in Probability theory
|