Across
- 4. occurs when the ending condition will never evaluate to true
- 5. a measure of how many steps are needed to complete an algorithm
- 7. 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).
- 8. used to return the flow of control to the point where the procedure (also known as a function) was called and to return the value of expression
- 10. deciding which steps to do next
- 11. Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time
- 12. a model in which programs are broken into small pieces, some of which are run simultaneously
- 14. a wireless access point that gives unauthorized access to secure networks
- 17. 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
- 18. a process and allows a procedure to be used only knowing what it does, not how it does it. Procedural abstraction allows a solution to a large problem to be based on the solution of smaller subproblems. This is accomplished by creating procedures to solve each of the subproblems.
- 20. the practice of obtaining input or information from a large number of people via the Internet
- 23. 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
- 25. the time used to complete a task sequentially divided by the time to complete a task in parallel
- 30. a variable in a function definition. Used as a placeholder for values that will be passed through the function
- 34. involves one key for both encryption and decryption
- 35. manage complexity in programs by giving a collection of data a name without referencing the specific details of the representation
- 40. Application Program Interface - specifications for how functions in a library behave and can be used
- 41. software intended to damage a computing system or to take partial control over its operation
- 42. 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
- 43. provides a "good enough" solution to a problem when an actual solution is impractical or impossible
- 44. an individual value in a list that is assigned a unique index
- 45. putting steps in an order
- 46. a model in which programs run in order, one command at a time
Down
- 1. a problem with a yes/no answer (e.g., is there a path from A to B?)
- 2. protects a computing system against infection
- 3. 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
- 6. data that does not accurately reflect the full population or phenomenon being studied
- 9. a process that reverses encryption, taking a secret message and reproducing the original plain text
- 13. information about an individual that identifies, links, relates, or describes them
- 15. a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met
- 16. a process of encoding messages to keep them secret, so only "authorized" parties can read it
- 19. 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
- 21. a problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?)
- 22. a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer
- 24. 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
- 26. a general description of a task that can (or cannot) be solved with an algorithm
- 27. a model in which programs are run by multiple devices
- 28. the subdivision of a computer program into separate subprograms
- 29. an ordered collection of elements
- 31. the process of accessing each item in a list one at a time
- 32. a group of functions (procedures) that may be used in creating new programs
- 33. Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time
- 36. the value passed to the parameter
- 37. a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met
- 38. a common method for referencing the elements in a list or string using numbers
- 39. a finite set of instructions that accomplish a task