ICS 621 Analysis of Algorithms (Spring 2012)

General Information

Topics

Grading (Tentative)

Class participation grades will be based on attendance and note taking. Notes must be typeset using LaTeX using the given notes template.

Homework Assignments will be assigned on the Wednesday of each week and are due the following Wednesday at 2359 hours in hardcopy. The homework assignments must be typeset in LaTeX with the homework number and your name displayed clearly on the front page. Please use one of the algorithms latex package (see wikibook) to typeset pseudocode (algorithmic.sty is recommended).

Class Schedule (tentative)

Week Date Topic Readings Remarks
1 Mon Jan 9 Course Organization Ch.1 & 2  
1 Wed Jan 11 Sorting Ch.3 HW01: Problem 2-1 CLRS (pdf) (tex)
2 Mon Jan 16 MLK Holiday    
2 Wed Jan 18 Sorting Ch 4.{3-5}, 6 HW02: Choose either Problem 6-2 or 6-3 from CLRS (pdf) (tex)
3 Mon Jan 23 Sorting Ch 7  
3 Wed Jan 25 Sorting Ch 8 HW03: Choose either Problem 8.4-4 or 8-4 from CLRS. (pdf) (tex)
4 Mon Jan 30 Order Statistics & Binary Search Trees   Ch 9,12  
4 Wed Feb 1 Red-Black Trees & Interval Trees Ch 13,14 HW04: Choose either Problem 13-3 or 14-2 from CLRS (pdf) (tex)
5 Mon Feb 6 Amortized Analysis Ch 17  
5 Wed Feb 8 Binomial Heaps Ref (ppt) Ch. 19 HW05: Problem 17-3 CLRS. (pdf) (tex) | Handout
6 Mon Feb 13 Fibonacci Heaps Ch. 19 Animation. | figures (pdf)
6 Wed Feb 15 Dynamic Programming Ch. 15 figures (pdf) | matrixparen.pl | Ref (pdf)
HW06: Problem 15-6 or 15-10 from CLRS (pdf) (tex)
7 Mon Feb 20 President's Day Holiday    
7 Wed Feb 22 Greedy Algorithms. Ch. 16 HW07: Problem 16-1 or 16-2 from CLRS (scanned pdf)
8 Mon Feb 27 Hashing. Ch. 11  
8 Wed Feb 29 Hashing. Ch. 11 HW08: CLRS Problem 11-1 or 11-4 (scanned pdf). Leiserson's Lecture on Universal Hashing  
9 Mon Mar 5 Graph Algorithms: BFS, DFS, SCC, MST Ch. 22-23  
9 Wed Mar 7 Graph Algorithms: SSSP Ch. 24 HW09: CLRS 22-2 or 22-3  
10 Mon Mar 12 Graph Algorithms: APSP Ch. 25  
10 Wed Mar 14 Reservoir Sampling. Reservoir Sampling (pdf) No HW this week. Work on your project proposals.  
11 Mon Mar 19 Graph Algorithms: Max Flow Ch. 26.  
11 Wed Mar 21 NP-Completeness Ch 34 Project Proposals due on Friday. HW10: CLRS 34-2 or 34-3 due April 13 2012
12 Mon Mar 26 Spring Break    
12 Wed Mar 28 Spring Break    
13 Mon Apr 2 NP-Completeness: Cook-Levin Theorem Handout from Garey & Johnson's Book  
13 Wed Apr 4 NP-Completeness: Reduction Proofs   Ch 34.    
14 Mon Apr 9 Approximation Algorithms for NPC Problems Ch 35.  
14 Wed Apr 11 Parallel Disk Model. B+-trees. Ch. 18. Vitter's IO Book (pdf) Ch. 1,2,5,11. [Optional] HW11: CLRS 35-4. Due Apr 25.
15 Mon Apr 16 Van Emde Boas Trees and Cache-Oblivious Layout Ch.20, Cache-Oblivious Data Structures  
15 Wed Apr 18 Compression Algorithms: Huffman Trees,LZW,BWT Dynamic Huffman Codes Ch 16.3, LZW, BWT.   Huffman Trees and LZW Animation
16 Mon Apr 23 Approximate Counting, Bloom Filters, CM-Sketches & FM-Sketches Approximate Counting, Bloom Filters, Count-Min Sketches,  
16 Wed Apr 25 Numerical Algorithms Bisection's Method, Newton's Method, Secant Method  
17 Mon Apr 30 Project Presentations    
17 Wed May 2 Project Presentations    

Other Readings

Useful Links