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:

PDF (8 slides per page) PDF (1 slide per page) PPT (post after lectures)
Introduction 108_01_basics_8pp.pdf 108_01_basics.pdf 108_01_basics.pptx
puzzle_01_bridge.pptx
Searching 108_02_searching_8pp.pdf 108_02_searching.pdf 108_02_searching.pptx
Mathematical Induction 108_03_induction_8pp.pdf 108_03_induction.pdf 108_03_induction.pptx
puzzle_03_weighing.pptx
Time Complexity 108_04_efficiency_8pp.pdf 108_04_efficiency.pdf 108_04_efficiency.pptx
Polynomial and Exponetial Time Algorithms 108_05_polynomial_exponential_8pp.pdf 108_05_polynomial_exponential.pdf 108_05_polynomial_exponential.pptx
puzzle_05_photo.pptx
Video on DNA Matching
Video on Bubble Sort
Divide and Conquer Method 108_06_divide_conquer_8pp.pdf 108_06_divide_conquer.pdf 108_06_divide_conquer.pptx
puzzle_06_pancake.pptx
puzzle_06_triomino.pptx
Link to Robozzle
Video on Merge Sort
Graph Theory 108_07_graph_8pp.pdf 108_07_graph.pdf 108_07_graph.pptx
puzzle_07_water.pptx
Greedy Methods 108_08_greedy_8pp.pdf 108_08_greedy.pdf 108_08_greedy.pptx
puzzle_08_coin.pptx
Dynamic Programming 108_09_dp_8pp.pdf 108_09_dp.pdf 108_09_dp.pptx
FibApp.java
FibSol.java

 

Solutions to in-class exercises:

 

Back to COMP108 homepage