1
THEORY OF COMPUTATION EXAM LATEST VERSION -
2025/2026- 100+ QUESTIONS AND VERIFIED ANSWERS ALL
THE BEST
Functional abstraction
Problem broken down into series of reusable functions (e.g. random). You do not
need to know anything about how the computation occurs.
Procedural abstraction
Break down a problem into a series of subroutines, hiding the values used.
Computation method NOT hidden.
Decomposition
Breaking problem into a number of sub-problems, so that each sub-problem
achieves an identifiable task.
Composition
Combining procedures to form compound procedures.
Algorithm
A sequence of steps that can be followed to complete a task and that always
terminates.
Representational abstraction
An abstraction thats arrived at via removing unnecessary details.
Abstraction by generalisation
A grouping by common characteristics to arrive at a hierarchical relationship of
the 'is a kind of' type.
Information hiding
, 2
The process of hiding all details of an object that do not contribute to its essential
characteristics.
Steps of automation
- Create algorithms
- Implement them in program code
- implement models in data structures
- execute the code
Automation
Putting models (abstractions of real world things) into action to solve problems.
Set
An unordered collection of values in which each value occurs at most once.
| symbol
Such that
Finite set
One whose elements can be counted off by natural numbers up to a particular
number.
Countably infinite set
One that can be counted off by the natural numbers
Cardinality of finite set
The number of elements in the set.
Examples of infinite sets
Real numbers or natural numbers
⊂ Proper subset
THEORY OF COMPUTATION EXAM LATEST VERSION -
2025/2026- 100+ QUESTIONS AND VERIFIED ANSWERS ALL
THE BEST
Functional abstraction
Problem broken down into series of reusable functions (e.g. random). You do not
need to know anything about how the computation occurs.
Procedural abstraction
Break down a problem into a series of subroutines, hiding the values used.
Computation method NOT hidden.
Decomposition
Breaking problem into a number of sub-problems, so that each sub-problem
achieves an identifiable task.
Composition
Combining procedures to form compound procedures.
Algorithm
A sequence of steps that can be followed to complete a task and that always
terminates.
Representational abstraction
An abstraction thats arrived at via removing unnecessary details.
Abstraction by generalisation
A grouping by common characteristics to arrive at a hierarchical relationship of
the 'is a kind of' type.
Information hiding
, 2
The process of hiding all details of an object that do not contribute to its essential
characteristics.
Steps of automation
- Create algorithms
- Implement them in program code
- implement models in data structures
- execute the code
Automation
Putting models (abstractions of real world things) into action to solve problems.
Set
An unordered collection of values in which each value occurs at most once.
| symbol
Such that
Finite set
One whose elements can be counted off by natural numbers up to a particular
number.
Countably infinite set
One that can be counted off by the natural numbers
Cardinality of finite set
The number of elements in the set.
Examples of infinite sets
Real numbers or natural numbers
⊂ Proper subset
