AP Computer Science A

Variables, expressions, casting, calling methods, creating objects, and working with String and Math.

• Introduction to algorithms, programming and compilers
• Variables and data types
• Expressions and output
• Assignment statements and input
• Casting and range of variables
• Compound assignment operators
• Application program interface (API) and libraries
• Documentation with comments
• Method signatures
• Calling class methods and the Math class
• Objects: instances of classes
• Object creation and storage (instantiation)
• Calling instance methods
• String manipulation

• Data types in Java
• Arithmetic operators
• Parameters and arguments
• Search in a String: indexOf, contains, startsWith

if statements, Boolean logic, while and for loops, nested loops and standard string algorithms.

• Algorithms with selection and repetition
• Boolean expressions
• if statements
• Nested if statements
• Compound Boolean expressions
• Comparing Boolean expressions (De Morgan's laws)
• while loops
• for loops
• Implementing selection and iteration algorithms
• Implementing string algorithms
• Nested iteration
• Informal run-time analysis

• The else-if ladder
• Logical operators: &&, || and !
• The for loop
• Nested loops and star patterns

Designing and writing your own classes with instance variables, constructors, methods, scope and this.

• Abstraction and program design
• Impact of program design
• Anatomy of a class
• Constructors
• Methods: how to write them
• Methods: passing and returning references of an object
• Class variables and methods (static)
• Scope and access
• this keyword

• Classes: the blueprint of objects
• Constructors with parameters
• Getters and setters
• Static variables

Arrays, ArrayList, 2D arrays, text files, wrapper classes, searching, sorting and recursion: the largest part of the exam.

• Ethical and social issues around data collection
• Introduction to using data sets
• Array creation, access and traversals
• Implementing array algorithms
• Using text files
• Wrapper classes (Integer and Double)
• ArrayList methods and traversals
• Implementing ArrayList algorithms
• 2D array creation, access and traversals
• Implementing 2D array algorithms
• Searching algorithms (linear and binary search)
• Sorting algorithms (selection and insertion sort)
• Recursion
• Recursive searching and sorting (merge sort)

• Looping through an array
• ArrayList: add, get, set, remove
• 2D arrays: rows and columns
• Merge sort

The four free-response questions and how to earn marks on each.

• Question 1: Methods and Control Structures
• Question 2: Class Design
• Question 3: Data Analysis with ArrayList
• Question 4: 2D Array
• Reading the question and the method headers
• Using the Java Quick Reference
• Writing without autocomplete in the digital editor

Covered in 1:1 mentoring sessions

Multiple-choice technique, timing and a plan for the weeks before the May exam.

• Structure of the exam: 42 multiple-choice questions and 4 free-response questions
• Tracing code and predicting output
• Spotting compile-time and logic errors
• Time management in the digital exam app
• Past-paper style practice
• A revision calendar

Covered in 1:1 mentoring sessions