Framingham State College, Fall 2011
Related materials for prerequisite courses:
Data Structures
Discrete Math
Topics (with
slides):
Introduction (slides)
D. Keil,
Abstraction, functions, and recursion
1. Classes
of problems (slides)
D. Keil,
Computational problems
D. Keil, Propositional and predicate calculus
2. Formal verification (slides)
D. Keil, Sample problems in algorithm verification
3. Algorithm analysis and recurrence relations (slides)
D. Keil, Sample problems in algorithm analysis
4. Divide-and-conquer algorithms (slides)
5. Greedy
and other optimization algorithms (slides)
6. Computational complexity and approximate solutions (slides)
7. Parallel
algorithms, interactive processes (slides)
D. Keil, Survey of scalability of computational systems
Summary (Slides)
This page last edited
6/24/11