(also called '''APCS''') is the name of two distinct Advanced Placement courses and examinations offered by the College Board to High School students as an opportunity to earn college credit for a College -level Computer Science course. '''AP Computer Science A''' is meant to be the equivalent of a first-semester course in computer science, while '''AP Computer Science AB''' equates to a full year. The AP exam currently tests students on their knowledge of Java .
emphasizes Object-oriented Programming methodology with an emphasis on problem solving and Algorithm development. It also includes the study of data structures and abstraction, but these topics are not covered to the extent that they are covered in AP Computer Science AB.
includes all the topics of AP Computer Science A, as well as a more formal and a more in-depth study of Algorithms , Data Structures , and Data Abstraction . For example, Binary Trees are studied in AP Computer Science AB but not in AP Computer Science A. The use of Recursive data structures and Dynamically Allocated structures is fundamental to AP Computer Science AB.
- Object-Oriented Program Design
- ---Problem Design
--Read and understand a problem's description, purpose, and goals.
--Specify the purpose and goals for a problem. (AB only)
--Apply Data Abstraction and encapsulation.
--Read and understand class specifications and relationships among the classes (" Is-a ", " Has-a " relationships).
--Decompose a problem into classes, define relationships and responsibilities of those classes. (AB only)
--Understand and implement a given class hierarchy.
--Identify reusable components from existing code using classes and class libraries.
- ---Class Design
--Design and implement a class.
--Design and implement a set of interacting classes. (AB only)
--Design an interface.
--Choose appropriate data representation and algorithms.
--Choose appropriate advanced data structures and algorithms. (AB only)
--Apply functional decomposition.
--Extend a given class using inheritance.
- Program Implementation
- ---Implementation techniques
-- Methodology
- Object-oriented development
- Top-down Development
-Encapsulation and information holding
-Procedural Abstraction
- ---Programming constructs
-- Primitive Types vs. Objects
-- Declaration
- Constant declarations
- Variable declarations
- Class declarations
- Interface declarations
- Method declarations
- Parameter declarations
-- Console Output (System.out.print/println)
-- Control
-Methods
- Sequential
- Conditional
- Iterations
- Recursion
- ---Java library classes (included in the A or AB-level AP Java Subset)
- Program Analysis
- --- Testing
--Test classes and libraries in isolation
--Identify boundary cases and generate appropriate test data
--Perform integration testing
- --- Debugging
--Categorize errors: Compile Time , runtime, Logic
--Identify and correct errors
--Techniques: use a debugger, add extra output statements, hand-trace code
- ---Understand and modify existing code
- ---Extend existing code using inheritance
- ---Understand Error Handling
--Understand runtime exceptions
--Throw runtime exceptions (AB only)
- ---Reason about programs
-- Precondition s and Postcondition s
-- Assertions
-- Invariants (AB only)
- ---Analysis of algorithms
--Informal comparisons of running times
--Exact calculation of statement execution counts
-- Big-O Notation (AB only)
-- Worst-case And Average-case time and Space Analysis (AB only)
- ---Numerical representations and limits
--Representations of numbers in different Bases
--Limitations of finite representations (e.g., Integer bounds, imprecision of Floating-point representations, and Round-off Error )
- Standard Data Structures
- ---Simple Data Types ( Int , Boolean , Double )
- --- Classes
- ---One-dimensional Arrays
- ---Two-dimensional arrays (AB only)
- --- Linked Lists (singly, doubly, circular) (AB only)
- --- Stacks (AB only)
- --- Queues (AB only)
- --- Trees (AB only)
- --- Heaps (AB only)
- --- Priority Queues (AB only)
- --- Sets (AB only)
- --- Maps (AB only)
- Standard Algorithms
- ---Operations on data structures listed above
--Traversals
--Insertions
--Deletions
-- Iterators (AB only)
- --- Searching
-- Sequential
-- Binary
-- Hashing (AB only)
- --- Sorting
-- Selection
-- Insertion
-- Mergesort
-- Quicksort (AB only)
-- Heapsort (AB only)
- Computing in Context
- ---Major hardware components
-- Primary and Secondary memory
-- Processors
-- Peripherals
- ---System software
--Language translators/ Compilers
-- Virtual Machines
-- 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
The AP exam currently tests students on their knowledge of Java . From 1999 to 2003, the exam tested students on their knowledge of C++ instead. Before 1999, the AP exam tested students on their knowledge of Pascal .
Although there are two AP Computer Science tests (A and AB), the format for both is exactly the same, composed of two sections:
The Marine Biology Simulation Case Study is intended to be a substitute for writing a single large program as a culminating project. Due to obvious time restraints during the exam, the Marine Biology Simulation is provided by the College Board {Link without Title} to students prior to the exam. They are expected to be familiar with the classes and interfaces (and how they interact) before taking the exam. The case study is divided into five sections, the last of which is only tested on the AB exam.
Roughly five multiple-choice questions in Sections I are devoted to the MBSCS, and it is the topic of one free response question in Section II.
In the 2006 administration, 14,662 students took the exam from 2,101 schools. The mean score was a 2.91. The grade distribution for 2006 was:
In the 2006 administration, 4,939 students took the exam from 1,144 schools. The mean score was a 3.38. The grade distribution for 2006 was:
|
