Unit 6 Algorithms

2. In _______ computing, programs are run by multiple devices
3. a general description of a task that can (or cannot) be solved with an algorithm
7. The halting problem is a famous example of an _______ problem (one that cannot be solved)
8. doing some steps over and over
10. The time used to complete a task sequentially, divided by the time to complete the task in parallel
12. _____ search checks each item in the list in order, until the desired value is found or the end of the list is reached
14. ______ search starts at the middle of a sorted list and removes half the data; this process repeats until the desired value is found or all elements have been eliminated
15. In ________ computing, programs are broken into small pieces, some of which can be run simultaneously
17. deciding which steps to take next

1. A(n) ____________ problem tries to find the BEST solution among many possible solutions
4. When an optimal solution cannot be calculated in a reasonable amount of time, you can look for a(n) _________ solution to find a "good enough" solution in a reasonable amount of time
5. Algorithms with polynomial efficiency or lower are said to run in a(n) ______ amount of time
6. putting steps in order, one after another
9. Algorithms with exponential or factorial efficiency are said to run in a(n) __________ amount of time
11. a measure of how many steps are needed to complete an algorithm
13. In ____________ computing, steps are executed in order, one at a time
16. a finite set of instructions that accomplish a task, which can be expressed in code, pseudocode, natural language, or a diagram