COMP3121/3821
Algorithms and Programming
Techniques
And
COMP9101/9801
Design and
Analysis of Computer Algorithms
Session 1,
2009
Lectures
This is where you can find lecture related
handouts.
All files are in the pdf
format.
Note: These notes are NOT intended to replace reading
the textbook!!! They are an initial help; as we
progress through the material and you get more sophisticated they will gradually diminish. Please
start reading the textbook
Introduction to Algorithms, and learn to find your way through sophisticated
books on the subject.
Lecture Notes
|
|
||||
|
|
||||
|
|
||||
|
|
||||
|
|
|||
|
|
|
||
|
|
|
||
|
·
More
Divide-and-Conquer Examples: Matrix Multiplication and VLSI Layout |
|
|||
|
|
||||
|
|
||||
|
· More Dynamic Programming Problems http:/people.csail.mit.edu/bdean/6.046/dp/ |
|
|||
|
|
||||
|
|
||||
|
|
|
|||