AP computer science (thing)

Advanced Placement Computer Science is currently offered in two forms, A and AB. Computer Science A focuses on methodology, problem solving, and algorithm development. It is roughly equivalent to a single semester of university-level CS. The A level course briefly touches upon data structures and abstraction. Computer Science AB includes all the topics of Computer Science A, but its study of algorithms, data structures, and data abstraction has more depth and detail than that of the A course. Topics exclusive to Computer Science AB include binary trees, the use of recursive data structures, and dynamically allocated structures.

Topic Outline

Asterisks indicate topics covered in the AB course only.

• Problem definition
• Specification of purpose and goals
• Identification of objects and classes (abstract data types)
• Identification of class responsibilities (operations on abstract data types)
• Program design
• Design of user/client interface
• Choice of data structures and algorithms
• Function decomposition
• Identification of reusable components from existing code

• Implementation techniques
• Methodology
• Object-based development
• Top-down development
• Use of abstraction
• Abstract data types (using encapsulation and information technology)
• Procedural abstraction
• Programming constructs
• Declaration
• Constant declarations
• Variable declarations
• Class declarations
• Function declarations
• Parameter declaration
• Value
• Reference
• Constant reference
• Input and Output
• Interactive
• Files
• Control
• Sequential
• Conditional
• Repetition
• Iteration
• Recursion
• Functions (including member functions)
• Generic data types and functions
• AP classes
• Templates*

• Testing
• Testing classes and modules in isolation
• Identifying boundary cases and generating appropriate test data
• Integration testing
• Debugging
• Categorizing errors: compile-time, run-time, logic
• Identifying and correcting errors
• Techniques: using a debugger, adding extra output statements, hand-tracing
• Understanding and modifying existing code
• Handling errors - robust behavior
• Reasoning about programs
• Pre/post conditions
• Assertions
• Invariants*
• Analysis of algorithms
• Informal comparisons of running times
• Exact calculation of statement execution counts
• Big-Oh notation*
• Worst case]/average case time and space analysis*
• Numerical limits

• Simple data types (e.g. int, char, bool, double, strings)
• Aggregate data types
• Heterogeneous (structs)
• Homogeneous (arrays)
• Classes
• Linked lists*
• Stacks*
• Queues*
• Trees*
• Heaps*
• Priority queues*

• Operations on data structures
• Traversals
• Insertion
• Deletion
• Operations on dynamic data structures*
• Traversals*
• Insertion*
• Deletion*
• Allocation/deallocation of memory*
• Searching
• Sequential (linear)
• Binary
• Hashing*
• Sorting
• Selection
• Insertion
• Mergesort merge algorithm
• Quicksort partition algorithm
• Heapsort*

• Major hardware components
• Primary and secondary memory
• Processors
• Peripherals
• System software
• Language translators
• Separate compilation
• Operating systems
• Types of systems
• Single-user systems
• Networks
• Responsible use of computer systems
• System reliability
• Privacy
• Legal issues and intellectual property
• Social and ethical ramifications of computer use

C++ has traditionally been the programming language of choice for AP Computer Science, but the program will switch to Java beginning in the 2003-2004 academic year. For more information about APCS, visit http://www.collegeboard.org/ap/students/compsci/.

Back to Advanced Placement Metanode.