Introduction to Computer Science II
Spring 2008

Class # 0203-112-01

Time: MWF  9:40 a.m. - 11:25 a.m.

Location:
HR 235

Professor: David Galles
Office: HR 542
Office Hours:   T 10-12, R 2-3
                        Though these are my stated office hours, I am in my offices most of the day.
                        If my door is open (and it usually is), I am happy to talk with students.
                   

Phone: 422-5951
Email:
galles@usfca.edu

TA: Erli Ling

Textbook:  Java Software Solutions, 5th Edition,  Lewis & Loftus

Prerequisites:
Computer Science 110, Introduction to Computer Science I

Test Dates:

Test Weight Test Date
Programming Projects
40%
Weekly (more or less)
Programming Labs
10%
Weekly (more or less)
Midterm #1 12% 3/12/2008
Midterm #2 12% 4/21/2008
Final: 26% 5/12/2008 (Monday) 3:30 p.m.

Finals and Midterms:
Both midterms and the final will be closed notes.

Labs and Projects:
You must turn in hardcopy printouts of the source files for your projects, at the beginning of class on the due date. In addition, your source code needs to be in your subversion repository by the due date.

Late Policy:
Late projects will be accepted on the next class meeting after the due date for up to 75% credit. Projects will not be accepted later than one class meeting after the deadline. After 9:40 a.m. is considered late (In other words, do not skip class to finish an assignment.)

Grading:
Grades will be assigned on a straight scale, with Approximately

90-100% A
80-89% B
70-79% C
60-69% D
0-59% F

A 90% will ensure at least an A-, an 80% will ensure at least a B-, and so on. 

Attendance:

Students are expected to attend class. Topics that are discussed in class but are not in the text are fair game for the midterms and final.  While I will make an effort to make as much of the class material as possible available online, there will likely be some information that you will only be able receive by attending class.  Also, class time will give your valuable hands-on time to work on labs and projects.

Academic Honesty

(Academic Honesty Requirements adaptad from S. Rollins)

ALL assignments are to be completed individually unless specified, in writing, on the assignment. Academic dishonesty will NOT be tolerated. This is your warning! Students are encouraged to meet with me if they have questions regarding assignments or this policy. Students caught cheating will face severe penalty.

Students may: Students may NOT: Requirements Penalties Learning Outcomes:

Students who complete this course will be able to
design and program medium-scale programs, using:
  1. Inheritance and Polymorphism
  2. Interfaces
  3. Exception Handling
  4. Recursion
  5. Linked Structures
  6. Basic software design patterns, including iterators