You will need Adobe Acrobat Reader or another PDF compatible viewer to read these lecture notes. If you find any typos or errors, please let me know.
The following lecture notes are available:
New Notes -- These were updated in the Fall of 2006
Lecture 01 -- The Connectivity Problem
Lecture 02 -- Programming in C
Lecture 03 -- Programming Tools
Lecture 04 -- Algorithm Analysis
Lecture 05 -- Dynamic Programming
Lecture 06 -- Basic Sorting
Lecture 07 -- Shell's Sort
Lecture 08 -- Quick Sort
Lecture 09 -- Merge Sort
Lecture 10 -- Introduction to Hashing
Lecture 11 -- Hashing (Part II)
Lecture 12 -- Mid-Term Review
Lecture 13 -- Mid-Term Evaluation
Lecture 14 -- Random Numbers
Lecture 15 -- Numerical Optimization
Lecture 16 -- Optimization with Parabolas, Mixture Distributions
Lecture 17 -- Nelder Mead Simplex Optimization
Lecture 18 -- The E-M Algorithm
Lecture 19 -- Simulated Annealing
Lecture 20 -- Gibbs Sampling
Lecture 21 -- Introduction to Numerical Integration
Lecture 22 -- Monte Carlo Integration
Lecture 23 -- Introduction to R
Data for Worksheet 8 is available here.
Old Notes -- These were updated in the Fall of 2004
Lecture 04 -- Introduction to R
Lecture 05 -- Graphics in R
Lecture 24 -- Half-Term Review II
Lecture 25 -- Half-Term Evaluation II
Worksheet 01 -- Introductory Questionnaire
Worksheet 02 -- Union Find Algorithms
Worksheet 03 -- Floating Point Precision
Worksheet 04 -- Dynamic Programming
Worksheet 05 -- Sorting (Part I)
Worksheet 06 -- Sorting (Part II)
Worksheet 07 -- Hashing
Worksheet 08 -- Random Numbers, Integration
Worksheet 09 -- Numerical Optimization
Worksheet 10 -- The Nelder Mead Simplex Method
Worksheet 11 -- Multidimensional Optimization
Data for Worksheet 11 is available here.
Robert Sedgewick. Algorithms in C. (3rd ed., 1998). Published by
Adison Wesley Professional.
Press, Teukolsky, Vetterling, Flannery. Numerical Recipes in C.
(2nd ed., 1998). Published by Cambridge University Press.
2004 lecture notes are available here.