These notes are placed here primarily to assist students enrolled in the course;
they are not intended as polished documents. All notes are copyright ©
Russell C. Bjork. Students enrolled in CS321 may reproduce these notes for
personal study; all other rights are reserved. (Lecture notes will be posted
shortly after each topic is completed in class.)
- Course Introduction; Review of Algorithm Analysis
- Sparse Polynomials and Matrices
- Threaded Binary Trees
- Search structures
- Graphs
- Transparencies for graphs lectures
- Network flow problems
- B Trees and Variants
- External Sorting
- The Huffman Algorithm