CS 162   (4 credits)
Introduction to Computer Science II
Spring 2012

Calendar        Assignments       Scores        Resources        Course Policies

Announcements:

Structure Three 50-minute lectures per week, and one 110-minute laboratory per week

Lecture

 MWF   9:00 - 9:50                         CORD 1109

Instructor

 Paul D. Paulson      Contact info and Office hours

Lab
Dearborn 302
  • Section 002:  T  4:00 - 5:50 pm  (Head TA: Cal Cohen)
  • Section 003:  W  6:00 - 7:50 pm  (Head TA: Matt Unrath)
  • Section 005:  R  8:00 - 9:50 am  (Head TA: Mikkel Kringelbach)
  • Section 006:  R  10:00 - 11:50 am  (Head TA: Erich Merrill)
  • Section 007:  T  12:00 - 1:50 pm  (Head TA: Matt Unrath)
  • Section 008:  T  10:00 - 11:50 am  (Head TA: Ben Zoon)

Teaching Assistants

TAs / email:

  • Cal Cohen                   (email)
  • Spencer Forell            (email)
  • Sebastian Immel         (email)
  • Mikkel Kringelbach   (email)
  • Erich Merrill               (email)
  • Matt Unrath                (email)
  • Ben Zoon                     (email)

TA Office Hours

Prerequisites

 CS 161 and MTH 231*  (* concurrent enrollment in MTH 231 permitted)
Courses that require CS 162 as a prerequisite: CS 261, CS 275

Textbook
(required)

Walter Savitch, Java: An Introduction to Problem Solving and Programming 6/e, Addison-Wesley, 2011, ISBN:
Choose one:
   * paperback version: ISBN #978-0-13-216270-8
   * digital version: ISBN #978-0-13-216272-2
 

Course Learning Objectives

At the completion of this course, students will be able to:

  1. Design and implement programs that require
    • multiple classes, structures
    • hierarchies of classes that use inheritance and polymorphism
    • an understanding of abstraction, modularity, separation of concerns, and exception handling
  2. Construct and use basic linear structures (arrays, stacks, queues, and various linked lists) in programs, and be able to describe instances appropriate for their use.
  3. Classify moderately complicated algorithms in these complexity classes: O(1), O(log n), O(n), O(n log n), and O(n²)
  4. Develop test-data sets and testing plans for programming projects
  5. Produce recursive algorithms, and choose appropriately between iterative and recursive algorithms.

Calendar

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

Grades
  • Homework/Classwork
  • 10 Labs @ 1.0%
  • 5 programming projects @ 5.0%
  • 3 quizzes @ 5.0%
  • 2 midterm exams @ 10.0% (in class)
  • Final exam (Tuesday, June 12, 12:00 - 1:50 pm)

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.
  • 10%
  • 10%
  • 25%
  • 15%
  • 20%
  • 20%
Academic Honesty Policy See the university, college, and course policies.