Kurz: Algorithms and Datastructures I English

Osnova sekce

Vybrat sekci Úvod

Úvod

Sbalit vše Rozbalit vše
- Vybrat aktivitu Feedback on English lecture and English practicals
  
  Feedback on English lecture and English practicals Dotazník
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Announcements (zoom lectures)
  
  Announcements (zoom lectures) Fórum
- Vybrat aktivitu General discussion (questions, corrections, links to resources etc.)
  
  General discussion (questions, corrections, links to resources etc.) Fórum
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Průvodce labyrintem algoritmů
  
  Průvodce labyrintem algoritmů Kniha
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Dasgupta, Papadimitriou, Vazirani: Algorithms
  
  Dasgupta, Papadimitriou, Vazirani: Algorithms Kniha
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Youtube channel suggested by Walter
  
  Youtube channel suggested by Walter URL
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Model of comptuation, time and space complexity

Model of comptuation, time and space complexity
- Vybrat aktivitu Post questions/discussion/pointers to good study materials here
  
  Post questions/discussion/pointers to good study materials here Fórum
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problem sheet (with a brief description of RAM)
  
  Problem sheet (with a brief description of RAM) URL
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Graph search algorithms (BFS and DFS)

Graph search algorithms (BFS and DFS)
- Vybrat aktivitu Problem sheet (DFS and BFS)
  
  Problem sheet (DFS and BFS) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Post questions/discussion/pointers to good study materials here
  
  Post questions/discussion/pointers to good study materials here Fórum
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problem sheet (DFS applications)
  
  Problem sheet (DFS applications) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problem sheet (DFS applications 2 and homework)
  
  Problem sheet (DFS applications 2 and homework) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Finding bridges in a graph
  
  Finding bridges in a graph URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Solutions to the previous problem sheet
  
  Solutions to the previous problem sheet URL
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Shortest paths in valued graphs

Shortest paths in valued graphs
- Vybrat aktivitu Post questions/discussion/pointers to good study materials here
  
  Post questions/discussion/pointers to good study materials here Fórum
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Lecture notes on Dijsktra's algorithm (for self study)
  
  Lecture notes on Dijsktra's algorithm (for self study) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides from lecture
  
  Slides from lecture URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problem sheet
  
  Problem sheet URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Recorded lecture
  
  Recorded lecture URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Dijkstra's algorithm on wikipedia
  
  Dijkstra's algorithm on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Bellman-Ford algorithm on wikipedia
  
  Bellman-Ford algorithm on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Floys Washall on wikipedia
  
  Floys Washall on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Minimum spanning trees

Minimum spanning trees
- Vybrat aktivitu Post questions/discussion/pointers to good study materials here Fórum
  
  Post questions/discussion/pointers to good study materials here Fórum
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (same as for previous topic)
  
  Slides (same as for previous topic) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Recorded lecture (same as for previous topic; see table of contents on the bottom)
  
  Recorded lecture (same as for previous topic; see table of contents on the bottom) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Jarník (Prim) algorithm on wikipedia
  
  Jarník (Prim) algorithm on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Borůvka algorithm
  
  Borůvka algorithm URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Kruskal's algorithm
  
  Kruskal's algorithm URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Homework (minimum spanning tree)
  
  Homework (minimum spanning tree) Úkol
  
  Studenti musí
  
  Označit jako hotovo
  
  Simple moodle homework for my practicals (others can post answers too and I will comment them):
  
  Prove that every minimum spanning tree contains every bridge.
Vybrat sekci Union-find

Union-find
- Vybrat aktivitu Recorded lecture
  
  Recorded lecture URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (with minor corrections)
  
  Slides (with minor corrections) Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides with hand written notes (from lecture) but without after-class corrections
  
  Slides with hand written notes (from lecture) but without after-class corrections Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Union-find on wikipedia
  
  Union-find on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Data-structures for sets

Data-structures for sets
- Vybrat aktivitu Recorded lecture (same as for previous topic)
  
  Recorded lecture (same as for previous topic) URL
  
  Studenti musí
  
  Označit jako hotovo
  
  Contains binary search trees (BST) and introduction to AVL trees (definition and proof that they have logarithmic height)
