AP Computer Science Principles - Unit 6: Algorithms

Which of the following is a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked?

• a) Binary Search
• b) Linear Search
• c) Iteration
• d) Selection

Which of the following is a measure of how many steps are needed to complete an algorithm?

• a) Efficiency
• b) Selection
• c) Sequencing
• d) Iteration

Which of the following is a technique that provides a "good enough" solution to a problem when an actual solution is impractical or impossible?

• a) Optimization Problem
• b) Reasonable Time
• c) Heuristic
• d) Sequential Computing

Which of the following refers to the runtime of algorithms with exponential or factorial efficiencies?

• a) Reasonable Time

• b) Heuristic

• c) Unreasonable Time

• d) Efficiency

Which of the following refers to a model in which programs run by multiple devices?

• a) Parallel Computing
• b) Sequential Computing
• c) Distributed Computing
• d) Speedup

Which of the following is a model in which programs are broken into small pieces, some of which are run simultaneously on a single device?

• a) Distributed Computing

• b) Sequential Computing

• c) Parallel Computing

• d) Speedup

Which of the following refers to the process of putting steps in order?

• a) Sequencing
• b) Selection
• c) Iteration
• d) Optimization Problem

Which of the following is a problem with a yes/no answer?

• a) Decision Problem
• b) Optimization Problem
• c) Undecidable Problem
• d) Heuristic

Which of the following refers to a problem with the goal of finding the "best" solution among many?

• a) Optimization Problem
• b) Decision Problem
• c) Undecidable Problem
• d) Heuristic

Which of the following refers to a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer?

• a) Decision Problem
• b) Optimization Problem
• c) Undecidable Problem
• d) Heuristic