Lecture Schedule

Week	Day	Date	Class	Topic	Reading
1	Fri	Sep.05	1	Course introduction, C concepts, compiling, execution	Lesson 1
	Mon	Sep.08	2	C program structure, syntax, data types, variables
	Wed	Sep.10	3	Operator, expressions, flow controls
2	Fri	Sep.12	4	Functions	Lesson 2
	Mon	Sep.15	5	Pointers
	Wed	Sep.17	6	Array
3	Fri	Sep.19	7	Multi-dimensional arrays	Lesson 3
	Mon	Sep.22	8	String
	Wed	Sep.24	9	User defined types: structure
4	Fri	Sep.26	10	User defined types: unions, enumerations	Lesson 4
	Mon	Sep.29	11	File I/O
	Wed	Oct.01	12	C summary, principles of data structures
5	Fri	Oct.03	13	Linked lists - I	Lesson 5
	Mon	Oct.06	14	Linked lists - II
	Wed	Oct.08	15	midterm, covering contents from week 1 to week 4 and A1-A4
6	Fri	Oct.10	16	Queues Next general calendar week is reading break, no classes	Lesson 6
	Mon	Oct.20	17	Stacks
	Wed	Oct.22	18	Stack applications
7	Fri	Oct.24	19	Concepts of trees, binary trees	Lesson 7
	Mon	Oct.27	20	Tree operations and applications
	Wed	Oct.29	21	Binary search trees
8	Fri	Oct.31	22	AVL trees	Lesson 8
	Mon	Nov.03	23	Red black trees
	Wed	Nov.05	24	Splay trees, m-way search trees, B-trees
9	Fri	Nov.07	25	Hash tables, hash functions, collisions	Lesson 9
	Mon	Nov.10	26	Advanced hash functions, problings
	Wed	Nov.12	27	Heaps, binary heaps
10	Fri	Nov.14	28	Binomial heaps	Lesson 10
	Mon	Nov.17	29	Fibonacci heaps
	Wed	Nov.19	30	Concepts of graphs, graph data structures
11	Fri	Nov.21	31	Graph operations	Lesson 11
	Mon	Nov.24	32	Minimum spanning tree problem and algorithms
	Wed	Nov.26	33	Shortest path problems and Dijkstra algorithm
12	Fri	Nov.28	34	Graph pplications	Lesson 12
	Mon	Dec.01	35	Graph application case study
	Wed	Dec.03	36	Final exam review

Lecture schedule is subject to change according to the progress of class.