Lectures

Lectures timetable

Lecture	Day	Topics	Slides
1.	27.9.	Order of growth of functions, asymptotic complexity	alg01a alg01b
2.	4.10.	Trees, binary trees, recursion	alg02
3.	11.10.	More recursion and backtrack examples	recursion examples , backtrack examples coin change, N queens, rectangle tiling
4.	18.10.	Graph, graph representation, basic graph processing	graphs Graphviz support graph representation , weighted graphs
5.	25.10.	Queue, Stack, Breadth/Depth First Search	alg05_py DFS animation, BFS animation, BFS and DFS side by side!
6.	1.11.	Array search, Binary search tree	alg06_py
7.	8.11.	AVL and B- trees	alg07
8.	15.11.	Sorting algorithms I	alg08_py
9. Moved to T2:C4-459	22.11.	Sorting algorithms II	alg09a_py , alg09b_py
10. Moved to T2:C4-459	29.11.	Dynamic programming I	alg11a_py alg11b_py
11.	6.12.	Dynamic programming II	alg12a_py alg12b_py
12. Moved to T2:C4-459	13.12.	Complexity of recursive algorithms, Master theorem	alg10
13.	20.12.	Hashing I & II	alg13 alg14a alg14b
14.	10.1.	Repetitions and exam preparation

Source code examples for particular lectures

02 - basic recursion , same examples, more insight

04/05 - DFS/BFS with and without nodes as objects graph.py, with objects, graph2.py, no objects