Date  

Lecture Topics

Assigned Readings

Other Assignments

29-Aug, Mon

Syllabus, Introduction, Introduce Yourself

Ch.1.

Make sure to read my class policies

31-Aug, Wed

Intro to study algorithms

Ch. 2.1-4.

Handout broadens the material

2-Sep, Fri

Algorithmic Strategies & Math. Proofs

Ch. 2.4, 3.4 & Handout!

Happy Labor Day!

5-Sep, Mon

Labor Day holiday (no classes)

7-Sep, Wed

Alg. Strategies & Math. Proofs - cont.

pp. 17-25 in M. Sipser, Introduction to the Theory of Computation, ISBN: 053494728X, PWS Publishing

9-Sep, Fri

Intro to Analysis of Algorithms

Ch. 2.6.5

Make sure to read handouts 

12-Sep, Mon

Asymptotic Analysis

Ch. 3.1-2, 3.5 & Handout!

Make sure to read handouts 

14-Sep, Wed

Asymptotic Analysis - cont. 

16-Sep, Fri

Analysis of Recursive Algorithms 

pp. 62-89 in T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms (2nd Ed.), ISBN: 0262032937, MIT Press.

19-Sep, Mon

Analysis of Recursive Algorithm - cont. 

21-Sep, Wed

Mac OS X - invited speaker

23-Sep, Fri

Analysis of Recursion Trees 

26-Sep, Mon

Analysis of Recursion Trees -cont.

28-Sep, Wed

Master Theorem Method

30-Sep, Fri

Master Theorem Method - cont.

Homework 1

3-Oct, Mon

Dynamic Programming

Ch. 9 

5-Oct, Wed

Dynamic Programming - cont. 

7-Oct, Fri

Longest Common Subsequence - example of Dynamic Programming

Ch. 9 

10-Oct, Mon

Practice of Dynamic Programming 

12-Oct, Wed

Greedy and Dynamic Programming

Ch. 7 

14-Oct, Fri

Greedy and Dynamic Programming-cont. 

 Homework 1 due before the class

17-Oct, Mon

Bellman-Ford Algorithm - example of Greedy Strategy

Ch. 12.2 

19-Oct, Wed

 Exam 1

21-Oct, Fri

Floyd's Algorithm - example of Greedy Strategy

Ch. 12.2

24-Oct, Mon

Intro to Backtracking and Branch&Bound  

Ch. 10 

26-Oct, Wed

Backtracking and Branch&Bound 

28-Oct, Fri

Nearest Neighbor - example of Divide&Conquer Algorithm

Ch. 8 

Homework 2

31-Oct, Mon

Intro to Randomized Choices 

Ch. 24 

2-Nov, Wed

Probabilistic and Randomized Algorithms 

4-Nov, Fri

Probabilistic and Randomized Alg. - cont. 

7-Nov, Mon

Primality Testing - example of Monte Carlo Algorithm

Ch. 24.3 

9-Nov, Wed

Exam 1 Review, Exam 2

11-Nov, Fri

Veteran's Day holiday (no classes)

14-Nov, Mon

Flat Search Trees - B-trees (overflow)

 Homework 2 due before the class

16-Nov, Wed

Flat Search Trees - B-trees (underflow) 

 Take home test due before the class

18-Nov, Fri

A*-Search - example of Branch&Bound Algorithm (1)

Ch. 23 

Homework 3 

21-Nov, Mon

A*-Search - example of Branch&Bound Algorithm (2) 

23-Nov, Wed

25-Nov, Fri

Thanksgiving Day holiday (no classes)

28-Nov, Mon

Fast Fourier Transform - example of Divide&Conquer Algorithm (1)

Ch. 22 

30-Nov, Wed

Fast Fourier Transform - example of Divide&Conquer Algorithm (2) 

2-Dec, Fri

Internet Algorithms for Websites Ranking - PageRank (Google)  

Ch.17

5-Dec, Mon

Internet Algorithms for Websites Ranking - HITS 

Ch.17 

7-Dec, Wed

Web Caching 

Ch.17

9-Dec, Fri

Review for final 

 Homework 3 due before the class

12-Dec, Mon

8-9:50 AM - FINAL EXAM (20%) in 113 Roberts Hall