Week(Date)	Lecture	Lab	Contents/Comments
1(0914)	1	1	Introduction to Course + Using JEdit, Review of C-Compiler
1(0919)	2	-	1.2 Variables
1(0919)	3	-	1.3a Pointers
2(0921)	-	2	Variables and Pointers
2(0926)	4	-	1.3b,1.4 Pointers
2(0926)	5	-	2.1 Arrays
3(0928)	-	3	Pointers and Arrays
3(1003)	6	-	2.2 Records
3(1003)	7	-	2.2 Records and 2.3 Arrays of Records
3(1003)	-	-	Project: List of names of group members with choice of chapter (QUEUE)
4(1005)	-	4	Records
4(1010)	-	-	National Day Holiday -- no class :)
5(1012)	8	-	3.1-3.3 Linked Lists (Location TBA)
5(1017)	9	-	3.4 Stacks
5(1017)	10	-	3.5 Queues
6(1019)	-	5	3 Linked Lists
6(1024)	11	-	6.1 Direct Recursion
6(1024)	12	-	6.2 Mutual Recursion
7(1026)	-	6	Recursion
7(1031)	13	-	6.3 Backtracking
7(1031)	14	-	6.4 Lookahead (Note New Code)
8(1102)	15	-	6.4 Lookahead (Note New Code)(Location TBA)
8(1107)	16	-	7.1-7.3 Algorithms -- Evaluation
8(1107)	17	-	7.4 Big-OH
8(1107)	-	-	Group Project for chapters 1,2,3,6 DUE.
0(1114)	-	-	Midterm Paper (Covers up to Section 6.4)
9(1116)	-	7	Big-OH and Time Complexity
9(1121)	18	-	7.5 Error Propagation in Algorithms
9(1121)	19	-	4.1 to 4.3 General Tree Concepts
10(1123)	-	8	Discussion of Midterm Paper
10(1128)	20	-	4.4.1 Binary Tree Implementation: Linked Lists
10(1128)	21	-	8.1 Sequential Searching
11(1130)	-	9	Trees
11(1205)	22	-	8.2 Binary Searching with Arrays
11(1205)	23	-	8.3 Hash Tables
12(1207)	-	10	Searching
12(1212)	24	-	9.1-9.2 Simple Sorting
12(1212)	25	-	9.3 Divide & Conquer + Merge Sort
13(1214)	-	11	Sorting
13(1219)	26	-	9.3 Quick Sort
13(1219)	27	-	5.0 to 5.2 Graphs
14(1221)	-	12	QuickSort and Graphs
14(1226)	28	-	5.3 to 5.4 Graph Implementation & Traversal
14(1226)	29	-	10.1 Travelling Salesman & 10.2 Greedy Algorithms
15(1228)	-	13	Greedy Algorithms
15(0102)	30	-	5.5 Sets
15(0102)	31	-	10.3 Dijkstra Algorithm
16(0104)	-	14	Dijkstra Algorithm
16(0104)	-	-	Group Project for chapters 4,5,7,8,9,10,11,12 DUE.
16(0109)	-	-	Possible date for final examination paper.
Mark Information
LabTut	10%	-	For each tutorial, 1 mark is assigned for preparation and 1 mark for participation. eg. a student who copies the correct answer may get 0/2 while a student who tried the problem himself but got the wrong answer may be awarded 2/2.
Midterm	15%	-	30 short answer and multiple choice questions each worth 0.5 marks. Students must answer all questions.*
Project	15%	-	Form a group (Maximum 8 people) to complete this year's project.         Each group will write a summary of the key points of a chapter that will be useful for you in writing the final exam.             1. Glossary of key words: English to Chinese with definition in Chinese             2. Two to three page summary in Chinese (may include high quality figures and diagrams) of the chapter.             3. Compose 10 questions that are suitable for testing a student's knowledge of the material.         Before October 3rd you need to submit a list of members of your group along with with your choice of chapter. Note that the assignment of chapters is FIFO (first come first served). Only one group can do a chapter
Exam	60%	-	6 long answer questions. Each student must answer 4 questions. Each question has equal marks.*
mark.pdf	-	-	Marks to date
*you may bring an original copy of the textbook or other C programming book into the midterm and final examination. You may not bring photocopies, calculators, cell phones or other electronic aids.
Other Files
Tutorial support: [tutorials][timecomp][safe.csv]
Lecturer: [HomePage]