unit 10 vocab crossword :)

12345678910111213141516171819202122232425
Across
  1. 3. Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time
  2. 5. A type of 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; more efficient
  3. 7. A task; the general description of a task that can or cannot be solved with an algorithm
  4. 10. Used to create algorithms by deciding which tasks/steps to do next
  5. 13. Problems that no algorithm can be constructed that is always capable of providing a correct yes-or-no answer. These problems were proven that no computer will ever be able to solve; ex: the Halting Problem
  6. 14. Programs which replicate or mimic key features of a real world event in order to investigate its behavior without the cost, time, or danger of running an experiment in real life.
  7. 18. Used to create algorithms by operating tasks/steps in order
  8. 19. A measure of how many steps are needed to complete an algorithm
  9. 20. ex: 3^n; unreasonable
  10. 21. When programs are broken into small pieces, some of which are run simultaneously
  11. 22. ex: log2(n); reasonable
  12. 24. Used to create algorithms by repeating a task/step multiple times
  13. 25. A finite set of instructions that accomplish a task;can be expressed in many ways like programming code, pseudocode, and natural language.
Down
  1. 1. Problems that can't be solved without using exponential time or worse!; ex: Traveling Salesman Problem
  2. 2. Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time
  3. 4. ex: 3n; reasonable
  4. 6. ex: n^3; reasonable
  5. 8. Sequential time / Parallel time
  6. 9. When programs are run by multiple devices; ex: crowdsourcing
  7. 11. A type of search algorithm which checks each element of a list chronologically until the desired value is found or all elements in the list have been checked; less efficient
  8. 12. When programs run in order, one command at a time
  9. 15. A problem with the goal of finding the "best" solution among many.
  10. 16. Something that provides a "good enough" solution for most instances of the problem when an actual solution is impractical or impossible (unreasonable or undecidable)
  11. 17. A problem with a yes or no answer
  12. 23. problem descriptions: