1 | 13 | 14 | |||||||||||||||||||||||
2 | 17 | ||||||||||||||||||||||||
16 | |||||||||||||||||||||||||
3 | 18 | ||||||||||||||||||||||||
12 | 4 | ||||||||||||||||||||||||
5 | |||||||||||||||||||||||||
6/15 | |||||||||||||||||||||||||
7 | |||||||||||||||||||||||||
8 | |||||||||||||||||||||||||
9 | |||||||||||||||||||||||||
10 | |||||||||||||||||||||||||
11 | |||||||||||||||||||||||||
1. A visual representation of an algorithm using shapes and arrows to show the flow of instructions.
2. A language used to describe programming concepts using a mix of natural language and programming code.
3. The process of repeating a set of instructions until a specific condition is met.
4. A control structure that executes instructions until a condition is met or a number of iterations is reached.
5. A named storage location in memory that can store modifiable data.
6. Solving a problem by breaking it down into smaller subproblems and solving them independently.
7. A set of rules used to reduce the size of data by removing redundant information.
8. A symbol used in a flowchart to connect different parts of an algorithm.
9. The maximum amount of resources (such as time or space) required to solve a problem, considering all possible inputs.
10. The amount of time an algorithm takes to run as a function of the input size.
11. A way of describing the space or time complexity of an algorithm.
12. The process of finding a particular item in a collection of data.
13. A time or space complexity where the amount of time or memory used grows quadratically with the size of the input.
14. A control structure that enables a program to execute blocks of code depending on certain conditions.
15. A symbol used in a flowchart to indicate a branching point in an algorithm.
16. The process of arranging data in a particular order.
17. A high-level description of an algorithm that uses a combination of natural language and programming syntax.
18. The process of using rational thinking and deduction to arrive at conclusions or make decisions.