AP CSP Vocab Review

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
Across
  1. 1. Involves one key for both encryption and decryption.
  2. 7. A common method for referencing the elements in a list or string using numbers.
  3. 8. A process for reducing the number of bits needed to represent something in which some information is lost or thrown away. This process is not reversible.
  4. 10. Can continue to function even in the event of individual component failures. This is important because elements of complex systems like a computer network fail at unexpected times, often in groups.
  5. 15. The process of accessing each item in a list one at a time.
  6. 16. A written description of how a command or piece of code works or was developed.
  7. 18. Any data that are sent from a program to a device. Can come in a variety of forms, such as tactile interaction, audio, visuals, or text.
  8. 19. A collection of public copyright licenses that enable the free distribution of an otherwise copyrighted work, used when an author wants to give people the right to share, use, and build upon a work that they have created.
  9. 20. Information about an individual that identifies, links, relates, or describes them.
  10. 22. Occurs when the ending condition will never evaluate to true.
  11. 24. Differing access to computing devices and the Internet, based on socioeconomic, geographic, or demographic characteristics.
  12. 28. Type of error from attempting to represent a number that is too precise.
  13. 29. Associated with an action and supplies input data to a program. Can be generated when a key is pressed, a mouse is clicked, a program is started, or by any other defined action that affects the flow of execution.
  14. 32. A model in which programs are run by multiple devices.
  15. 34. The time used to complete a task sequentially divided by the time to complete a task in parallel.
  16. 37. Type of error from attempting to represent a number that is too large.
  17. 38. A process for creating a digital representation of analog data by measuring the analog data at regular intervals.
  18. 40. A repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met.
  19. 42. A wireless access point that gives unauthorized access to secure networks is known as a(n) ______________ access point.
  20. 45. 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.
  21. 46. Data with values that change continuously, or smoothly, over time. Some examples include music, colors of a painting, or position of a sprinter during a race.
  22. 47. Affects the sequential flow of control by executing different statements based on the value of a Boolean expression.
  23. 49. 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.
  24. 50. Data that are sent to a computer for processing by a program. Can come in a variety of forms, such as tactile interaction, audio, visuals, or text.
  25. 52. Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a(n) ________________ amount of time.
  26. 53. The inclusion of extra components so that a system can continue to work even if individual components fail, for example by having more than one path between any two connected devices in a network.
  27. 56. A process that makes the data uniform without changing its meaning (e.g., replacing all equivalent abbreviations, spellings, and capitalizations with the same word).
  28. 57. A model in which programs are broken into small pieces, some of which are run simultaneously.
  29. 58. An 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.
  30. 59. An 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.
  31. 61. A chunk of data sent over a network. Larger messages are divided into packets that may arrive at the destination in order, out-of-order, or not at all.
  32. 65. Provides a "good enough" solution to a problem when an actual solution is impractical or impossible.
  33. 66. A(n) ________________ problem is one in which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer.
  34. 67. An ordered sequence of characters.
Down
  1. 2. Software intended to damage a computing system or to take partial control over its operation.
  2. 3. Form of program documentation written into the program to be read by people and which do not affect how a program runs.
  3. 4. Algorithms with exponential or factorial efficiencies are examples of algorithms that run in a(n) ________________ amount of time.
  4. 5. Data about data.
  5. 6. A contraction of "Binary Digit"; the single unit of information in a computer, typically represented as a 0 or 1.
  6. 9. A finite set of instructions that accomplish a task.
  7. 11. A(n) ________________ problem has the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?).
  8. 12. Used to stop a procedure (also known as a function) from running and sometimes send back the value of an expression.
  9. 13. A process that reverses encryption, taking a secret message and reproducing the original plain text.
  10. 14. A named group of programming instructions. Also referred to as a “procedure”.
  11. 17. An agreed-upon set of rules that specify the behavior of some system.
  12. 21. An ordered collection of elements.
  13. 23. A variable in a function definition. Used as a placeholder for values that will be passed through the function.
  14. 25. A computer network consisting of interconnected networks that use standardized, open (nonproprietary) communication protocols.
  15. 26. The practice of obtaining input or information from a large number of people via the Internet.
  16. 27. A data type that is either true or false.
  17. 30. A process for reducing the number of bits needed to represent something without losing any information. This process is reversible.
  18. 31. Finding and fixing problems in an algorithm or program.
  19. 33. A relationship between two pieces of data, typically referring to the amount that one varies in relation to the other.
  20. 35. Choosing a smaller subset of a data set to use for analysis, for example by eliminating / keeping only certain rows in a table.
  21. 36. The inputs and outputs that allow a user to interact with a piece of software. This can include a variety of forms such as buttons, menus, images, text, and graphics.
  22. 39. The system responsible for translating domain names like example.com into IP addresses.
  23. 41. A system of linked pages, programs, and files.
  24. 43. 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.
  25. 44. 8 bits.
  26. 48. The unique number assigned to each device on the Internet.
  27. 51. A named reference to a value that can be used repeatedly throughout a program.
  28. 54. The series of connections between computing devices on a network starting with a sender and ending with a receiver.
  29. 55. The maximum amount of data that can be sent in a fixed amount of time, usually measured in bits per second.
  30. 60. A measure of how many steps are needed to complete an algorithm.
  31. 62. A process of encoding messages to keep them secret, so only "authorized" parties can read it.
  32. 63. A group of functions (procedures) that may be used in creating new programs.
  33. 64. A type of computer that forwards data across a network.