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.

Practice: the ADS2 Arcade has small games for most algorithms of the lecture (failure function sprint, Aho-Corasick, Rolling hash, augmenting paths, push-relabel, sorting networks, FFT, reductions, …). Notation follows the ALG book.

data	what was taught [resources]
28. 9.	No lecture: St. Wenceslas Day
5. 10.	A few words about AI (slides). String searching: Knuth-Morris-Pratt algorithm. ALG 13.1–13.2, JeffE's notes, 7.1, 7.4-7.6, KMP slides
12. 10.	A few more words about AI (slides). KMP automaton construction ALG 13.2, KMP slides, part 2. Searching for more needles: Aho-Corasick ALG 13.3, JeffE's notes, 7.2, reference for AC: slides. Preview of Rabin-Karp ALG 13.4
19. 10.	Rabin-Karp ALG 13.4, JeffE's notes, 7.3. Network flows intro, Ford-Fulkerson's algorithm; it terminates for integer and rational capacities, but may not for real ones. ALG 14.1–14.2, JeffE's notes, 10.1-10.4. Practice: Rolling Hash, Augment!
26. 10.	Plan: Correctness of Ford-Fulkerson's algorithm (when it stops, the flow is maximum) ALG 14.2, JeffE's notes, 10.1-10.4. Dinic's algorithm ALG 14.4, slides of Honza Hubička, CP-algorithms, NetworkX notebook.

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)