Passer au contenu principal
Panneau latéral
DL 1
Accueil
Calendrier
Plus
Français (fr)
Čeština (cs)
Deutsch (de)
English (en)
Français (fr)
Русский (ru)
Vous êtes connecté anonymement
Connexion
DL 1
Accueil
Calendrier
Tout déplier
Tout replier
Ouvrir l'index du cours
Ouvrir le tiroir des blocs
Algorithms and Datastructures I English
Généralités
Průvodce labyrintem algoritmů
Průvodce labyrintem algoritmů
Livre
Imprimer tout le livre
(S'ouvre dans une nouvelle fenêtre)
Imprimer ce chapitre
(S'ouvre dans une nouvelle fenêtre)
Plus
Conditions d'achèvement
Marquer comme terminé
http://pruvodce.ucw.cz/static/pruvodce.pdf
1. Online
http://pruvodce.ucw.cz/static/pruvodce.pdf
◄ General discussion (questions, corrections, links to resources etc.)
Jump to activity
Jump to activity
Feedback on English lecture and English practicals
Announcements (zoom lectures)
General discussion (questions, corrections, links to resources etc.)
Dasgupta, Papadimitriou, Vazirani: Algorithms
Youtube channel suggested by Walter
Post questions/discussion/pointers to good study materials here
Problem sheet (with a brief description of RAM)
Problem sheet (DFS and BFS)
Post questions/discussion/pointers to good study materials here
Problem sheet (DFS applications)
Problem sheet (DFS applications 2 and homework)
Finding bridges in a graph
Solutions to the previous problem sheet
Post questions/discussion/pointers to good study materials here
Lecture notes on Dijsktra's algorithm (for self study)
Slides from lecture
Problem sheet
Recorded lecture
Dijkstra's algorithm on wikipedia
Bellman-Ford algorithm on wikipedia
Floys Washall on wikipedia
Post questions/discussion/pointers to good study materials here Fórum
Slides (same as for previous topic)
Recorded lecture (same as for previous topic; see table of contents on the bottom)
Jarník (Prim) algorithm on wikipedia
Borůvka algorithm
Kruskal's algorithm
Homework (minimum spanning tree)
Recorded lecture
Slides (with minor corrections)
Slides with hand written notes (from lecture) but without after-class corrections
Union-find on wikipedia
Recorded lecture (same as for previous topic)
Slides (same as for previous topic)
Slides with hand written notes
Recorded lecture:AVL trees:insert and delete; (a,b)-trees
Slides 2 (AVL trees, (a,b)-trees)
Recorded lecture (RB-trees and hashing)
Slides (RB trees and Hashing)
Binary search tree on wikipedia
AVL trees on wikipedia
Problems for practicals: binary search trees
AVL trees quiz
(a,b)-trees quiz
Problems for practicals: AVL trees
Red-Black trees lecture by Robert Sedgewick
Red Black trees on wikipedia
Problems for practicals (red-black trees)
Recorded lecture (second half)
Slides (second half)
Problems for practicals (hashing)
Slides: Universal hashing
Recorded lecture (universal hashing, divide and conquer)
Recorded lecture (second half): Merge sort and Karatsuba algorithm
Slides (second part): Merge sort; tree of recursion; Karatsuba algorithm
Recorded lecture (Master theorem, Strassen algorithm, Quickselect)
Slides (Master theorem, Strassen algorithm, QuickSelect)
Recorded lecture (median of medians)
Slides (median of medians)
Poblems on divide and conquer (for practicals)
Homework (Divide & conquer)
Recorded lecture (second half)
Slides (second half: QuickSort, lower bound on sorting, sorting in linear time)
Problems (for practicals)
Slides
Problems (for practicals)
Longest non-repeating subsequence
Dasgupta, Papadimitriou, Vazirani: Algorithms ►