Algorithm Design and Analysis

Course Description

Algorithm Design and Analysis…

 

Course Outline

Session Topics Readings Homeworks
1 Introduction to algorithm analysis Lecturer handout hw1
2 Divide-and-conquer Lecturer handout hw2
3 Probabilistic analysis and randomized algorithms Lecturer handout hw3
4 Dynamic programming Lecturer handout hw4
5 Greedy algorithms Lecturer handout hw5
6 Amortized analysis Lecturer handout hw6
7 Trees Lecturer handout hw7
8 Graphs Lecturer handout hw8
9 Number-theoretic algorithms Lecturer handout hw9
10 Approximation algorithms Lecturer handout hw10
11 Genetic algorithm theory Lecturer handout hw11
12 P and NP Lecturer handout hw12

 

Recommended Readings

  1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
  2. Introduction of the Theory of Complexity, Daniel Plerre Bovet, Plerlulgi Crescenzl, D. Bovet
  3. The Simple Genetic Algorithm: Foundations and Theory, Michael D. Vose