CS 256, Spring 1996

Lecture and Reading Schedule:

Day	Topic	                                Reading

Feb 2	Introduction	                        Chap.1 & Exercises
Feb 5	Solving Problems by Induction 1	        2.1-2.6
Feb 7	Solving Problems by Induction 2	        2.7-2.14
Feb 9	Measuring Algorithm Performance 1       3.1-3.7,6.4.3
Feb 12	Measuring Algorithm Performance 2	3.5-3.7,6.4.4
Feb 14	Measuring Algorithm Performance 3	3.1-3.7,6.4.3
Feb 16	*****WINTER CARNIVAL*****	
Feb 19	Data Structures for Algorithms 1	4.1-4.3.2,6.4.5
Feb 21	Data Structures for Algorithms 2	4.3.3-4.3.4
Feb 23	Data Structures for Algorithms 3	4.3.4 & notes
Feb 26	Data Structures for Algorithms 4	4.4-4.7
Feb 28	Data Structures for Algorithms 5	7.6
Mar 1	Designing Algorithms by Induction 1	5.1-5.4
Mar 4	Designing Algorithms by Induction 2	5.5-5.7
Mar 6	Designing Algorithms by Induction 3	5.7-5.12
Mar 8	Searching, Sorting & 
		Order Statistics 1: Searching	6.1-6.3
Mar 11	Searching, Sorting & 
		Order Statistics 2: Sorting	6.4,6.5
Mar 13	Lower Bounds 1				Notes
Mar 15	Lower Bounds 2				Notes
	******** Spring Break *****	
Apr 1	More Algorithms Involving Sequences
		and Sets 1			6.6-6.12
Apr 3	More Algorithms Involving Sequences
		and Sets 2			6.6-6.12
Apr 5	Graph Algorithms:  Intro. & Graph
		Searching 1			7.1-7.3
Apr 8	Searching a Graph 2			7.3-7.4
Apr 10	Applications of Searching		7.9.2
Apr 12	Shortest Path Problems			7.5,7.7
Apr 15	Backtracking & Branch and Bound 1	11.5
Apr 17	Backtracking & Branch and Bound 2	Notes
Apr 19	Geometric Algorithms 1			8.1-8.4
Apr 22	Geometric Algorithms 2			8.5-8.7
Apr 24	Problem Reduction 1			10.1,10.2
Apr 26	Problem Reduction 2			10.4.1,10.5
Apr 29	NP-Completeness 1			11.1-11.3
May 1	NP-Completeness 2			11.4
May 3	Heuristics for NP-Complete Problems	11.5
May 6	Parallel Algorithms 1			12.1-12.3
May 8	Parallel Algorithms 2			12.3-12.4
May 10	Parallel Algorithms 3			12.4-12.6