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. | Plan: Richest subsequence. Attempts at defining an algorithm. Von Neumann's computational model, Big-Oh notation ($\mathcal{O}, \mathcal{o}, \Omega, \omega$), the RAM (Random Access Machine) model [A Chapter 0], Wiki: Random Access Machine |
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.1708287836.txt.gz · Poslední úprava: 2024/02/18 21:23 autor: Martin Koutecky