Skip to content
cookie
Shared flashcard decks

AP Computer Science A

AP · College BoardComputer Science A547 cards

More for College Board AP Computer Science A

Picked for the same course from what people use most, and all of it can be read without an account.

Everything for Computer Science

Looking for help with Computer Science?

Cookie Tutoring, our own tutoring service, may have tutors for Computer Science. Lessons are live and one to one, and the first 15 minutes with any tutor is free.

Find a tutor

Flashcards for AP Computer Science A, split into the four units of the Course and Exam Description for exams from 2027, then by topic in each unit's own order. Cards cover the Java subset the course sets out, from primitive types and objects through arrays, ArrayList, 2D arrays and recursion.

Adding it gives you your own copy, with every subdeck below. Each card then comes back just before you would forget it, and every one you get right or wrong counts towards your mastery of its topic. You can delete or suspend the parts you are not studying once it is yours.

What is inside (57 subdecks)

  • Unit 1: Using Objects and Methods186 cards
    • 1.1 Introduction to Algorithms, Programming, and Compilers18 cards
    • 1.2 Variables and Data Types13 cards
    • 1.3 Expressions and Output23 cards
    • 1.4 Assignment Statements and Input9 cards
    • 1.5 Casting and Range of Variables16 cards
    • 1.6 Compound Assignment Operators9 cards
    • 1.7 Application Program Interface (API) and Libraries9 cards
    • 1.8 Documentation with Comments10 cards
    • 1.9 Method Signatures19 cards
    • 1.10 Calling Class Methods5 cards
    • 1.11 Math Class9 cards
    • 1.12 Objects: Instances of Classes11 cards
    • 1.13 Object Creation and Storage (Instantiation)8 cards
    • 1.14 Calling Instance Methods4 cards
    • 1.15 String Manipulation23 cards
  • Unit 2: Selection and Iteration118 cards
    • 2.1 Algorithms with Selection and Repetition9 cards
    • 2.2 Boolean Expressions9 cards
    • 2.3 if Statements11 cards
    • 2.4 Nested if Statements10 cards
    • 2.5 Compound Boolean Expressions13 cards
    • 2.6 Comparing Boolean Expressions10 cards
    • 2.7 while Loops14 cards
    • 2.8 for Loops10 cards
    • 2.9 Implementing Selection and Iteration Algorithms11 cards
    • 2.10 Implementing String Algorithms8 cards
    • 2.11 Nested Iteration6 cards
    • 2.12 Informal Run-Time Analysis7 cards
  • Unit 3: Class Creation83 cards
    • 3.1 Abstraction and Program Design18 cards
    • 3.2 Impact of Program Design8 cards
    • 3.3 Anatomy of a Class8 cards
    • 3.4 Constructors13 cards
    • 3.5 Methods: How to Write Them13 cards
    • 3.6 Methods: Passing and Returning References of an Object7 cards
    • 3.7 Class Variables and Methods7 cards
    • 3.8 Scope and Access4 cards
    • 3.9 this Keyword5 cards
  • Unit 4: Data Collections160 cards
    • 4.1 Ethical and Social Issues Around Data Collection9 cards
    • 4.2 Introduction to Using Data Sets5 cards
    • 4.3 Array Creation and Access15 cards
    • 4.4 Array Traversals10 cards
    • 4.5 Implementing Array Algorithms10 cards
    • 4.6 Using Text Files14 cards
    • 4.7 Wrapper Classes9 cards
    • 4.8 ArrayList Methods14 cards
    • 4.9 ArrayList Traversals5 cards
    • 4.10 Implementing ArrayList Algorithms7 cards
    • 4.11 2D Array Creation and Access9 cards
    • 4.12 2D Array Traversals8 cards
    • 4.13 Implementing 2D Array Algorithms6 cards
    • 4.14 Searching Algorithms6 cards
    • 4.15 Sorting Algorithms10 cards
    • 4.16 Recursion12 cards
    • 4.17 Recursive Searching and Sorting11 cards

Some of its cards

  • What are the three building blocks of algorithms?
    Sequencing, selection and repetition
  • A step-by-step process for carrying out a task or solving a problem
    Algorithm
  • Selection sort
    A sorting algorithm that repeatedly finds the smallest (or largest) value in the unsorted part of the list and swaps it into its final position
  • Reverses a Boolean value: `true` becomes `false` and `false` becomes `true`
    Logical NOT operator
  • System reliability
    A program's ability to perform its tasks as expected, under stated conditions, without failure
  • `this`
    A special variable, used inside an instance method or constructor, that holds a reference to the current object
  • Whose responsibility is it to try to safeguard a user's personal privacy when building a new program?
    The programmer's
  • Are comments executed when a Java program runs?
    No, the compiler ignores them
  • What does the assignment operator `=` do in Java?
    It stores the value of the expression on the right in the variable on the left
  • How do you call an instance method `start` on an object called `car`?
    Using the dot operator, `car.start()`

And 537 more once you add the deck.