COM1201 Spring 1999 Syllabus

Professor Fell

Grading:

Homework Exercises	10%
Programming Assignments	30%
Quizzes	20%
Final	40%

Written assignments are due on Thursdays.
Three 30-minute quizzes are scheduled on Tuesdays.
All but the last program are due on Mondays.
No midterm
Comprehensive final exam
- closed book, closed notes
All assignments are individual assignments. You may start the programming assignments during a closed lab but you will be expected to complete them on your own. Come to labs prepared. Bring diskettes and read the assignment in advance.

Text:

Algorithms in C++, Robert Sedgewick, Addison-Wesley, 1992.

Schedule:

Date	Reading due	Homework due	Quiz	Program due	Class Topic
4/1					Review 1101 exam
4/5					Stacks and Queues
4/6	Chapter 3				Stacks and Queues/Trees
4/8		p. 34 Ex. 5, 10			Trees
4/12	Chapter 4				Trees
4/13					Trees/Recursion
4/15	Chapter 5	p. 50 Ex. 1, 3			Recursion
4/19				P1	Recursion
4/20			Q1
4/22		p. 66 Ex. 6			Priority Queues/Heaps
4/26	Chapter 11				Priority Queues/Heaps
4/27					Elementary Searching Methods
4/29					Binary Search Trees
5/3	Chapter 14			P2	Searching
5/4					Searching
5/6	Chapter 16	p. 213 Ex. 5, 6, 10			Hashing
5/10	Chapter 22				Compression
5/11			Q2
5/13					Graph Algorithms - Depth First Search
5/17	Chapter 29			P3	Graph Algorithms - Breadth First Search
5/18					Graph Algorithms - Union Find
5/21		p. 244 Ex. 3 p. 436 Ex. 3 p. 450 Ex. 2			Graph Algorithms - Union Find
5/24					Weighted Graphs - Minimum Spanning Tree
5/25	Chapter 31		Q3	P4
5/27	Chapter 32				Weighted Graphs - Shortest Path
5/31	Memorial Day - no class
6/1	Chapter 33				Network Flows
6/3				P5	Network Flows
6/7-6/11	Final Exam Week

Last Updated: May 16, 1999 8:32 am by

Harriet Fell
College of Computer Science, Northeastern University
360 Huntington Avenue #161CN,
Boston, MA 02115
Internet: fell@ccs.neu.edu
Phone: (617) 373-2198 / Fax: (617) 373-5121

The URL for this document is: http://www.ccs.neu.edu/home/fell/COM1201/syllabus99.html