• HOME
• OUTLINE
• NOTES
• EXTRAS
• HOME-WORK
• ICE
• Contact

Lecture materials will be posted on the Friday of each teaching week. All materials are provided as single ZIP files containing files in PPT or PDF format.

• Week 01 and 02 - Greedy Algorithms
• Week 03 - Dynamic Programming 1
• Week 04 - Dynamic Programming 2
• Week 05 - Lossless Compression
• Week 06 - Longest Common Subsequence
• Week 07 - Revision Materials
• Week 08 - Brute & FSA Pattern Matching
• Week 09 - Knuth Morris Pratt Pattern Matching
• Week 10 - Matching Theory and Algorithms
• Week 11 - Introduction to NP Completeness
• Week 12 - Polynomial Time Reductions
• Week 13 - Approximation Algorithms