63.347 Analysis of Algorithms

David Keil (dkeil@frc.mass.edu)

Framingham State College, Fall 2008

Syllabus (PDF)

Group work (PDF)

Study questions (PDF)

Related materials for prerequisite courses:
Data Structures
Discrete Math

Topics (with slides):

Introduction

1. Classes of problems

2. Formal verification

3. Algorithm analysis and recurrence relations

4. Brute-force algorithms

5. Divide-and-conquer algorithms

6. Greedy algorithms

7. Space/time tradeoffs; dynamic-programming algorithms; transform and conquer

8. Computational complexity

9. Approximation and probabilistic algorithms; evolutionary computation

10. Parallel and distributed algorithms

11. Algorithms and interactive processes