AP AP Computer Science & Technology

Question 1

In AP Computer Science, which data structure operates on a Last-In-First-Out (LIFO) principle?

Accepted Answer

Stack

Answer

A stack uses LIFO, meaning the last element added is the first one removed.

Question 2

What is the time complexity of a binary search algorithm on a sorted array of n elements?

Accepted Answer

O(log n)

Answer

Binary search halves the search space each step, resulting in O(log n) time complexity.

Question 3

Which of the following best describes an algorithm with O(n²) time complexity?

Accepted Answer

Quadratic time

Answer

O(n²) is called quadratic time because execution time grows as the square of the input size.

Question 4

In AP Computer Science Principles, what does abstraction allow programmers to do?

Accepted Answer

Manage complexity by hiding unnecessary details

Answer

Abstraction lets programmers manage complexity by focusing on essential features and hiding implementation details.

Question 5

What is a Boolean expression?

Accepted Answer

An expression that returns true or false

Answer

A Boolean expression evaluates to either true or false and is fundamental to conditional logic in programming.

AP - Advanced Placement Test Practice Test