Welcome to the website to the tutorial class of Probabilistic techniques (lecturer Mykhaylo Tyomkyn, lecture website). The tutorials take place sporadically on Wednesdays at 15:40 in S1. See the schedule below.
The tutorial classes are co-taught with Tomáš Hons. The plan is that I cover the first half of tutorials and he does the second half.
If you have a feeling that
You will get credit for solving homework. We use the Postal Owl system for publishing, submitting, and grading homework. You can use this link to join the course.
Collaboration is discouraged since you can pass the whole course by just doing tutorial classes. But we have no way of checking that.
Using computer algebra systems is fully allowed and encouraged in your solutions. Ideally, please send a link/certificate in the complexity sense to how you used it for solving the problem. So e.g. a Wolfram alpha URL that includes your expression.
Below is the schedule of the tutorial classes.
Date | Tutorial | Tutorial content | Homework set announcement | Hints published | Homework deadline |
Yes (by Tung) | Exercises. Solutions. | Set 1 | |||
No | |||||
No | Set 1 | ||||
Yes (by Tung) | Presenting solutions of Set 1 | Set 1 | |||
Yes (by Tung) | Exercises. | Set 2 | |||
No | |||||
Yes (by Tung) | Exercises. | Set 3 | Set 2 | ||
Yes (by Tung) | Presenting solutions of Set 2 | Set 2 | |||
Yes (by Tomáš) | Exercises | Set 4 | Set 3 | ||
Yes (by Tung) | Presenting solutions of Set 3 | Set 3 | |||
Yes (by Tomáš) | Exercises | Set 5 | Set 4 | ||
Yes (by Tomáš) | Presenting solutions of Set 4 | Set 4 | |||
No | Set 5 | ||||
Exam period starts here | |||||
No | Set 5 |