# COMP 261 (2020) - Lecture Schedule

Week Date Lecturer Topic pptx pdf
1 Lec 1 Yi Mei Course Overview pptx pdf
Lec 2 Yi Mei Graphs 1: Adjacency matrix and list pptx pdf
Lec 3 Yi Mei Tutorial 1 pptx pdf
2 Lec 1 Yi Mei Graphs 2: display and trie pptx pdf
Lec 2 Yi Mei Dijkstra's Algorithm pptx pdf
Lec 3 Yi Mei Tutorial 2 pptx pdf
3 Lec 1 Yi Mei A* Search pptx pdf
Lec 2 Yi Mei Articulation Points 1 pptx pdf
Lec 3 Yi Mei Tutorial 3 pptx pdf
4 Lec 1 Yi Mei Articulation Points 2 pptx pdf
Lec 2 Yi Mei Minimum Spanning Trees pptx pdf
Lec 3 Yi Mei Tutorial 4 pptx pdf
5 Lec 1 Yi Mei Minimum Spanning Trees pptx pdf
Lec 2 Yi Mei Disjoint Sets pptx pdf
Lec 3 Yi Mei Tutorial 5 pptx pdf
6 Lec 1 Yi Mei Fast Fourier Transform 1 pptx pdf
Lec 2 Yi Mei Fast Fourier Transfrom 2 pptx pdf
Introduction to complex numbers, Introduction to FFT
Lec 3 Yi Mei Tutorial 6, example code (need to import the ecs100.jar library) pptx pdf
7 Lec 1 Marcus Frean Parsing 1 pptx pdf video
Lec 2 Marcus Frean technical problems
Lec 3 Marcus Frean Parsing 2 pptx pdf video
8 Lec 1 Marcus Frean Parsing 3 pptx pdf video
Lec 2 Marcus Frean Completing the previous lecture! (Parsing 3) video
Lec 3 Marcus Frean The End of Parsing (Parsing 4) pptx pdf video
9 Lec 1 Marcus Frean String Search 1 of 2 pptx pdf video
Lec 2 Marcus Frean String Search 2 of 2 (no ppt) pdf video
10 Lec 1 Marcus Frean Data Compression 1 (Huffmann coding) pptx pdf video
Lec 2 Marcus Frean Data Compression 2 (Lempel-Ziv coding) pptx pdf video
Lec 3 Marcus Frean String prediction (Ngrams) (no ppt) pdf video
Week 11 Lec 1 Marcus Frean Data Compression 3 (Arithmetic coding) pptx pdf video