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

Schedule        Announcements and Clarifications

Score Posting

Links

Lecture Section 1:  Owen 101   MWF 12:00-12:50
Instructor
(contact info)		 Prof. Timothy A. Budd
Office Hours MWF 2:30-3:30, Dearborn 218
Recitations Section 3:  Tues    9:30 - 10:20 in Owen 101 (Hess)
Section 4:  Tues    11:30 - 12:20 in Owen 106 (Walther-Fisher) 
Section 5:  Tues    12:30 - 1:20 in Bat 250 (Hess)
Teaching Assistants

Office hours in Hovland 108

 Peregrine Walther-Fisher, walther@cs.orst.edu, 2-3MWF
Rob Hess, hess@cs.orst.edu, T 10:30-12:20, Th 3-4
Prerequisites CS 161, MTH 231
Textbook Horstmann, Cay, Big Java, Wiley, 2002
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.
Schedule Check here every week; the schedule is subject to "adjustments"
Grades
  • 5 homework sets @ 3.0% 
  • 6 programming projects @ 6.25% 
  • 3 quizzes @ 5.0% 
  • 2 midterm exams @ 12.5% (in class) 
  • Final exam  (Thursday, March 17, 6PM Owen 101)
Final grades are based on the accumulated percentage.  See the evaluation criteria and grading scale.  Percentages associated with quiz, exam, and final grades may be adjusted linearly if it seems appropriate, or if the number of items changes (e.g., we have fewer quizzes).
  • approx 15% 
  • approx 25% 
  • approx 15% 
  • approx 25% 
  • approx 20%

    •  

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