CS 162 (4 credits)
Introduction to Computer Science II
Spring 2005
| Lecture | Section 1: Cord 1109 MWF 9:00-9:50 (3/28/05 - 6/3/05) | |
| Instructor |
Prof. Timothy A. Budd (contact info) | |
| Office Hours | MWF 10:00-11:30, Dearborn 218 | |
| Recitations |
Section 5: Tues 8:30 - 9:20 in App 306
Section 6: Tues 9:30 - 10:20 in App 306 Section 7: Tues 11:30 - 12:20 in Covl 218 Section 8: Tues 12:30 - 1:20 in Covl 218 |
|
| Teaching Assistants | Peregrine Walther-Fisher, walther@eecs.oregonstate.edu (MWF 11-12 in Hovland 108)
Cory Kissinger, ckissin@eecs.oregonstate.edu (T-Th 1:30-3:00 in Dearborn 119) |
|
| Prerequisites | CS 161, Math 231 | |
| Textbook | Horstmann, Cay, Big
Java, Wiley, 2002 (This term either 1st or 2nd edition is fine) |
|
| 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"
In the past I have used a series of power-point lectures. This term I am going to be trying something different, this is admittedly experimental. I will evaluate the success of this approach as the term progresses, and adjust the schedule as necessary. | |
| Communication | There is a class mail list established for this course. I will use this to send
e-mail to the entire class where appropriate. You can also use this as you wish, simply
by sending e-mail to class-cs162@engr.oregonstate.edu.
There is also a web-based form you can use if you want to send anonymous e-mail to the professor. There is no way that mail generated from this source can be traced back to an individual. |
|
| Grades | There will be a number of homework sets, programming assignments, two midterm exams, and a final. The grades for these will be weighted so that the homework is about half of the final grade, and the exams the remaining half | |
| Academic Honesty Policy | See the university,
college,
department,
and course policies. Obviously, compliance is expected. |
|