AP CSP Unit 6 Quiz

Algorithms can be made by combining the following.

• Sequencing, parallel, and speedup.

• Sequencing, selection, and iteration.

• Programming, selection, and iteration.

• If, else-if, and for loops.

Repeat 10 times:

-Draw a circle

Which concept does this algorithm best illustrate?

• Sequencing

• Selection

• Iteration

• Distribution

A school is trying to organize a tour that minimizes the amount of distance guests will have to walk. This is an example of which type of problem?

• Undecideable problem

• Decision problem

• Optimization problem

• Efficiency problem

Which concept is best illustrated by the diamond in this algorithm flowchart?

• Selection

• Iteration

• Looping

• Parallel Process

Which of these algorithms is most efficient with smaller inputs?

• A

• B

Which best describes Algorithm A?

• Linear

• Exponential

• Polynomial

• Factorial

Which of these algorithms is least-efficient?

• Log

• Linear

• Polynomial

• Exponential

A sequential algorithm takes 9 minutes to complete. A parallel version of that algorithm takes 3. What is the speedup of the parallel solution?

• 9

• 3

• 6

• 4.5

A computer is performing a binary search on the list:

[1, 5, 20, 50, 51, 80, 99]

In order to find the number 80. How many iterations will it take?

• 1

• 2

• 3

• 4

"Provides a "good enough" solution to a problem when an actual solution is impractical or impossible." This definition is an example of a...

• Selection

• Parallel solution

• Heuristic

• Undecidable problem