Syllabus: CSC 222, Data Structures and Algorithms

	Location:	Section A: Julian 040, MWF 1:30-2:35; Section B: Julian 109, MWF 2:45-3:50
	Home Page:	http://www.csc.depauw.edu/~bhoward/courses/0304Fall/csc222/
	Professor:	Brian Howard (bhoward@depauw.edu)
	Office:	Julian 266, ph. 658-4120
	Office Hours:	MWF 10-11:30, TWTh 4-5, or by appointment (or when my door is open)

Text:

Ford & Topp, ``Data Structures with C++ Using STL'', 2 edition, Prentice Hall, 2002.

Course Description:

(from the Catalog) This course examines, in depth, several historically significant and highly functional models of data storage, including trees, sets, tries, priority queues, and graphs. Attention is given to selecting the most appropriate model for a particular problem. Differences between the conceptual features of a model and its physical representation on a computer are emphasized. Algorithms which operate on these models are also considered. Other topics include an in-depth study of sorting, including special-purpose sorting algorithms.

Grading:

The grade for this course will be based on the following:

45%--Quizzes and Homework (including Programming Projects)
30%--In-class Exams: Friday, October 3 and Friday, November 21
25%--Final Exam: Section A: Thursday, December 18, 8:30-11:30; Section B: Wednesday, December 17, 1-4

Policy Statements:

You are expected to attend all class sessions. However, I expect you to take your own education seriously, so I do not keep formal attendance records. If you miss a class, you are responsible for catching up with the material that was covered and any announcements that were made.
Homework assignments are due by the start of class, and programming projects are due by 5:00 p.m. on the assigned date. Late submissions will be accepted until the next class time at a penalty of half the grade. Extensions will be considered only by prior arrangement.
Cheating, plagiarism, submission of the work of others, etc., violates the DePauw policy on academic integrity and may result in penalties ranging from a lowered grade to course failure or expulsion. The policy and discussion of each student's obligations and rights are in the Student Handbook.
With respect to this course, no collaboration is permitted on exams or quizzes. You may discuss homework problems and programming assignments with anyone you want (in fact, you are encouraged to do so), but you should not copy another student's work nor permit your work to be copied. The key idea is that you should understand all of the work you turn in, and you should be able to replicate it on your own. If you do not feel that you can replicate the work independently, then it is not fair (to yourself or to others) to submit it as your own work. If at any time you are uncertain what constitutes ``appropriate'' collaboration, it is your responsibility to clarify it with me.
Programming projects will be graded on style and efficiency as well as correct operation. To develop as a programmer, you are strongly encouraged to do more than the minimum assigned amount of work; the best way to learn good style and common idioms is to read and write lots of code.

Calendar:

Monday	Wednesday	Friday
	Aug. 27	29
Sept. 1	3	5
8	10	12
15	17	19
22	24	26
29	Oct. 1	3: Exam 1
6	8	10
13	15	17
Fall Break
27	29	31
Nov. 3	5	7
10	12	14
17	19	21: Exam 2
24	Thanksgiving
Dec. 1	3	5
8	10	12
Final Exam

Schedule of Topics:

This schedule is only approximate and subject to change.

Week 1: Chapter 3 (Introduction to Algorithms)
Week 2: Chapter 4 (The Vector Container)
Week 3: Chapters 5 & 6 (Dynamic Memory, Lists, and Iterators)
Week 4: Chapters 7 & 8 (Stacks, Queues, and Priority Queues)
Week 5: Chapter 10 (Binary Trees)
Week 6: Exam I (Friday, October 3)
Week 7: Chapter 11 (Associative Containers)
Weeks 8 & 9: Chapter 12 (Advanced Associative Structures)
Week 10: Chapter 14 (Heaps)
Week 11: Chapter 15 (Recursive Algorithms)
Week 12: Exam II (Friday, November 21)
Weeks 13 & 14: Chapter 16 (Graphs), Final Review