Control Flow
Data Structures
Algorithmic Logic
Procedures & Abstraction
Development & Errors
100

The three building blocks of all algorithms are sequence, selection, and this.

What is Iteration (or Loops)?

100
This is an ordered sequence of elements, often referred to as a collection.

What is a List?

100

This search algorithm checks every element in a list in order until the match is found.

What is a Linear Search (or Sequential Search)?

100

A named gorup of programming instructions that may have parameters and return values.

What is a Procedure (or Function/Method)?

100

This type of error occurs when the code doesn't follow the rules of the programming language (like a missing bracket).

What is a Syntax Error?

200

This type of statement uses a Boolean condition to determine which of two paths a program will take.

What is a Selection statement (or If-Statement)?

200

This term refers to the number or position of an item within a list.

What is an Index?

200

This much faster search algorithm repeatedly divides a sorted list in half.

What is a Binary Search?

200

These are the input variables listed in the procedure header that act as placeholders for data.

What are Parameters?

200

This error occurs when a program runs but produces the wrong or unexpected output.

What is a Logic Error?

300

A loop that continues to run until a specific condition is met is often called this type of loop.

What is a Condition-controlled loop (or While loop)?

300

In most programming languages, indices start at 0, but on the AP CSP exam, they start at this number.

What is 1?

300

A binary search can only be performed if the data is in this state.

What is Sorted?

300

This is the specific value passed into a procedure when it is actually called.

What is an Argument?

300

An error that causes a program to stop working while it is running.

What is a Runtime Error?

400

This term describes the step by step order in which instructions are executed in a program.

What is Sequence?

400

This process involves going through every item in a list one by one. 

What is Traversing?

400

This "informal" way of writing program code doesn't follow strict syntax but helps humans plan logic.

What is Pseudocode?

400

This concept involves reducing complexity by hiding the "how" and focusing on the "what".

What is Procedural Abstraction?

400

This is the process of finding and fixing errors in a program.

What is Debugging?

500

When a selection statement is placed inside another selecction statement, it is known as being...

What is Nested?

500

To add an item to the very end of an existing list, you would use this specific command/method.

What is Append?

500

This term describes an algorithm's ability to be solved in a "reasonable" amount of time as the input size grows.

What is Efficiency?

500

A collection of procedures and code that can be imported and reused in different programs.

What is a Library?

500

These are used to provide information about what the code does for other programmers; they are ignored by the computer.

What are Comments?