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

Queue

Answer

Linked List

Answer

Binary Tree

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

O(n)

Answer

O(n²)

Answer

O(n log n)

Question 3

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

Accepted Answer

Quadratic time

Answer

Constant time

Answer

Linear time

Answer

Logarithmic time

Question 4

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

Accepted Answer

Manage complexity by hiding unnecessary details

Answer

Write code without testing

Answer

Avoid using variables

Answer

Run programs faster

Question 5

What is a Boolean expression?

Accepted Answer

An expression that returns true or false

Answer

An expression that returns a number

Answer

An expression that returns a string

Answer

An expression that returns null

Question 6

Which of the following describes a recursive function?

Accepted Answer

A function that calls itself

Answer

A function that only runs once

Answer

A function with no parameters

Answer

A function that returns void