CSC 122: Computer Science II, Spring 2005

Overview

Text:

Jaime Niño and Frederick A. Hosch, "An Introduction to Programming and Object Oriented Design Using Java Version 5.0" (second edition), John Wiley & Sons, 2005, ISBN: 0-471-71227-2

Course Description:

This course is composed of two sets of overlapping and complementary ideas: the art and science of program development, and fundamental concepts from computer science. This course builds on CSC 121 and introduces programming topics such as sets, recursion, and dynamic data types. Data type abstraction and implementation are introduced by studying structures such as lists, stacks, queues, and binary trees. The object-oriented implementation of these structures is emphasized. Tools for algorithm analysis are introduced, and comparisons of functional, object-oriented, and imperative programming paradigms are made. The concept of tradeoffs, i.e., time vs. space, iteration vs. recursion, static vs. dynamic, and imperative vs. functional, recurs as a theme throughout the course. A large part of the outside work associated with the course will involve assignments designed to enhance lecture concepts.

Grading:

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

• 30%: Programming projects
• 10%: Homework assignments and quizzes
• 35%: Midterm exams (Wednesday, March 2 and Wednesday, April 13, at 7 pm)
• 25%: Final exam

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.
• Exams in this course will be closed-book and closed-notes, and will cover lectures and assigned readings. More information will be available prior to each exam. The examinations during the semester will be given in the evening, concurrently with the other section.
• 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.

Calendar:

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

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