| 1/11 | 17 | ||||||||||||||||||||||||
| 2 | |||||||||||||||||||||||||
| 13 | |||||||||||||||||||||||||
| 3 | |||||||||||||||||||||||||
| 14 | 15 | ||||||||||||||||||||||||
| 19 | |||||||||||||||||||||||||
| 4 | |||||||||||||||||||||||||
| 5 | |||||||||||||||||||||||||
| 6 | |||||||||||||||||||||||||
| 12 | |||||||||||||||||||||||||
| 7 | 16 | ||||||||||||||||||||||||
| 18 | |||||||||||||||||||||||||
| 8 | |||||||||||||||||||||||||
| 9 | |||||||||||||||||||||||||
| 10 | |||||||||||||||||||||||||
1. It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.
2. A named storage location in memory that can store modifiable data.
3. A problem-solving strategy that involves breaking a problem into smaller sub-problems, solving them independently and combining their solutions.
4. A programming construct that decides the sequence in which blocks of code are executed.
5. The time taken to execute an algorithm or program.
6. The expected amount of time or space resources required to solve a problem.
7. Breaking a system into smaller, loosely-coupled components that can be independently developed and maintained.
8. Logic gate that outputs true when the number of true inputs is odd
9. Starting with a high-level overview and breaking the problem down into more detailed sub-tasks
10. A subprogram that is callable within a program and executes a specific task, but does not return a value.
11. A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.
12. The arrangement of elements or components into a structure that mirrors their relative significance or connections.
13. The ability to present the same interface for different underlying data types.
14. A command used in a subprogram to show the specific value that will be given back to the main program
15. A data type that can have one of two possible values, usually true or false.
16. Basic components of digital circuits that perform logical operations
17. Circuit that adds two binary digits and outputs the sum and carry
18. A line used in a flowchart to indicate the direction of flow in an algorithm.
19. The central component of the merge sort algorithm is the function that combines two sorted subarrays. Its primary goal is to merge these arrays.