| Week | Content | Slides | WarmUp test | Contest | Soft Deadline |
|---|---|---|---|---|---|
| 01 | Linear algorithms | Slides | Test | Contest | 23.09.2026 19:00 UTC+3 |
| 02 | Sorting algorithms | Slides | Test | Contest | 30.09.2026 19:00 UTC+3 |
| 03 | Binary search | Slides | Test | Contest | 07.10.2026 19:00 UTC+3 |
| 04 | Basic Data sturctures | Slides | Test | Contest | 14.10.2026 19:00 UTC+3 |
Final grade G consists of three parts:
-
Homework grade:
His an integer number within range [0; 10] (rules given below). -
Practical exam grade:
Pis an integer number within range [0; 10] (rules will be provided later). -
Theoretical exam grade:
Tis an integer number within range [0; 10] (rules will be provided later).
Your final grade is:
G = ceil(0.6 H + 0.2 P + 0.2 T)
Homework grade contributes the most into final grade. To increase homework grade you should solve problems from home assignments.
Formally:
Homework grade: H is an integer number within range [0; 10]:
H = round(hw_score / hw_maximum_score * 10)
hw_score is sum of scores for all problems in home assignment.
Scores for a problem:
- 1.0 if you solved the problem (got OK verdict) before soft deadline
- 0.75 if you solved the problem (got OK verdict) after soft deadline
- 0 otherwise
hw_maximum_score is total number of problems in all home asignments.
Please note that during webinars, you may be asked to explain your code from the Home Assignments. In the theoretical exam, you may be asked about your solutions to the Practical exam. You should be able to explain what happens inside your code and why it works. If you can't explain it, you get a strike and 0 for that task. If you get 3 strikes, your Home Assignment grade will be significantly reduced.