Syllabus: CSC 122B, Computer Science II

 Location: Julian 040, MWF 2:45-3:50 pm
 Home Page: http://www.csc.depauw.edu/~bhoward/courses/0304Spring/csc122/
 Professor: Brian Howard (bhoward@depauw.edu)
 Office: Julian 266, ph. 658-4120
 Office Hours: TTh 10-11:30, MTWTh 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$\scriptstyle \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:

Policy Statements:
 

Calendar:
Note that there will be no class meetings on Wednesday, March 3 or Friday, March 5.
Week Monday Wednesday Friday
1 Feb. 2 4 6
2 9 11 13
3 16 18 20
4 23 25 27
5 Mar. 1 No Class
6 8 10: Exam I 12
7 15 17 19
Spring Break
8 29 31 Apr. 2
9 5 7 9
10 12 14 16
11 19 21 23
12 26 28: Exam II 30
13 May 3 5 7
14 10 12  
Final Exam

Schedule of Topics:
This schedule is only approximate and subject to change.