18YZALG — Basics of Algorithmization (Exercises)
Requirements
- Credit: Awarded for active participation in tutorials and successful completion of assigned mini-projects during the semester.
- Exam: The final grade is composed of two equally weighted parts.
- 50% — continuous assessment from mini-projects completed during the semester.
- 50% — defined during the Lectures.
Tutorials
Materials and task sheets will be added gradually during the semester. Draft materials may contain typos or small issues — if you notice anything, please report it. 🙂
The schedule below may be adjusted if needed; any major changes will be announced in advance.
- Tutorial 1 — Algorithms in practice: specification, correctness, and complexity.
- Tutorial 2 — Part I: specification, correctness, and complexity (continued).
- Tutorial 3 — Part II: core data structures.
- Tutorial 4 — Part II: core data structures (continued). Student presentations week: part of the tutorial is devoted to assignment presentations.
- No tutorial (no lecture week).Planned date: 16/03/2026
- Tutorial 5 — Part III: sorting algorithms.Planned date: 23/03/2026
- Tutorial 6 — Part III: sorting algorithms (continued). Student presentations week: part of the tutorial is devoted to assignment presentations.Planned date: 30/03/2026
- No tutorial (Easter Monday).Planned date: 06/04/2026
- Tutorial 7 — Part IV: introduction to graphs and shortest paths.Planned date: 13/04/2026
- Tutorial 8 — Part IV: introduction to graphs and shortest paths (continued). Student presentations week: part of the tutorial is devoted to assignment presentations.Planned date: 20/04/2026
- Tutorial 9 — Part V: recursion.Planned date: 27/04/2026
- Tutorial 10 — Part VI: scientific algorithmization. Student presentations week: part of the tutorial is devoted to assignment presentations.Planned date: 04/05/2026
- Tutorial 11 — Part VI: scientific algorithmization (continued).Planned date: 11/05/2026