Unit 6 Review: Algorithms

2. A computing model in which programs are broken into small pieces, some of which are run simultaneously
5. A finite set of instructions that accomplish a task.
7. A problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?)
10. A problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer
11. Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an _____________ amount of time.
13. A search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.
14. A problem with a yes/no answer (e.g., is there a path from A to B?)
16. Provides a "good enough" solution to a problem when an actual solution is impractical or impossible

1. A computing model in which programs run in order, one command at a time.
3. Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a ___________ amount of time.
4. A measure of how many steps are needed to complete an algorithm
6. The time used to complete a task sequentially divided by the time to complete a task in parallel
8. The application of each step of an algorithm in the order in which the code statements are given
9. A general description of a task that can (or cannot) be solved with an algorithm
12. 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.
15. A computing model in which programs are run by multiple devices