APCSP Review 1

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
Across
  1. 1. NOT, AND, and OR, which evaluate to a Boolean value
  2. 4. 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
  3. 6. deciding which steps to do next
  4. 9. an ordered sequence of characters
  5. 12. about an individual that identifies, links, relates, or describes them
  6. 16. software intended to damage a computing system or to take partial control over its operation
  7. 17. the process of accessing each item in a list one at a time
  8. 21. a model in which programs are run by multiple devices
  9. 23. a common method for referencing the elements in a list or string using numbers
  10. 28. a relationship between two pieces of data, typically referring to the amount that one varies in relation to the other.
  11. 29. data that does not accurately reflect the full population or phenomenon being studied
  12. 33. a named group of programming instructions. Also referred to as a “procedure”.
  13. 37. a combination of operators and values that evaluates to a single value
  14. 38. 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. 40. a general description of a task that can (or cannot) be solved with an algorithm
  16. 43. data about data
  17. 44. provides a "good enough" solution to a problem when an actual solution is impractical or impossible
  18. 46. a measure of how many steps are needed to complete an algorithm
  19. 47. a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met
  20. 50. a process that reverses encryption, taking a secret message and reproducing the original plain text
  21. 51. an individual value in a list that is assigned a unique index
  22. 52. <, >, <=, >=, ==, != indicate a Boolean expression
  23. 53. allows a program to change the value represented by a variable
  24. 54. includes a program as an integral part of its function. Can be physical (e.g. self-driving car), non-physical computing software (e.g. picture editing software), or non-physical computing concepts (e.g., e-commerce).
  25. 55. a process that makes the data uniform without changing its meaning (e.g., replacing all equivalent abbreviations, spellings, and capitalizations with the same word).
Down
  1. 2. a problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?)
  2. 3. affects the sequential flow of control by executing different statements based on the value of a Boolean expression
  3. 5. a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met
  4. 7. a finite set of instructions that accomplish a task
  5. 8. a model in which programs run in order, one command at a time
  6. 9. the time used to complete a task sequentially divided by the time to complete a task in parallel
  7. 10. the collection of facts and patterns extracted from data
  8. 11. 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
  9. 13. a system that requires at least two steps to unlock protected information; each step adds a new layer of security that must be broken to gain unauthorized access
  10. 14. a problem with a yes/no answer (e.g., is there a path from A to B?)
  11. 15. the collection of facts and patterns extracted from data
  12. 18. a model in which programs are broken into small pieces, some of which are run simultaneously
  13. 19. an ordered collection of elements
  14. 20. a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer
  15. 22. involves one key for both encryption and decryption
  16. 24. protects a computing system against infection
  17. 25. occurs when the ending condition will never evaluate to true
  18. 26. the practice of obtaining input or information from a large number of people via the Internet
  19. 27. choosing a smaller subset of a data set to use for analysis, for example by eliminating / keeping only certain rows in a table
  20. 30. a wireless access point that gives unauthorized access to secure networks
  21. 31. pairs a public key for encryption and a private key for decryption. The sender does not need the receiver’s private key to encrypt a message, but the receiver’s private key is required to decrypt the message
  22. 32. a data type that is either true or false
  23. 34. Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time
  24. 35. a named reference to a value that can be used repeatedly throughout a program
  25. 36. Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time
  26. 39. scientific research conducted in whole or part by distributed individuals, many of whom may not be scientists, who contribute relevant data to research using their own computing devices.
  27. 41. 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
  28. 42. manage complexity in programs by giving a collection of data a name without referencing the specific details of the representation
  29. 45. a process of encoding messages to keep them secret, so only "authorized" parties can read it
  30. 48. a command that executes the code within a function
  31. 49. putting steps in an order