teaching:ads22223_lecture
Toto je starší verze dokumentu!
Algorithms and Data Structures II 2022/23 -- Lecture
I teach Algorithms and Data Structures II (NTIN061) every Wednesday at 10:40 at S5 (Malá strana).
If you want to talk to me, you're welcome in my office S326 at Malá Strana, but agree with me on a time to meet first.
You can also e-mail me at koutecky+ads2@iuuk.mff.cuni.cz and/or include the text [ADS2] in the email subject.
| data | what was taught [resources] |
|---|---|
| 5. 10. | String searching: Knuth-Morris-Pratt algorithm. JeffE's notes, 7.1, 7.4-7.6 |
| 12. 10. | String searching: Aho-Corasick, Rabin-Karp JeffE's notes, 7.2-7.3, reference for AC: slides |
| 19. 10. | Plan: Finish Rabin-Karp analysis. Network flows. |
Useful Resources
- [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
teaching/ads22223_lecture.1665572356.txt.gz · Poslední úprava: 2022/10/12 12:59 autor: Martin Koutecky