Uživatelské nástroje

Nástroje pro tento web


teaching:ads12526_lecture

Rozdíly

Zde můžete vidět rozdíly mezi vybranou verzí a aktuální verzí dané stránky.

Odkaz na výstup diff

Obě strany předchozí revizePředchozí verze
teaching:ads12526_lecture [2026/02/17 23:41] – 16. 2. Martin Kouteckyteaching:ads12526_lecture [2026/02/17 23:42] (aktuální) Martin Koutecky
Řádek 10: Řádek 10:
 {{tablelayout?colwidth="100px,-"&rowsHeaderSource=1&rowsVisible=100&float=left}} {{tablelayout?colwidth="100px,-"&rowsHeaderSource=1&rowsVisible=100&float=left}}
 ^ data ^ what was taught [resources] ^ ^ data ^ what was taught [resources] ^
-| 16. 2.| The Random Access Machine (RAM) model of computation, instruction cost (unit, logarithmic, relative logarithmic) **[ALG Chapter 4]**, **[A Chapter 0]**, **[[https://en.wikipedia.org/wiki/Random-access_machine#Formal_definition|Wiki: Random Access Machine]]**, Big-Oh notation ($\mathcal{O}, \Omega, \Theta$)|+| 16. 2.| The Random Access Machine (RAM) model of computation, instruction cost (unit, logarithmic, relative logarithmic) **[ALG 2]**, **[A 0]**, **[[https://en.wikipedia.org/wiki/Random-access_machine#Formal_definition|Wiki: Random Access Machine]]**, Big-Oh notation ($\mathcal{O}, \Omega, \Theta$)|
 | 23. 2. |//Plan: Graph problems, DFS: identifying connected components, pre- and post-orderings, cycle detection. **[A, up to 3.3.2]**//| | 23. 2. |//Plan: Graph problems, DFS: identifying connected components, pre- and post-orderings, cycle detection. **[A, up to 3.3.2]**//|
  
teaching/ads12526_lecture.txt · Poslední úprava: autor: Martin Koutecky