AP Computer Science --- Haas --- Grading and Outline
New Paltz Central High School
New Paltz Central School District, 196 Main Street, New Paltz NY 12561
(845) 265-4100
Instructor: Joseph M Haas
Email: jhaas1@hvc.rr.com
Phone: (845) 265-4175 ext. 1251
Welcome to AP Computer Science
Textbook: Horstmann: Computing Concepts with Java Essentials, 3rd Edition,
We will be using both the text, and the Study Guide
Chapter 1: Introduction
Computer Components, Hello World, The main Method, Compiling,
Syntax and Logic Errors, Escape Sequence
Chapter 2: An Introduction to Objects and Classes
Object and Class intro, Object Variables, Instance Field, Constructors and Methods,
overloading, Implicit and Explicit Method Parameters
Chapter 3: Fundamental Data Types
int and double, Constants final, Mathematical Functions, Calling Static Methods,
Strings, Reading Input, Type Conversion
Chapter 5: Decisions
The if Statement, Comparing Values, Multiple Alternatives, Using Boolean Expressions
Chapter 6: Iteration
while Loops, for loops, Nested Loops, Processing Sentinel Values,
Random Numbers and Stimulations
Chapter 7: Designing Classes
Choosing Classes, Cohesion and Coupling, Accessors, Mutators, and Immutable Classes,
Side Effects, Preconditions and Postconditions, Static Methods
Static Fields, Scope, Packages
Chapter 8: Testing and Debugging
Unit Tests, Test Case Evaluation, Regression Testing, Program Traces and Assertions
Chapter 9: Interfaces and Polymorphism
Using Interfaces of Code Reuse, Converting Between Class and Interface Types,
Polymorphism
Chapter 11: Inheritance
An Introduction to Inheritance,
Inheritance Hierarchies, Inheritance Instance Fields and Methods,
Subclass Construction, Converting between Subclass and Superclass Types,
Access Control, Object: The Cosmic Superclass
Chapter 13: Array Lists and Arrays
Arrays, Arrays Lists, Auto-Boxing, For Each Loop, Simple Array Algorithms,
Two-Dimensional Arrays, Copying Arrays
Chapter 14: Exception Handling
Introduction to Exceptions,
Understanding Unchecked Exceptions
Chapter 17: Recursion
Triangle Numbers, Permutations, Recursive Helper Methods, Mutual Recursions,
The Efficiency of Recursion
Chapter 18: Sorting and Searching
Selection Sort, Profiling the Selection Sort Algorithm,
Analyzing the Performance of the Selection Sort Algorithm,
Merge Sort, Analyzing and Merge Sort Algorithm, Searching, Binary Search,
Sorting Real Data
The Case Study
Gridworld
Grades
Grades will be determined from a combination of Homework, Class Work, Quizzes, Tests, and Projects.
Each assignment will be given a specific point value. Your average can be determined at any time
by adding up the number of points earned and dividing by the total number of possible points.
IMPORTANT: All assignments for this class will be posted in this room by student number.
The list will be updated weekly. It is the responsibility of the student to check the list
periodically to make sure that all assignments are complete.
It is your responsibility to get all missing assignments upon returning from an absence.