Computer Science A emphasizes object-oriented programming methodology with an emphasis on problem solving and algorithm development and is meant to be the equivalent of a first-semester course in computer science. It also includes the study of data structures and abstraction.

This course covers the following topics:

  1. Object-Oriented Program Design

The overall goal for designing a piece of software (a computer program) is to correctly solve the given problem. At the same time, this goal should encompass specifying and designing a program that is understandable, can be adapted to changing circumstances, and has the potential to be reused in whole or in part. The design process needs to be based on a thorough understanding of the problem to be solved.

  1. Program Design
  2. Class Design
  1. Program Implementation

The overall goals of program implementation parallel those of program design. Classes that fill common needs should be built so that they can be reused easily in other programs. Object-oriented design is an important part of program implementation.

  1. Implementation techniques
  2. Programming constructs
  3. Java library classes (included in the AP Java subset)
  1. Program Analysis

The analysis of programs includes examining and testing programs to determine whether they correctly meet their specifications. It also includes the analysis of programs or algorithms in order to understand their time and space requirements when applied to different data sets.

  1. Testing
  2. Debugging
  3. Understand and modify existing code
  4. Extend existing code using inheritance
  5. Understand error handling
  6. Reason about programs
  7. Analysis of algorithms
  8. Numerical representations and limits
  1. Standard Data Structures

Data structures are used to represent information within a program. Abstraction is an important theme in the development and application of data structures.

  1. Simple data types (int, boolean, double)
  2. Classes
  3. Lists
  4. Arrays
  1. Standard Algorithms

Standard algorithms serve as examples of good solutions to standard problems. Many are intertwined with standard data structures. These algorithms provide examples for analysis of program efficiency.

  1. Operations on data structures previously listed
  2. Searching
  3. Sorting
  1. Computing in Context

An awareness of the ethical and social implications of computing systems is necessary for the study of computer science. These topics need not be addressed in detail but should be considered throughout the course.

  1. System reliability
  2. Privacy
  3. Legal issues and intellectual property
  4. Social and ethical ramifications of computer use

For more detail on the course topics covered in Computer Science A, see the Course and Exam Description.

Links to More AP Pages

Did you just take the PSAT/NMSQT?

If you did, it can help you find the courses that are the best fit for you.

Visit My College QuickStart (Opens in new window)
Course not offered at your school?

Talk to your counselor about taking the course online through an approved provider.

Learn how to get started