CSC112 Fall 2000 Schedule

Lecture notes and assignment handouts may not be posted for all the classes. A handout available before the actual lecture meeting is only tentative and may be changed at any time by the professor. Handouts are not meant as a substitute for class attendence, but as guidelines for the topics covered in class.

All homeworks are handed in on Thursday and are due by the following Wednesday at midnight 12:00, sharp.

Class #		Date	Lecture	Topic	Assignment
1		Th 9/8	Lecture 1	Introduction.	hw1
2		Tu 9/12	Lecture 2	Basic Software Engineering principles
3		Th 9/14	Lecture 3	Selection Sort done and debugged in class	hw 2
4		Tu 9/19	Lecture 4	Debugging. Insertion Sort.
5		Th 9/21	Lecture 5	The Game of Life	hw 3
6		Tu 9/26	Lecture 6	Templates in C++
7		Th 9/28	Lecture 7	Structures. Templates cont'd.	hw 4
8		Tu 10/3	Lecture 8	Classes
9		Th 10/5	Lecture 9	Stacks	hw 5
-		Tu 10/10	October recess
10	Th 10/12		Lecture 10	Applications of Stacks
11		Tu 10/17	Lecture 11	Midterm review
M		Th 10/19	Midterm .	Midterm exam
12		Tu 10/24	Lecture 12	Class templates and applications of Stacks	hw6
13		Th 10/26	Lecture 13	Memory allocation using stacks
14		Tu 10/31	Lecture 14	Recursion
15		Th 11/2	Lecture 15	Queues. More on recursion.	hw7
16		Tu 11/7	Lecture 16	More on Recursion and Recursive function calls
17		Th 11/9	Lecture 17	Lists	hw8
18		Tu 11/14	Lecture 18
19		Th 11/16	Lecture 19		hw 9
20		Tu 11/21	Lecture 20	Trees
21		Tu 11/28	Lecture 21	Binary Search Trees Tree Traversal: prefix, infix, postfix
22		Th 11/30	Lecture 22	Graphs Start discussion about final project	hw10
23		Tu 12/5	Lecture 23	Graph Traversal Depth First search
24		Th 12/7	Lecture 24	Applications of DFS	Final Project
25		Tu 12/12	Lecture 25	Work on Final Project
P		Th 12/14	Final Project Presentation	Old exams