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

  Score Posting        Calendar        Programming Assignments        Announcements      Links        Policies

12/07/2005  Term grades are posted.

12/05/2005  The final exam scores are posted.  Final grades will be posted some time on Thursday.

Lecture

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

Instructor

 Paul D. Paulson    (contact info)

Office Hours

MW  11:00 am - 1:00 pm
F  11:00 am - 12:00 noon
   other times by appointment

Recitations (weeks 2 - 10)

 Section 012:  T    11:30 - 12:20 in Weatherford EG 01  (Deutschman email)
Section 013:  T    12:30 - 13:20 in Kidder 236  (Khare email)

Teaching Assistants

Office hours in Hovland 108

Stephanie Deutschman     MR 4:00 - 6:00 pm    email

Ankit Khare     T 4:00 - 6:00 pm,  W 12:00 noon - 1:00 pm    email

Prerequisites

 CS 161, MTH 231

Textbook
(required)

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

Course Learning Objectives

 1.  Design and implement programs that require the use of multiple classes and structures, requiring the understanding of abstraction, modularity, separation of concerns, and exception handling.
2.  Implement abstract data types using classes, objects, encapsulation, inheritance, and polymorphism.
3.  Determine the average-case and worst-case complexity for moderately complicated algorithms in these complexity classes: O(1), O(log n), O(n), O(n log n), and O(n2).
4.  Develop test-data sets and testing plans for programming projects.
5.  Given a problem specification, select the correct linear structure (array, stack, queue, singly-linked list, or doubly-linked list).  Given two linear structures, describe the relative advantages and disadvantages of each.
6.  Given intermediate-level problems involving repetition, choose appropriately between an iterative and recursive algorithm.  Describe the relative advantages and disadvantages of recursion versus iteration.

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  (Tuesday, Dec. 6, 9:30 am, 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.