AP Computer Science a Flashcards: Implementing String Algorithms

Study Implementing String Algorithms in AP Computer Science a with focused flashcards that help you recognize the idea, recall the key rule, and apply it in practice-style prompts.

QUESTION

How do you concatenate two strings in Java?

Tap card or press Space to flip

ANSWER

Use the concat() method or the + operator. Both create a new string by joining the original strings.

1 / 26

AP Computer Science a: Selection and Iteration

Boolean Expressions38 cards

Comparing Boolean Expressions24 cards

Compound Boolean Expressions34 cards

for Loops37 cards

if Statements37 cards

Implementing Selection and Iteration Algorithms39 cards

You are hereImplementing String Algorithms26 cards

Informal Run-Time Analysis38 cards

Nested if Statements29 cards

Nested Iteration30 cards

while Loops()37 cards

All flashcards

26 cards

What this deck covers

This deck focuses on Implementing String Algorithms, giving you a quick way to review the definitions, rules, and examples that matter most for AP Computer Science a.

How to use these flashcards

Work through these flashcards in short sessions. Try to answer each prompt before flipping the card, then revisit any cards you miss until the explanation feels automatic.

Practice questions

1 of 13Practice questions for this set

Problem: Sort an array of strings in lexicographical order using selection sort. Input: String[] words (length 1–200) where each word length is 0–50. Output: the same array sorted ascending. No external libraries. Function signature: public static void selectionSort(String[] words). Given the problem description above, how many iterations will the outer loop execute for input of length n?

Choose an answer

Keep your progress across every deck

Free account · cards you mark are saved to it