Core computing concepts including algorithms, data, the internet, and the impacts of computing, tested on AP Computer Science Principles.
40 cards · basic cards · AI-written, checked twice. Edit anything.
- What is an algorithm?
- A step-by-step procedure for solving a problem or accomplishing a task.
- What does Big O notation describe?
- How an algorithm's runtime or space requirements grow as the input size increases.
- What is the time complexity of linear search?
- O(n), where n is the number of elements.
- What is the time complexity of binary search?
- O(log n), where n is the number of elements.
- What is a variable in programming?
- A named container that holds a value and can change during program execution.
- What is a data type?
- A classification of data that determines what values it can hold and what operations can be performed on it.
- What does a conditional (if/else) statement do?
- It executes different code blocks based on whether a condition is true or false.
- What is a loop?
- A control structure that repeats a block of code multiple times until a condition is met.
- What is the difference between a while loop and a for loop?
- A while loop repeats based on a condition; a for loop typically repeats a known number of times.
- What is a function in programming?
- A reusable block of code that performs a specific task and can accept inputs (parameters) and return outputs.
- What is an array?
- An ordered collection of elements stored at consecutive memory locations, accessed by index.
- What is a list in programming?
- An ordered collection of elements that can grow or shrink in size dynamically.
- What is a string?
- A sequence of characters (letters, numbers, symbols) treated as a single data unit.
- What is data compression?
- Reducing the size of data by encoding it more efficiently, either without loss (lossless) or with some loss (lossy).
- What is binary representation?
- Using only two symbols (0 and 1) to represent all data in a computer.