APĀ® Computer Science A Prep Course

Self-paced prep for the APĀ® Computer Science A exam: 69 lessons, a quiz after every lesson, 55 interactive labs, and a full practice exam and a final exam, each with a written part and its scoring guide.

$19paid once

Or every APĀ® course for $29 a month, with every APĀ® study guide too.

Already bought it? Open your course

  • 69lessons
  • 69quizzes, one after every lesson
  • 55interactive labs
  • 2full exams with written parts

What's in the APĀ® Computer Science A course

12 chapters. Each lesson ends with a short quiz, and the course ends with a full practice exam and a final exam, each with a written part and its scoring guide.

Course OverviewFree preview
  1. FreeSyllabus
Chapter 1: Programs, Variables, and Data Types6 lessons, 6 quizzes, 6 labs
  1. Lesson1.1 Algorithms and Programs: how source code is compiled and run
  2. Lab1.1 Interactive Lab: Compile and Run Lab
  3. Lesson1.2 Variables and Data Types: int, double, boolean, and String
  4. Lab1.2 Interactive Lab: Declarations Lab
  5. Lesson1.3 Expressions and Output: arithmetic, integer division, and println
  6. Lab1.3 Interactive Lab: Division and Output Lab
  7. Lesson1.4 Assignment and Input: storing values and reading from a Scanner
  8. Lab1.4 Interactive Lab: Assignment and Input Lab
  9. Lesson1.5 Casting and Range: int overflow, truncation, and (double) casts
  10. Lab1.5 Interactive Lab: Casting and Range Lab
  11. Lesson1.6 Compound Assignment: +=, ++, and --
  12. Lab1.6 Interactive Lab: Compound Assignment Lab
Chapter 2: Libraries, Methods, and the Math Class5 lessons, 5 quizzes, 2 labs
  1. Lesson2.1 APIs and Libraries: reading documentation to use classes
  2. Lesson2.2 Documentation with Comments: preconditions and postconditions
  3. Lesson2.3 Method Signatures: names, parameters, and return types
  4. Lab2.3 Interactive Lab: Method Signatures Lab
  5. Lesson2.4 Calling Class Methods: static methods and the dot operator
  6. Lesson2.5 The Math Class: abs, pow, sqrt, and random
  7. Lab2.5 Interactive Lab: Math and Random Lab
Chapter 3: Objects and Strings5 lessons, 5 quizzes, 4 labs
  1. Lesson3.1 Objects and Classes: instances, state, and behavior
  2. Lesson3.2 Creating Objects: new, constructors, and reference storage
  3. Lab3.2 Interactive Lab: Reference Workshop
  4. Lesson3.3 Calling Instance Methods: accessors, mutators, and null
  5. Lab3.3 Interactive Lab: Method Call Workshop
  6. Lesson3.4 String Methods: length, substring, indexOf, and charAt
  7. Lab3.4 Interactive Lab: String Methods Workshop
  8. Lesson3.5 Comparing Strings: equals, compareTo, and common traps
  9. Lab3.5 Interactive Lab: Comparing Strings Workshop
Chapter 4: Boolean Expressions and Selection6 lessons, 6 quizzes, 5 labs
  1. Lesson4.1 Algorithms with Selection: choosing a path through code
  2. Lesson4.2 Boolean Expressions: relational operators and true or false values
  3. Lab4.2 Interactive Lab: Boolean Expression Workshop
  4. Lesson4.3 if Statements: one-way, two-way, and multi-way selection
  5. Lab4.3 Interactive Lab: If Statement Workshop
  6. Lesson4.4 Nested if Statements: dangling else and decision trees
  7. Lab4.4 Interactive Lab: Nested If Workshop
  8. Lesson4.5 Compound Boolean Expressions: and, or, not, and short-circuit evaluation
  9. Lab4.5 Interactive Lab: Short-Circuit Workshop
  10. Lesson4.6 Comparing Boolean Expressions: De Morgan's laws and truth tables
  11. Lab4.6 Interactive Lab: De Morgan Workshop
Chapter 5: Iteration7 lessons, 7 quizzes, 6 labs
  1. Lesson5.1 while Loops: conditions, counters, and infinite loops
  2. Lab5.1 Interactive Lab: while Loops Lab
  3. Lesson5.2 for Loops: initialization, test, update, and off-by-one errors
  4. Lab5.2 Interactive Lab: for Loops Lab
  5. Lesson5.3 Implementing Selection and Iteration Algorithms: sums, counts, min and max
  6. Lab5.3 Interactive Lab: Loop Algorithms Lab
  7. Lesson5.4 String Traversal Algorithms: scanning, counting, and reversing
  8. Lab5.4 Interactive Lab: String Traversal Lab
  9. Lesson5.5 Building Strings: substring loops and palindromes
  10. Lab5.5 Interactive Lab: Substrings and Palindromes Lab
  11. Lesson5.6 Nested Iteration: loops inside loops and pattern printing
  12. Lab5.6 Interactive Lab: Nested Loops Lab
  13. Lesson5.7 Informal Run-Time Analysis: counting statement executions
