AP CSP Unit 10 Review

Front

Which of the following is true of algorithms? Algorithms may have an infinite set of instructions, Algorithms must be expressed using a programming language, Every algorithm can be constructed using combinations of sequencing, selection, and iteration, Every problem can be solved with an algorithm

Back

Every algorithm can be constructed using combinations of sequencing, selection, and iteration

Front

The following algorithm is followed by a person every morning when they get up from bed to go to school. Which concept does this algorithm BEST demonstrate?

Back

Sequencing

Front

Which of these algorithms will move the robot along the same path as the algorithm below?

Back

Front

What term best defines the problem of designing a bus system to minimize walking distance to bus stops?

Back

An optimization problem

Front

The algorithm below is used to find the largest element in a list of numbers. By modifying one of the lines in the program it is possible to make the algorithm find the SMALLEST element. Which line would need to be modified and how? Options: Line 01 becomes target <- list[0], Line 04 becomes IF (num < target), Line 04 becomes IF (num = target), Line 01 becomes list[1] <- target

Back

Line 04 becomes IF (num < target)

Front

Which of the following algorithms is the same as the flowchart shown below?

Back

Front

This graph shows the efficiencies of two different algorithms that solve the same problem. Which of the following is most efficient? These algorithms are equally efficient, Algorithm A is more efficient than algorithm B, Algorithm B is more efficient than algorithm A, The algorithms have different efficiencies depending on the input size.

Back

The algorithms have different efficiencies depending on the input size

Front

Which principle does the decision to use a simpler algorithm for scheduling best demonstrate? Options: Unreasonable algorithms may sometimes also be undecidable, Heuristics can be used to solve some problems for which no reasonable algorithm exists, Two algorithms that solve the same problem must also have the same efficiency, Approximate solutions are often identical to optimal solutions

Back

Heuristics can be used to solve some problems for which no reasonable algorithm exists

Front

Which of the following algorithmic efficiencies would be considered LEAST efficient? Linear, Constant, Polynomial, Exponential

Back

Exponential

Front

Which of the following best describes the existence of undecidable problems?

Back

An undecidable problem is a problem for which no algorithm can be constructed that always produces a correct output.