CSC 222: Data Structures and Algorithms, Spring 2008

Overview

Text:

William H. Ford & William R. Topp, "Data Structures with C++ Using STL" (second edition), Prentice Hall, 2002, ISBN: 0-13-085850-1 (required)

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.

In addition, a side goal for this course will be to gain more experience with the C++ language and to introduce the use of the Linux operating system. The department believes that it is important for students to become comfortable using a variety of programming languages and environments, partly because of the wide range of systems that you might encounter on internships or after graduation, but more importantly because it helps develop the ability to think more critically about the use of the computer as a tool.

Grading:

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

• 45%: Quizzes and Homework (including Programming Projects)
• 30%: In-class exams (Thursdays, March 6 and April 24)
• 25%: Final exam (Tuesday, May 13, 1-4 pm)

The grading scale used for this class will be the following: A (93-100), A- (90-92), B+ (87-89), B (83-86), B- (80-82), C+ (77-79), C (73-76), C- (70-72), D+ (67-69), D (63-66), D- (60-62), F(0-59). I reserve the right to alter this grading scale at any time. The last day to withdraw from class is Friday, October 13^th.

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 at the start of class and programming projects are due by 5 pm 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.
• 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.
• 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.
• During class time, the computer at your seat should be used for note-taking, classroom interaction, and in-class exercises. You are not permitted to read e-mail, browse the web, play games, etc. while class is in session.
• Regrade requests will be entertained for up to one week after the assignment or exam is returned to the student. To request a regrade, please write out on a separate sheet of paper your request and attach it to the assignment or exam, and give it to me. A simple request for more points without a justification is not sufficient! Keep in mind that the entire assignment or exam may be regraded, so carefully consider your requests!
• Please feel free to offer me feedback (positive and negative) about my performance or anything else related to the class. This feedback will have no effect on your grade in the class.
• Reading assignments will be given in class. They will mostly consist of readings from the class textbook, but other handouts and papers may be assigned as well.
• All information about the class, whether given in this handout or in class, is subject to change.

Calendar:

Week	Tuesday	Thursday
1	Jan. 29	31
2	Feb. 5	7
3	Feb. 12	14
4	Feb. 19	21
5	Feb. 26	28
6	Mar. 4	6: Exam 1
7	Mar. 11	13: No Class
8	Mar. 18	20
Spring Break
9	Apr. 1	3
10	Apr. 8	10
11	Apr. 15	17
12	Apr. 22	24: Exam 2
13	Apr. 29	May 1
14	May 6	8
Final Exam: Tuesday, May 13, 1 pm

DePauw University, Computer Science Department, Spring 2008
Maintained by Brian Howard (bhoward@depauw.edu). Last updated