Chapter 6: Designing Classes9 lessons, 9 quizzes, 7 labs
  1. Lesson6.1 Abstraction and Program Design: breaking a problem into classes
  2. Lesson6.2 Impact of Program Design: ethics, society, and system reliability
  3. Lesson6.3 Anatomy of a Class: fields, constructors, and methods
  4. Lab6.3 Interactive Lab: Class Builder Workshop
  5. Lesson6.4 Constructors: initializing instance variables
  6. Lab6.4 Interactive Lab: Constructor Workshop
  7. Lesson6.5 Writing Methods: accessors, mutators, and return values
  8. Lab6.5 Interactive Lab: Methods Workshop
  9. Lesson6.6 Passing and Returning References: aliasing and parameters
  10. Lab6.6 Interactive Lab: Passing Objects Workshop
  11. Lesson6.7 Class Variables and Methods: static members
  12. Lab6.7 Interactive Lab: Static Members Workshop
  13. Lesson6.8 Scope and Access: private, public, and local variables
  14. Lab6.8 Interactive Lab: Scope and Access Workshop
  15. Lesson6.9 The this Keyword: shadowing and passing the current object
  16. Lab6.9 Interactive Lab: The this Keyword Workshop
Chapter 7: Arrays and Data Sets7 lessons, 7 quizzes, 5 labs
  1. Lesson7.1 Data Collection: ethical and social issues of data
  2. Lesson7.2 Using Data Sets: representing data in programs
  3. Lesson7.3 Array Creation and Access: indexes, length, and bounds errors
  4. Lab7.3 Interactive Lab: Arrays Lab
  5. Lesson7.4 Array Traversals: for loops and enhanced for loops
  6. Lab7.4 Interactive Lab: Traversals Lab
  7. Lesson7.5 Array Algorithms I: sum, average, min, max, and counting
  8. Lab7.5 Interactive Lab: Array Algorithms Lab
  9. Lesson7.6 Array Algorithms II: shifting, reversing, and swapping
  10. Lab7.6 Interactive Lab: Rearranging Arrays Lab
  11. Lesson7.7 Using Text Files: reading data with Scanner and File
  12. Lab7.7 Interactive Lab: Reading Files Lab
Chapter 8: ArrayList and Wrapper Classes6 lessons, 6 quizzes, 4 labs
  1. Lesson8.1 Wrapper Classes: Integer, Double, and autoboxing
  2. Lesson8.2 ArrayList Methods: add, get, set, remove, and size
  3. Lab8.2 Interactive Lab: ArrayList Lab
  4. Lesson8.3 ArrayList Traversals: loops and the remove-while-traversing trap
  5. Lab8.3 Interactive Lab: List Traversal Lab
  6. Lesson8.4 ArrayList Algorithms I: filtering and searching
  7. Lab8.4 Interactive Lab: Filter and Search Lab
  8. Lesson8.5 ArrayList Algorithms II: inserting, shifting, and building new lists
  9. Lab8.5 Interactive Lab: Insert and Rebuild Lab
  10. Lesson8.6 Arrays vs ArrayLists: choosing the right collection
Chapter 9: Two-Dimensional Arrays4 lessons, 4 quizzes, 4 labs
  1. Lesson9.1 2D Array Creation and Access: rows, columns, and length
  2. Lab9.1 Interactive Lab: Grid Basics Lab
  3. Lesson9.2 2D Array Traversals: row-major, column-major, and enhanced for
  4. Lab9.2 Interactive Lab: Grid Traversal Lab
  5. Lesson9.3 2D Array Algorithms I: row sums, column sums, and totals
  6. Lab9.3 Interactive Lab: Row and Column Sums Lab
  7. Lesson9.4 2D Array Algorithms II: neighbors, diagonals, and boundary checks
  8. Lab9.4 Interactive Lab: Neighbors and Toolbox Lab
Chapter 10: Searching, Sorting, and Recursion7 lessons, 7 quizzes, 7 labs
  1. Lesson10.1 Searching Algorithms I: sequential (linear) search
  2. Lab10.1 Interactive Lab: Linear Search Lab
  3. Lesson10.2 Searching Algorithms II: binary search on sorted data
  4. Lab10.2 Interactive Lab: Binary Search Lab
  5. Lesson10.3 Sorting Algorithms I: selection sort
  6. Lab10.3 Interactive Lab: Selection Sort Lab
  7. Lesson10.4 Sorting Algorithms II: insertion sort
  8. Lab10.4 Interactive Lab: Insertion Sort Lab
  9. Lesson10.5 Recursion: base cases, recursive calls, and the call stack
  10. Lab10.5 Interactive Lab: Recursion Lab
  11. Lesson10.6 Recursive Searching and Sorting: binary search and merge sort
  12. Lab10.6 Interactive Lab: Recursive Search and Sort Lab
  13. Lesson10.7 Writing Recursive Methods: building from base case to general case
  14. Lab10.7 Interactive Lab: Writing Recursion Lab
