Course Outline:

Text:   Cormen, Leiserson, Rivest and Stein, Introduction To Algorithms,
            Second Edition, McGraw-Hill Book Company, 2001, ISBN 0-07-013151-1
 

Weeks	Chapters	Topics
1	1	The Role of Algorithms in Computing       FIRST EXAMPLE
	2	Getting Started (Insertion Sort & Merge Sort)
2	3	Growth of Functions (Asymptotic notation)
	4	Recurrences                Example of Counting Steps    Exercise
3		Review and mid-term test I
4, 5, 6	6	Heapsort
	7	Quicksort
	8	Sorting in Linear Time
7, 8, 9	10	Elementary Data Structures (Stack, Queue, and Linked List)
	12	Binary Search Trees
	13	Red-Black Trees
10		Review and mid-term test II
11	16, 15	Greedy Algorithms and Dynamic Programming
12	22	Elementary Graph Algorithms
13	23	Minimum spanning trees
14		Review and mid-term test III
15		Comprehensive Final Exam