- Vybrat aktivitu Slides (same as for previous topic)
  
  Slides (same as for previous topic) Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides with hand written notes
  
  Slides with hand written notes Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Recorded lecture:AVL trees:insert and delete; (a,b)-trees
  
  Recorded lecture:AVL trees:insert and delete; (a,b)-trees URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides 2 (AVL trees, (a,b)-trees)
  
  Slides 2 (AVL trees, (a,b)-trees) Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Recorded lecture (RB-trees and hashing)
  
  Recorded lecture (RB-trees and hashing) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (RB trees and Hashing)
  
  Slides (RB trees and Hashing) Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Binary search tree on wikipedia
  
  Binary search tree on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu AVL trees on wikipedia
  
  AVL trees on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problems for practicals: binary search trees
  
  Problems for practicals: binary search trees Stránka
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu AVL trees quiz
  
  AVL trees quiz Test
  
  Studenti musí
  
  Označit jako hotovo
  
  This quiz is voluntary - you can try how well you understand the topic and I get some feedback.
  Please enrol the course so you can take it (even if you will not want the final mark from me).
  You will be rewarded by a cool animation!
- Vybrat aktivitu (a,b)-trees quiz
  
  (a,b)-trees quiz Test
  
  Studenti musí
  
  Označit jako hotovo
  
  Second small quiz from you to test understanding of the class
- Vybrat aktivitu Problems for practicals: AVL trees
  
  Problems for practicals: AVL trees Stránka
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Red-Black trees lecture by Robert Sedgewick
  
  Red-Black trees lecture by Robert Sedgewick URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Red Black trees on wikipedia
  
  Red Black trees on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problems for practicals (red-black trees)
  
  Problems for practicals (red-black trees) Stránka
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Hash tables

Hash tables
- Vybrat aktivitu Recorded lecture (second half)
  
  Recorded lecture (second half) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (second half)
  
  Slides (second half) Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problems for practicals (hashing)
  
  Problems for practicals (hashing) Stránka
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides: Universal hashing
  
  Slides: Universal hashing Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Recorded lecture (universal hashing, divide and conquer)
  
  Recorded lecture (universal hashing, divide and conquer) URL
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Divide and Conquer

Divide and Conquer
- Vybrat aktivitu Recorded lecture (second half): Merge sort and Karatsuba algorithm
  
  Recorded lecture (second half): Merge sort and Karatsuba algorithm URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (second part): Merge sort; tree of recursion; Karatsuba algorithm
  
  Slides (second part): Merge sort; tree of recursion; Karatsuba algorithm Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Recorded lecture (Master theorem, Strassen algorithm, Quickselect)
  
  Recorded lecture (Master theorem, Strassen algorithm, Quickselect) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (Master theorem, Strassen algorithm, QuickSelect)
  
  Slides (Master theorem, Strassen algorithm, QuickSelect) Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Recorded lecture (median of medians)
  
  Recorded lecture (median of medians) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (median of medians)
  
  Slides (median of medians) Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Poblems on divide and conquer (for practicals)
  
  Poblems on divide and conquer (for practicals) Stránka
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Homework (Divide & conquer)
  
  Homework (Divide & conquer) Úkol
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Sorting

Sorting
- Vybrat aktivitu Recorded lecture (second half)
  
  Recorded lecture (second half) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (second half: QuickSort, lower bound on sorting, sorting in linear time)
  
  Slides (second half: QuickSort, lower bound on sorting, sorting in linear time) Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problems (for practicals)
  
  Problems (for practicals) Stránka
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Dynamic programming

Dynamic programming
- Vybrat aktivitu Slides
  
  Slides Soubor
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Problems (for practicals)
  
  Problems (for practicals) Stránka
  
  Studenti musí
  
  Označit jako hotovo
Vybrat sekci Last homework

Last homework
- Vybrat aktivitu Longest non-repeating subsequence
  
  Longest non-repeating subsequence Úkol
  
  Studenti musí
  
  Označit jako hotovo