CS162 - Introduction to Computer Science II - Summer 2009

Objectives

1. Design and implement programs that require a) multiple classes and structures b) hierarchies of classes that use inheritance and polymorphism and c) an understanding of abstraction, modularity, separation of conerns, and exception handling.
2. Construct and use basic linear structures (arrays, stacks, queues, and various linked lists) in programs, and be able to describe instance 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.

Accommodations

Accommodations are collaborative efforts between students, faculty and Services for Students with Disabilities (SSD). Students with accommodations approved through SSD are responsible for contacting me prior to or during the first week of the term to discuss accommodations. Students who believe they are eligible for accommodations but who have not yet obtained approval through SSD should contact SSD immediately at 737-4098.

Academic Dishonesty

See the OSU policy, the College of Engineering policy, and the Computer Science policy. All three policies apply. In addition:

Programming assignments in this course are considered Take Home Programming Tests. You must do your own work, entirely.

• You are permitted to discuss the meaning of assignments, general approaches and strategies.
• You may not share code, pseudocode, or documentation of any kind.
• You may not ask another student for help debugging your code.
• You may not use code from any other source, including the Internet.

We use plagiarism-detection software running at Stanford called Moss to check your code against the code from other students in the class and previous versions of this course. It is quite sophisticated and can easily see through variable name changes and formatting differences. You can read the paper on how this works here.

Grading

The following is a tentative breakdown of how you will be evaluated in this course.

• 40% Programming Assignments
• 30% Midterms
• 30% Final

You have one week after an exam or project has been returned to question a grade you receive. Exams and coursework are not regraded past this deadline.

Programming Assignments

• Must be submitted by 11:59pm on the due date using the ENGR submission site (TEACH).
• Include all source files when you submit. Do not include .class files or executables.
• Include a comment at the top of all of your source files that contains your name.
• Should also be copied to your ENGR or other OSU account before the deadline. If you accidentally submit the wrong files through TEACH, we will not accept any part of your assignment unless it is timestamped in your ENGR or ONID account.

You are permitted one late assignment, which is allowed to be a maximum of two late days without penalty. This means that if an assignment is due on October 7 at 11:59pm, you may turn it in as late as October 9 at 11:59pm without penalty. If your late assignment is handed in later than 48 hours beyond the due date, it will be given a grade of 0. You may use this freebie on any assignment but you are allowed to use it for only one assignment. Other late assignments will be given a grade of 0.