Syllabus for COMP 132

Syllabus for COMP 132: Introduction to Computer Science II

Spring 2009

Tim Wahls
office: Tome 244
office hours: MF 1:30 - 2:45 p.m, T 11:00 a.m. - 12:00 p.m., T 1:30 - 2:45 p.m and by appointment
phone: (717) 245 - 1743
email: wahlst@dickinson.edu
course URL: http://www.dickinson.edu/~wahlst/132/

Text

Java Concepts, fifth edition. Cay Horstmann. John Wiley and Sons, 2008. ISBN: 978-0-470-10555-9

Prerequisites

COMP 131 or permission of the instructor.

Goals

After completing this course, students should:

have a deeper understanding of object-oriented design and programming techniques
understand the implementation and analysis of basic searching and sorting algorithms
be familiar with recursion
be able to implement and use data structures such as linked lists, stacks and queues

Evaluation

Grades will be based on regular in-class and out-of-class homework assignments (totaling about 100 points), weekly lab assignments (totaling about 250 points), two written midterm exams (75 points each), two lab exams (50 points each) and a final exam (150 points).

Tentative Outline

Topic	Reading	Topic	Reading
Eclipse and Unit Testing	8.10, 7.8	I/O and Exceptions	11
Designing Classes	8	Recursion	13
Multi-Dimensional Arrays	7.6	Midterm Exam II	Friday, April 10
Interfaces and Polymorphism	9.1 - 9.4	Sorting and Searching	14
Inheritance	10	Data Structures	15
Midterm Exam I	Friday, February 27	Lab Exam II	Wednesday, April 29
Graphical User Interfaces	9.5 - 9.10, 10.9 - 10.11	Final Exam	Thursday, May 7, 9:00 a.m.
Lab Exam I	Wednesday, March 18