Unit 9 and 10 Review

12345678910111213141516171819202122232425262728
Across
  1. 4. a finite set of instructions that accomplish a task.
  2. 5. a type of problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer
  3. 7. involves one key for both encryption and decryption.
  4. 9. a computing model in which programs run in order one command at a time.
  5. 11. a computing model in which programs are broken into small pieces some of which are run simultaneously
  6. 14. software intended to damage a computing system or to take partial control over its operation
  7. 15. a system that requires at least two steps to unlock protected information
  8. 16. a process of encoding messages to keep them secret so only "authorized" parties can read it.
  9. 17. a type of problem with a yes/no answer
  10. 20. the time used to complete a task sequentially divided by the time to complete a task in parallel
  11. 22. a search algorithm which checks each element of a list in order until the desired value is found
  12. 23. a measure of how many steps are needed to complete an algorithm
  13. 24. infects and spreads across computing devices
  14. 25. a technique that attempts to trick a user into providing personal information. That personal information can then be used to access sensitive online resources such as bank accounts and emails
  15. 27. provides a "good enough" solution to a problem when an actual solution is impractical or impossible
  16. 28. the use of a program to record every keystroke made by a computer user in order to gain fraudulent access to passwords and other confidential information
Down
  1. 1. putting steps in an order.
  2. 2. pairs a public key for encryption and a private key for decryption. The receiver’s private key is required to decrypt the message
  3. 3. a wireless access point that gives unauthorized access to secure networks.
  4. 6. algorithms with a polynomial efficiency or lower (constant linear square cube etc.) are said to run in a reasonable amount of time.
  5. 8. 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
  6. 9. deciding which steps to do next.
  7. 10. includes a program as an integral part of its function. Can be physical or non-physical computing software or non-physical computing concepts
  8. 12. doing some steps over and over
  9. 13. a computing model in which programs are run by multiple devices
  10. 18. algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.
  11. 19. a type of problem with the goal of finding the "best" solution among many
  12. 21. a process that reverses encryption taking a secret message and reproducing the original plain text.
  13. 26. information about an individual that identifies links relates or describes them.