Text:   Mark Allen Weiss, Data Structures and Algorithm Analysis,
            Second Edition, The Benjamin/Cummings Publishing Company, Inc., 1995, ISBN 0-8053-9057-X
 

Weeks	Chapters	Sections	Topics
1	1		Introduction
		1.1	What are algorithms?       Example
		1.2	Mathematics Review
		1.3	A Brief Introduction to Recursion
2, 3	2		Algorithm Analysis
		2.1	Mathematical Background
		2.4.1	A Simple Example
		2.3 & 2.4.3	Maximum Subsequence Sum Problem
		2.4.3	Divide-and-Conquer,            Recurrences
4			Review and  Test 1
5, 6	4		Trees
		4.1	Preliminaries
		4.2 & 4.6	Binary Trees          ( Tree Traversals)
		4.3	Binary Search Tree
	12		Advanced Data Structures and Implementation
		12.2	Red Black Trees
7, 8, 9	7		Sorting                  Stable Sort
		7.2	Insertion Sort
	6	6.1 to 6.3 & 7.5	Heapsort
		7.6	Mergesort
		7.7	Quicksort
		7.10	Sorting in a Linear Time Bucket Sort, Counting Sort, Radix Sort (codes)
10			Review and  Test 2
11, 12	9		Graph Algorithms
		9.1	Definitions
		9.3	Breadth-First Search
		9.6	Depth-First Search
		9.5	Minimum Spanning Tree
13	10		Algorithm Design Techniques
		10.1	Greedy Algorithms
		10.3	Dynamic Programming
14			Review and  Test 3
15			Comprehensive Final Exam