| 1/12 | 14 | |||||||||||||||||||||||
| 2 | 13 | |||||||||||||||||||||||
| 3 | 16 | |||||||||||||||||||||||
| 4 | 18 | |||||||||||||||||||||||
| 5 | 19 | |||||||||||||||||||||||
| 6 | ||||||||||||||||||||||||
| 15 | ||||||||||||||||||||||||
| 7 | ||||||||||||||||||||||||
| 8 | 17 | |||||||||||||||||||||||
| 9 | ||||||||||||||||||||||||
| 10 | ||||||||||||||||||||||||
| 11 | ||||||||||||||||||||||||
1. The ability to present the same interface for different underlying data types.
2. The amount of memory or storage space required by an algorithm to solve a problem.
3. The technique of simplifying intricate data by offering a high-level interface.
4. How easily the code can be understood by humans.
5. The time taken to execute an algorithm or program.
6. A sorting order in which the items are arranged from smallest to largest.
7. The process of dividing a complex problem or system into smaller, more manageable subproblems or components.
8. A named storage location in memory that can store modifiable data.
9. A list that is not sorted according to any specific criterion.
10. It is an array where the elements are arranged in increasing order.
11. The ability to identify similarities or commonalities among different problems or situations.
12. A high-level description of an algorithm that uses a combination of natural language and programming syntax.
13. A modular, reusable, and self-contained part of a larger system.
14. A subprogram that is callable within a program and executes a specific task, but does not return a value.
15. A sorting algorithm that does not require extra space for temporary arrays or data structures.
16. Algorithm that repeatedly compares adjacent items in a list or array and swaps them until everything is sorted.
17. Instructions written in a programming language that are capable of being executed by a computer.
18. A data type that specifies only the functionality and not the specific way it is implemented.
19. A symbol used in a flowchart to indicate a branching point in an algorithm.