CS 162: Introduction to Computer Science II, Summer 2008

• Announcements
• Assignments
• Schedule
• Resources
• Course Details
• Course Objectives
• Academic Dishonesty
• Accomodations
• Exams
• Grading
• TEACH

Announcements

• 8/4/2008: Assignment 5 posted
• 7/28/2008: Assignment 4 posted
• 7/22/2008: Assignment 3 posted
• 7/2/2008: Added recitation 2
• 7/2/2008: Assignment 2 posted
• 6/30/2008: Added recitation 1
• 6/27/2008: Assignment 1 posted
• 6/26/2008: Schedule updated: Added possible schedule for week 2 - week 8
• 6/24/2008: Assignment 0 posted
• 6/23/2008: Class webpage up running

Assignments

Assignment 0 (Due on Friday, June 27 @ 11:59pm)

Assignment 1 (Due on Monday, July 7 @ 11:59pm)

Assignment 2 (Due on Monday, July 14 @ 11:59pm)

Assignment 3 (Due on Monday, July 28@ 11:59pm)

Assignment 4 (Due on Monday, Aug 4 @ 11:59pm)

Assignment 5 (Due on Monday, Aug 11 @ 11:59pm)

Schedule

	Date	Topics	Textbook	Due
Week 1	6/23/2008	First lecture (syllabus)
	6/24/2008	Recitation (optional)
	6/25/2008	Java Review - Java Fundamentals Review (PDF) - Coding Conventions (PDF)
	6/26/2008	Object Oriented Programming - OOP I (PDF) - OOP II (PDF)	Chapter 8
	6/27/2008	No Class		Assignment 0 Due at 11:59pm
Week 2	6/30/2008	Classes - Classes I (PDF) - Classes II (PDF)	Chapter 8
	7/1/2008	Recitation: Debugging (PDF) - Eclipse Tricks (PDF) - SyllableCounter.java - Word.java
	7/2/2008	Inheritance (PDF)	Chapter 10
	7/3/2008	Abstract Classes & Interfaces - Abstract Classes (PDF) - Interfaces (PDF) - Using Interface for Code Reuse (PDF)	Chapter 9, 10
	7/4/2008	Holiday - Independence Day
Week 3	7/7/2008	Exceptions and Exception Handling (PDF)	Chapter 11	Assignment 1 Due at 11:59pm
	7/8/2008	Recitation: Exceptions (PDF) - MyGrid.java - grid.txt Optional: GUI and Event Handling (PDF) - MyFrame.java - MyFrameViewer.java
	7/9/2008	Object Oriented Design (PDF) Polymorphism (PDF)	Chapter 9, 12
	7/10/2008	Class Cancelled
	7/11/2008	Help Session: Assignment 2
Week 4	7/14/2008	Inheritance Summary (PDF)	Chapter 8, 12	Assignment 2 Due at 11:59pm
	7/15/2008	Recitation: Practice Midterm (Solution)
	7/16/2008	Testing - Testing I (PDF) - Testing II (PDF)
	7/17/2008	Midterm Exam
	7/18/2008	No Class
Week 5	7/21/2008	JUnit (PDF)
	7/22/2008	Recitation: JUnit - Animal.java - Slug.java - MutantSlug.java
	7/23/2008	Recursion - Recursion I (PDF) - Recursion II (PDF) - Recursion III (PDF)	Chapter 13
	7/24/2008
	7/25/2008	No Class
Week 6	7/28/2008	Big O (PDF)		Assignment 3 Due at 11:59pm
	7/29/2008	Recitation: Recursion
	7/30/2008	Sorting & Searching - Sorting (PDF) - Sorting & Searching (PDF)	Chapter 14
	7/31/2008	Arrays, ArrayLists, Iterators (PDF)	Chapter 15
	8/1/2008	No Class
Week 7	8/4/2008	Linked Lists - Linked List I (PDF) - Linked List II (PDF)	Chapter 15	Assignment 4 Due at 11:59pm
	8/5/2008	Recitation: Linked Lists - MyLinkedList.java
	8/6/2008	Abstract Data Types (PDF)	Chapter 15
	8/7/2008	ADT Implementation: Stack (PDF)
	8/8/2008	No Class
Week 8	8/11/2008	ADT Implementation: Queue (PDF)		Assignment 5 Due at 11:59pm
	8/12/2008	STUDY
	8/13/2008	Recitation: Practice Final
	8/14/2008	Final Exam
	8/15/2008	No Class

Resources

Course Syllabus

Getting started with Eclipse

Java Fundamentals Review

Coding Conventions

Recitation Extra.01: GUI and Event Handling

Course Details

Instructor	HonHung Tang
Email	tangho [at] eecs
Office	KEC 3130
Office Hours	MTWR 11:50-12:30, Dear 115
Lectures	MWR 11-11:50, Roger 230
Recitation	T 11:15-11:50, Dear 115
Mailing List	cs162-su08@engr.oregonstate.edu
Textbook	Big Java, 2nd/3rd edition by Cay Horstmann, Wiley 2007 ISBN #978-0-470-10554-2

Course Learning Objectives

1. Develop programs that require (1) the uses of multiple classes and structures and (2) the understanding of abstraction, modularity, separation of concerns, and exception handling

2. Classify moderately complicated algorithms in these complexity classes: O(1), O(log n), O(n), O(n log n), O(n^2)

3. Develop test data sets and testing plans for programming projects

4. Produce recursive algorithms

Accomodations

Students with documented disabilities who may need accommodations, who have any emergency medical information I should know, or who need special arrangements in the event of evacuation, should make an appointment with the instructor as early as possible (no later than the first week of the term). Class materials will be made available in an accessible format upon request. In order to arrange alternative testing, the student should make the request at least one week in advance of the test. Students seeking accommodations should be registered with the Office of Services for Students with Disabilities.

Academic Dishonesty

Honesty is absolutely essential in order for learning to take place. It will form the foundation of your professional integrity in your career. In homework and programming assignments, it is often difficult for a grader to distinguish between legitimate help and plagiarism. Therefore, you might be able to get a good score without really understanding what you have handed in.

Students are expected to do their own work unless assigned to a group by the instructor. If you are having trouble with an assignment, you are encouraged to verbally discuss general approaches and strategies with other students, or the instructor. Do not simply let someone else tell you how to solve the problem. If other students ask you for help, don't just let them copy your work. It is possible to discuss problems without plagiarizing.

Here is a list of things you are not allowed to:

• Use code from other students
• Use code from the Ineternet (unless explicitly allowed by the instructor).
• Give your code to other students.

The bottom line is: Students are expected to do their own work unless assigned to a group by the instructor. Eash student is expected to understand all aspects of the programs he/she submits for credits.

For specifics on academics honesty, I will refer you to the university academic dishonesty policy and the department academic dishonesty policy.

Exams

Exams are closed book, closed notes unless stated otherwise by the instructor.

Grading

• 40% Programming Assignments
• 10% Recitation, Written Homework
• 20% Midterm
• 30% Final

Your course grade will be weighted as above.