teaching:ads12324_lecture
Toto je starší verze dokumentu!
Algorithms and Data Structures I 2023/24 -- Lecture
I teach Algorithms and Data Structures I (NTIN060) every Tuesday at 12:20 at S9 (Malá strana). I have taught this class last year and there are some (somewhat problematic) recordings from then (see the link).
I also teach a tutorial for this class on Monday at 15:40, and another one is taught on Tuesday at 17:20 by Todor Antić. Both tutorials will cover the same content and have the same criteria for obtaining credit.
If you want to talk to me, schedule a meeting with me.
You can e-mail me at koutecky+ads1@iuuk.mff.cuni.cz
and/or include the text [ADS1]
in the email subject.
data | what was taught [resources] |
---|---|
19. 2. | The Random Access Machine (RAM) model of computation, instruction cost (unit, logarithmic, relative logarithmic) [A Chapter 0], Wiki: Random Access Machine, Big-Oh notation ($\mathcal{O}, \Omega, \Theta$) |
27. 2. | Graph problems, DFS: identifying connected components, pre- and post-orderings, cycle detection. [A, up to 3.3.2] |
5. 3. | DFS: topological ordering, detecting strongly connected components. [A, remainder of Chap 3]. Also learn the $\mathcal{O}(n+m)$ algorithm to find all bridges of an undirected graph: notes, demo. |
12. 3. | Finish SCC algorithm [A, Chap 3]; begin shortest paths: BFS, Dijkstra. [A, Chap 4] |
19. 3. | general relaxation algorithm, start Bellman-Ford [A, Chap 4]. |
26. 3. | Plan: Bellman-Ford; Floyd-Warshall for APSP. [A 4] (Also see [JE 8, 9] but that's a lot more information than necessary.) Beginning of Min Spanning Trees: if edge weights distinct, MST is unique. [A 5], [JE 7].) |
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/ads12324_lecture.1711057535.txt.gz · Poslední úprava: 2024/03/21 22:45 autor: Martin Koutecky