CSC 505, Spring 2005, Lecture Notes

CSC 505 Lecture Topics
Topic	Text Section(s)	Time (hrs)
Basic analysis, growth of functions, divide and conquer	2.2-2.3, 3.1-3.2	1.5
Recurrence relations	4.1-4.3	3
Heapsort	6.1-6.5	3
Quicksort	7.1-7.4	3
Lower Bounds for Algorithms and Problems	8.1, notes	1.5
Sorting in less than O(n lg n) time	8.2-8.4	1.5
Order Statistics	9.1-9.3	1.5
Dynamic Programming	15.1-15.5	1.5
Greedy Algorithms	16.1-16.3	1.5
Basic Graph Algorithms	22.1-22.5	1.5
Minimum Spanning Trees	23.1-23.2	3
Disjoint Sets	21.1-21.3	1.5
Single-source Shortest Paths	24.1-24.5	3
All -pairs Shortest Paths	25.1-25.3	1.5
Proof for graph algorithms	notes	1.5
Introduction to NP-completeness	34.1-34.3	3
NP-complete problems and examples of proofs	34.4-34.5	3
Strategies for solving NP-complete problems	35.1-35.2,35.5,notes	3

More than you ever wanted to know about NP-completeness, but still not enough (19, 24-26 April)
Handwritten notes -- more about NP-completeness (12-14 April)
Transparencies for introduction to NP-completeness (5-7 April)
Handwritten notes showing proof techniques for graph algorithms
Proof of correctness for variant of Dijkstra's algorithm presented in lecture 31 March 2005.
Transparencies for shortest path algorithms (29 March)
Transparencies in pdf for basic graph algorithms (17-22 March)
Weeks 7-8 transparencies -- first part and second part; (1-15 March) Minimum spanning trees, disjoint sets.
Week 6 (15-22 February) Order statistics, dynamic programming.
Week 5 (10-11 February) Radix sort (not in these notes but will be covered in lecture), quicksort, average-case analysis
Week 4 (3-8 February) .
Week 3 (1 February) Heapsort.
Week 3 (27 January) More recurrences.
Week 2 (17-21 January) Recurrence relations.
Week 1 (10-14 January) Basic analysis, growth of functions, divide and conquer.

Last modified: September 9, 2009 2:06 PM