Syllabus: CSC 222, Data Structures and Algorithms

	Location:	Julian A215, MWF 10:30-11:35
	Home Page:	http://acad.depauw.edu/~bhoward/courses/0203Fall/csc222/
	Professor:	Brian Howard (bhoward@depauw.edu)
	Office:	Julian A220, ph. 658-4120
	Office Hours:	TTh 10-12, 2-4, or by appointment (or when my door is open)

Text:

Robert Sedgewick, ``Algorithms in C++'', 3^{$\scriptsize rd$} edition, Addison-Wesley, 1998 (Parts 1-4) & 2002 (Part 5).

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, September 20 and Friday, November 8
• 25%--Final Exam: Monday, December 9, 8:30-11:30

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:

Note that there will be no class on Friday, October 4 or Monday, October 7, in addition to the regular University breaks.

Monday	Wednesday	Friday
	Aug. 21	23
26	28	30
Sept. 2	4	6
9	11	13
16	18	20: Exam 1
23	25	27
30	Oct. 2	4: No Class
7: No Class	9	11
14	16	18
Fall Break
28	30	Nov. 1
4	6	8: Exam 2
11	13	15
18	20	22
25	Thanksgiving
Dec. 2	4	6
9: Final Exam