U Chicago CS Dept Logo

CSPP 55001: Algorithms
Autumn 2008


announcements | general information | organization | homework | notes | guidelines for references


Announcements

Homework 8 is posted

Please read guidelines for references posted 10/29/08

Please subscribe to the class mailing list:
http://mailman.cs.uchicago.edu/mailman/listinfo/cspp55001

Required: Please read the policy statement on academic integrity and honesty

Schedule of lectures and recitation sessions

October 1
Lecture 1: Analysis of algorithms: Insertion sort and mergesort
Asymptotic notation, evaluation of recurrences; divide & conquer method
5:30 - 8:30 pm in Ryerson 276
Reading assignment: CLRS chapters 1, 2, and 3; sections 4.1-4.2
October 5
Recitation session: evaluation of mergesort, binary search
4:00 - 6:00 pm in Ryerson 276
October 8
Lecture 2: Dynamic programming
5:30 - 8:30 pm in Ryerson 276
Reading assignment: CLRS sections 15.3-15.4
October 12
Recitation session: Longest common subsequence
Lower bound for binary search
4:00 - 6:00 pm in Ryerson 276
October 15
Quiz 1
Lecture 3: Median and order statistics; probabilistic algorithms: quicksort
Lower bounds for sorting
5:30 - 8:30 pm in Ryerson 276
Reading assignment: CLRS chapters 7, 8, and 9
October 19
Recitation session: Partition and Select
4:00 - 6:00 pm in Ryerson 276
October 22
Quiz 2
Lecture 4: Hashing, hash functions; binary search trees
5:30 - 8:30 pm in Ryerson 276
Reading assignment: CLRS chapters 10, 11, and 12
October 26
Recitation session; midterm preparation
4:00 - 6:00 pm in Ryerson 276
October 29
Midterm
5:30 - 7:00 pm in Ryerson 276
Lecture 5: Graphs
7:15 - 8:30 pm in Ryerson 276
Reading assignment: CLRS section 22.1-22.2
November 2
Recitation session: hashing and binary search trees
4:00 - 6:00 pm in Ryerson 276
November 5
Lecture 6: Breadth-first search; Dijkstra's algorithm
5:30 - 8:30 pm in Ryerson 276
Reading assignment: CLRS sections 22.2, 24.3, and 6.5
November 9
Recitation session: heaps
4:00 - 6:00 pm in Ryerson 276
November 12
Lecture 7: Minimum spanning trees; Depth-first search
5:30 - 8:30 pm in Ryerson 276
Reading assignment: CLRS chaptr 23 and section 22.3
November 15
Lecture 8: Heapsort, Huffman codes, and string-matching
2:00 - 5:00 pm in Ryerson 276
Reading assignment: CLRS chapter 6; section 16.3; chapter 32 introduction and section 32.1
November 16
Recitation session
4:00 - 6:00 pm in Ryerson 276
November 19
Quiz 3
Lecture 9: Depth-first search, DAG shortest paths
5:30 - 8:30 pm in Ryerson 276
Reading assignment: CLRS sections 22.3-22.4
November 23
Recitation session: Strongly connected components
4:00 - 6:00 pm in Ryerson 276
November 30
Recitation session
4:00 - 6:00 pm in Ryerson 276
December 3
Quiz 4
Lecture 10: NP completeness
5:30 - 8:30 pm in Ryerson 276
Reading assignment: CLRS chapter 34
December 10
Final exam
5:30 - 8:30 pm in Ryerson 276


Organization

Staff

Lectures

Recitation session


brady at cs dot uchicago dot edu