Syllabus: CSC 122B, Computer Science II

	Location:	Julian 040, TTh 7-8:50 pm
	Home Page:	http://www.csc.depauw.edu/~bhoward/courses/0304Fall/csc122/
	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:

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:

• 30%: Programming Assignments
• 20%: Labs, Homework, and Quizzes
• 30%: Hour Exams (two, 15% each): Wednesday evenings, October 8 and November 19, at 7 pm
• 20%: Final Exam: Wednesday, December 17, 6-9 pm

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 and programming projects are due by the start of class 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, programming assignments, and labs 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.

• 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.

Labs:

This semester, we are going to have ``unofficial'' lab sessions as part of class, averaging about one per week. The assignment for each lab will be distributed before each lab; there will be no prelab assignment. The labs will be graded as the CS 1 labs were--full credit for completing the assignment before the next lab starts.

Calendar:

 

Week	Tuesday	Wednesday	Thursday
1			Aug. 28
2	Sep. 2		4
3	9		11
4	16		18
5	23		25
6	30		Oct. 2
7	7	8: Exam I	9
8	14		16
Fall Break
9	28		30
10	Nov. 4		6
11	11		13
12	18	19: Exam II	20
Thanksgiving Break
13	Dec. 2		4
14	9		11
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 & 4: Chapter 2 (Recursion)
• Weeks 4 & 5: Haskell Programming Language
• Week 6: Chapter 3 (Abstract Data Types, Lists)
• Week 7: Exam I (Wednesday, October 8, 7-9 pm)
• Weeks 8 & 9: Chapter 4 (Pointers, Linked Lists)
• Week 10: Chapter 5 (More Recursion)
• Week 11: Chapter 9 (Efficient Sorting Algorithms)
• Week 12: Exam II (Wednesday, November 19, 7-9 pm)
• Week 13: Chapter 6 (Stacks)
• Week 14: Chapter 7 (Queues), Final Review