FEE timetable ALG students Upload system BRUTE Discussion board
Lecture | Day | Topics | Slides |
---|---|---|---|
1. | 24.9. | Order of growth of functions, asymptotic complexity | alg01a alg01b |
2. | 1.10. | Trees, binary trees, recursion | alg02 |
3. | 8.10. | More recursion and backtrack examples | recursion examples , backtrack examples |
4. | 15.10. | Graph, graph representation, basic graph processing | graphs Graphviz support graph representation , weighted graphs |
5. | 22.10. | Queue, Stack, Breadth/Depth First Search | alg05_py |
6. | 29.10. | Array search, Binary search tree | alg06_py |
7. | 5.11. | AVL and B- trees | alg07 |
8. | 12.11. | Sorting algorithms I | alg08_py |
9. | 19.11. | Sorting algorithms II | alg09a_py , alg09b_py |
10. | 26.11. T2:A4-202b | Dynamic programming I | alg11a_py alg11b_py |
11. | 3.12. | Dynamic programming II | alg12a_py alg12b_py |
12. | 10.12. | Complexity of recursive algorithms, Master theorem | alg10 |
13. | 17.12. | Hashing I | alg13 |
14. | 7.1. | Hashing II | alg14a alg14b |
Source code examples for particular lectures
02 - basic recursion , same examples, more insight
03 - binary tree, In-pre-Post order, recursion, alternative: binary tree in just 1D arrays ( slides ppt slides-python pptx )
04/05 - graph, DFS, BFS
06 - backtrack example - magic square
07, 08 - Sorts - Insert, Select, Bubble, Quick, Merge, Heap, Radix, Counting