Chapter 11: Free-Response Practice: Methods and Class Design3 lessons, 3 quizzes, 2 labs
  1. Lesson11.1 FRQ Type 1: Methods and Control Structures
  2. Lab11.1 Interactive Lab: Question 1 Workshop
  3. Lesson11.2 FRQ Type 2: Writing a Complete Class
  4. Lab11.2 Interactive Lab: Class Workshop
  5. Lesson11.3 FRQ Strategy: reading the question, using given methods, and rubric habits
Chapter 12: Free-Response Practice: Collections and Exam Strategy3 lessons, 3 quizzes, 3 labs
  1. Lesson12.1 FRQ Type 3: Data Analysis with ArrayList
  2. Lab12.1 Interactive Lab: ArrayList Workshop
  3. Lesson12.2 FRQ Type 4: The 2D Array Question
  4. Lab12.2 Interactive Lab: Grid Workshop
  5. Lesson12.3 Multiple-Choice Strategy: tracing quickly and eliminating answers
  6. Lab12.3 Interactive Lab: Speed-Tracing Drill
  7. Exam12.4 The Java Quick Reference and Pacing Plan for Exam Day
Chapter 13: Final Practice Exam and Final Exam8 parts
  1. ExamFinal Practice Exam - Instructions
  2. ExamFinal Practice Exam
  3. ExamFinal Practice Exam - Written Part
  4. ExamFinal Practice Exam - Written Part Scoring Guide
  5. ExamFinal Exam - Instructions
  6. ExamFinal Exam
  7. ExamFinal Exam - Written Part
  8. ExamFinal Exam - Written Part Scoring Guide

How the course works

  1. Read a lesson

    69 lessons, chapter by chapter, at your own pace on your phone or laptop.

  2. Take its quiz

    A short quiz after every lesson shows what stuck before you move on.

  3. Practice in the labs

    55 interactive labs to work through ideas hands-on.

  4. Sit the practice exam, then the final

    Both have a written part. Check your answers against the scoring guide.

Will it count at your college?

The course gets you ready for the exam. The credit comes from your APĀ® score: scores run from 1 to 5, and each college decides which score earns credit and how much.

The APĀ® score each college asks for and the credit it gives, at 1,303 colleges. Or browse them all.

  • Free APĀ® Computer Science A practice test

    25 questions with an explanation for every answer.

    Take the free test
  • Printable APĀ® Computer Science A study guide

    41 pages, 230 key terms and 40 practice questions, for $5.

    See the guide
  • APĀ® Computer Science A score calculator

    Enter your multiple-choice and free-response points and see an estimated 1–5 score, live.

    Estimate your score

More APĀ® prep courses, $19 each

36 APĀ® courses, $19 each paid once, or all of them for $29 a month. See all our APĀ® prep, including printable guides for every exam.

Close to Computer Science A: APĀ® Computer Science Principles, APĀ® Calculus AB, APĀ® Calculus BC, APĀ® Precalculus, APĀ® Statistics.

Questions about the APĀ® Computer Science A course

How much is the APĀ® Computer Science A prep course?

$19, paid once, with no monthly bill. Or get every APĀ® course and every APĀ® study guide for $29 a month: see the plan.

Is the APĀ® Computer Science A exam hard?

It depends on what you already know. Take the free APĀ® Computer Science A practice test (25 questions) to see where you stand. In the course, the quiz after every lesson shows what stuck before you move on.

How do I study for and pass the APĀ® Computer Science A exam?

Work through the 69 lessons in order and take the quiz after each one, do the 55 interactive labs, then sit the full practice exam and the final exam and check your written answers against the scoring guide. For a last review, the printable study guide has 230 key terms and 40 practice questions.

Can I self-study for the APĀ® Computer Science A exam?

This course is built for studying on your own: 69 self-paced lessons with a quiz after each one, 55 interactive labs, then a full practice exam and a final exam, each with a written part and its scoring guide. Start with the free APĀ® Computer Science A practice test (25 questions) to see where you stand. For review on paper, the printable study guide is $5.

Is there a free APĀ® Computer Science A practice test?

Yes: 25 free questions. Take them without signing up; a free account shows your score and the explanation for each answer.

What's in it?

12 chapters with 69 lessons, a quiz after every lesson, 55 interactive labs, and a full practice exam and a final exam, each with a written part and its scoring guide.

Can I look inside before I buy?

Yes. The syllabus is free to preview: open the free preview.

Does the course give me college credit?

No. It prepares you for the APĀ® Computer Science A exam. Credit comes from your APĀ® score, and each college decides which score earns credit. Look up your college.

How do I study it?

Online, at your own pace, on a phone or a laptop. Sign in to transfercredit.org and open the course from your dashboard.

What's the difference between the course and the study guide?

The course teaches the whole subject: lessons, quizzes, labs and two full exams. The guide is one printable PDF for review: 41 pages of key terms and practice questions, for $5.

Is this course from the College Board?

No. TransferCredit.org made it. The College Board is not affiliated with it and does not endorse it.

APĀ® is a trademark registered by the College Board, which is not affiliated with, and does not endorse, this course. We source the APĀ® score range from the College Board.

Ready for the APĀ® Computer Science A exam?

69 lessons, 55 labs and two full exams, for $19 once.