Syllabus: CSC 122A, Computer Science II

	Location:	Julian A040, MWF 1:30-2:35
	Home Page:	http://www.csc.depauw.edu/~bhoward/courses/0203Spring/csc122/
	Professor:	Brian Howard (bhoward@depauw.edu)
	Office:	Julian A220, ph. 658-4120
	Office Hours:	MWThF 10-11:30, TuWTh 4-5, or by appointment (or when my door is open)

Text:

Carrano & Prichard, ``Data Abstraction and Problem Solving with C++: Walls and Mirrors'', 3^{$\scriptsize rd$} edition, Addison-Wesley, 2002.

Course Description:

(from the Catalog) 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.

Grading:

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

• 25%: Programming Assignments
• 20%: Homework and Quizzes
• 30%: Hour Exams (two, 15% each): Wednesday evenings, February 26 and April 9, at 7:00 pm
• 25%: Final Exam: Thursday, May 15, 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 Wednesday, February 19 or Friday, February 21, in addition to the regular University breaks.

Week	Monday	Wednesday	Friday
1	Jan. 27	29	31
2	Feb. 3	5	7
3	10	12	14
4	17	No Class
5	24	26: Exam I (7:00)	28
6	Mar. 3	5	7
7	10	12	14
8	17	19	21
	Spring Break
9	31	Apr. 2	4
10	7	9: Exam II (7:00)	11
11	14	16	18
12	21	23	25
13	28	30	May 2
14	5	7
	Final Exam

Schedule of Topics:

This schedule is only approximate and subject to change.

• Week 1: Chapter 1 (Principles of Programming), Appendix A (C++ Review)
• Week 2: Chapter 9 (Quadratic Sorting Algorithms, Running-Time Analysis)
• Weeks 3-5: Chapter 2 (Recursion), Hour Exam I (Wednesday, February 26, 7:00 pm)
• Weeks 6 & 7: Haskell Programming Language
• Week 8: Chapter 3 (Abstract Data Types, Lists)
• Weeks 9 & 10: Chapter 4 (Pointers, Linked Lists), Hour Exam II (Wednesday, April 9, 7:00 pm)
• Week 11: Chapter 5 (More Recursion)
• Week 12: Chapter 9 (Efficient Sorting Algorithms)
• Week 13: Chapter 6 (Stacks)
• Week 14: Chapter 7 (Queues), Final Review