COMP108 Algorithmic Foundations - Lecture Notes
Printouts of the module notes are available (free of charge).
The modules notes are also available in three different formats:
as a PDF file with 4 slides per physical page;
as a PDF file with 1 slide per physical page;
as a Powerpoint file (to view the solutions to exercises and the animation in the file).
PDF (4 slides per page)
PDF (1 slide per page)
PPT (post after lectures)
Introduction
108_01_basics_4pp.pdf
108_01_basics.pdf
108_01_basics.ppt
puzzle_01_bridge.ppt
Mathematical Induction
108_02_induction_4pp.pdf
108_02_induction.pdf
108_02_induction.ppt
puzzle_02_weighing.ppt
Time complexity + Searching
108_03_efficiency_4pp.pdf
108_03_efficiency.pdf
108_03_efficiency.ppt
Polynomial and Exponetial Time Algorithms
108_04_polynomial_exponential_4pp.pdf
108_04_polynomial_exponential.pdf
108_04_polynomial_exponential.ppt
puzzle_04_photo.ppt
Video on DNA Matching
Video on Bubble Sort
Divide and Conquer Method
108_05_divide_conquer_4pp.pdf
108_05_divide_conquer.pdf
108_05_divide_conquer.ppt
puzzle_05_pancake.ppt
puzzle_05_triomino.ppt
Link to Robozzle
Video on Merge Sort
Graph Theory
108_06_graph_4pp.pdf
108_06_graph.pdf
108_06_graph.ppt
puzzle_06_water.ppt
Greedy Method
108_07_greedy_4pp.pdf
108_07_greedy.pdf
108_07_greedy.ppt
puzzle_07_coin.ppt
Dynamic Programming
108_08_dp_4pp.pdf
108_08_dp.pdf
108_08_dp.ppt
Back to COMP108 homepage