teaching:ads22627_lecture
Algorithms and Data Structures II 2026/27 -- Lecture
I teach Algorithms and Data Structures II (NTIN061) every Monday at 14:00 in S9 (Malá strana).
If you want to talk to me, send me an email at koutecky+ads2@iuuk.mff.cuni.cz and/or include the text [ADS2] in the email subject, or message me on discord etc. We will then figure out a time and place (physical, zoom, etc.) to meet.
| data | what was taught [resources] |
|---|---|
| 28. 9. | No lecture: St. Wenceslas Day |
| 5. 10. | Plan: String searching: Knuth-Morris-Pratt algorithm. ALG 13.1–13.2, JeffE's notes, 7.1, 7.4-7.6 |
Useful Resources
- [ALG] Algorithm Labyrinth Guide by Mareš and Valla. EXPERIMENTAL: this is a work-in-progress, AI-generated translation of the excellent Czech textbook Průvodce Labyrintem Algoritmů. It may be rough or even wrong (due to translation issues); I'll be working on improving it, especially the parts directly relevant to covered material.
- [A] Algorithms by Dasgupta, Papadimitriou, and Vazirani
- [JE] Algorithms by Jeff Erickson (the page contains various PDFs suitable for screen, printing etc.)
- [CLRS] Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein. Find it on libgen
- Notes from Andrej Perković (100MB file) (no guarantee of correctness, email him if you find bugs: arachneen_octogone.0c@icloud.com)
teaching/ads22627_lecture.txt · Poslední úprava: autor: Martin Koutecky
