CS 162 (4 credits)
Introduction to Computer Science II
Summer 2006
(June 26th - August 18th)

Schedule           Assignments        Announcements

Lecture Lecture Hall: ROG 230  Timings MTWRF 1100-1150
Instructor (email)

Chaitanya Komireddy
Office Hours in Kelley Atrium

TWF  12:00 - 1:00 pm
other times by appointment
Prerequisites CS161, MTH231
Textbook (required) Horstmann, Cay, "Big Java", 2nd edition, Wiley, 2006
ISBN # 0-471-69703-6
Course Objective 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.

Calender

 Check here every week; the calendar is subject to "adjustments"
Course Policy / Syllabus

    Course Policy - Syllabus       

Academic Honesty See the university, college, department, and course policies.

Grades

 

  • 4 programming projects @ 8.75%
  • 5 quizzes @ 2.0%
  • 2 midterm exams @ 17.5% (in class)
  • Final exam  (Wednesday, Aug 15 9:30 am, Roger )

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.

 

  • 35%
  • 10%
  • 35%
  • 20%