1/10 | 15 | ||||||||||||||||||||||||
2 | |||||||||||||||||||||||||
17 | |||||||||||||||||||||||||
3 | |||||||||||||||||||||||||
11 | |||||||||||||||||||||||||
4 | |||||||||||||||||||||||||
16 | |||||||||||||||||||||||||
14 | |||||||||||||||||||||||||
5 | 12 | ||||||||||||||||||||||||
13 | |||||||||||||||||||||||||
6 | |||||||||||||||||||||||||
7 | |||||||||||||||||||||||||
8/9 | |||||||||||||||||||||||||
1. The technique of simplifying intricate data by offering a high-level interface.
2. A control structure that enables a program to execute blocks of code depending on certain conditions.
3. A symbol or word used to compare two values and produce a boolean result.
4. The value of a variable at the beginning of a program or a specific section of code.
5. A sorting order in which the items are arranged from smallest to largest.
6. A sorting algorithm that keeps the original order of elements with equal values.
7. Starting with a high-level overview and breaking the problem down into more detailed sub-tasks
8. The amount of time an algorithm takes to solve a problem as a function of the size of the input.
9. The amount of time it takes to complete a task as the input size increases.
10. A sorting order in which the items are arranged from largest to smallest.
11. The arrangement of elements or components into a structure that mirrors their relative significance or connections.
12. A programming construct that decides the sequence in which blocks of code are executed.
13. A symbol used in a flowchart to indicate a branching point in an algorithm.
14. A symbol used in a flowchart to indicate an action taken in an algorithm.
15. The ease with which modifications can be made to a codebase.
16. An error in a program due to improper use of programming language syntax.
17. The ability to identify similarities or commonalities among different problems or situations.