CS 162   (4 credits)
Introduction to Computer Science II
Fall 2006

Score Posting        Calendar        Programming Assignments       Example Code      Policies

Announcements:

12/09/2006  Final exam scores and term letter grades are posted.

12/01/2006  Quiz #4 scores are posted
11/29/2006  Program #3 scores are posted
11/29/2006  Quiz #4 (optional) today in class
11/21/2006  Program #4 is posted. Click here to get the startup files.

11/20/2006  Program #3 is due tonight before midnight
11/17/2006  Quiz #3 scores are posted
11/13/2006  Quiz #3 in class Wednesday, November 15
11/09/2006  Program #2 scores are posted
11/08/2006  The due date for Program #3 is Monday, November 20
11/06/2006  Midterm Exam #2 scores are posted.
11/03/2006  Midterm Exam #2: Today in class
10/30/2006  Project #2 is due tonight before midnight.
10/25/2006  Example code from lectures (click the link above).
10/20/2006  Be sure to download UnboundedEnv.java and import it into your Program #2 project.
10/20/2006  Program #1 scores are posted.
10/20/2006  Quiz #2 is postponed to Wednesday, October 25.
10/16/2006  Midterm #1 scores are posted
10/05/2006  Recitation section 012 has moved to Wiegand 106
10/04/2006  Quiz #1 in class Wednesday, October 4
10/03/2006  Project #1 is posted on the Assignments page.
09/29/2006  Craig Furtado replaces Ray Lin as TA.
09/25/2006  Recitation sections do not meet this week.

Lecture

Section 1:  Owen 101   MWF 10:00 - 10:50

Instructor

Contact info and Office hours

Paul D. Paulson

Office Hours

M  2:00 - 4:00 pm
W  2:00 - 5:00 pm

   other days/times by appointment

Recitations (weeks 2 - 10)

Section 012:  T    11:30 - 12:20 in Wiegand 106
Section 013:  T    12:30 - 13:20 in Weniger 287

Teaching Assistants

Contact info and Office hours

Chaitanya Komireddy

Craig Furtado

Prerequisites

CS161, MTH231 or ECE271

Textbook
(required)

Horstmann, Cay, "Big Java", 2nd edition, Wiley, 2006
ISBN # 0-471-69703-6
 

Course Learning Objectives

  1. Develop programs that require
    • the use of multiple classes and structures
    • the understanding of abstraction, modularity, separation of concerns, and exception handling
  2. Classify moderately complicated algorithms in these complexity classes: O(1) O(logn), O(n), O(nlogn), O(n²).
  3. Develop test-data sets and testing plans for programming projects.
  4. Produce recursive algorithms.

Calendar

Check here every week; the calendar is subject to "adjustments"

Grades

  • Homework ("recommended activities")
  • Class/recitation/lab work
  • 4 programming projects @ 6.25%
  • 3 quizzes @ 5.0%
  • 2 midterm exams @ 17.5% (in class)
  • Final exam  (Wednesday, Dec. 6, 2:00 pm, Owen 101)

Final grades are based on the accumulated percentage.  See the evaluation criteria and grading scale.  Quiz, exam, and final grades may be adjusted linearly if it seems appropriate.

  • 0%
  • 5%
  • 25%
  • 15%
  • 35%
  • 20%



Academic Honesty Policy See the university, college, department, and course policies.
Obviously, compliance is expected.