Font size
S
M
L
XL
Worksheets2.2.2 Computational methods
Total questions: 19
Worksheet time: 10mins
Name
Class
Date
1.
What is meant by a computable problem?
a)
A problem that can be solved using an algorithm
b)
Bees
c)
A problem solved by a computer
d)
A problem that cannot be solved
2.
Give three limiting factors to computable problems
a)
Processing power
b)
Processor speed
c)
Computer memory
d)
SSD size
3.
State one factor which might be considered during the Problem Definition phase
a)
Strengths and weaknesses of current solution
b)
Previous systems
c)
Problem decomposition
d)
Develop sections in parallel
4.
What is the name given to the process in which problems are continually broken down until each subproblem can be represented as a subroutine?
a)
Problem decomposition
b)
Problem Definition
c)
Divide and Conquer
d)
Abstraction
5.
State two purposes of problem decomposition
a)
Identify sections which can make use of pre-coded modules or libraries
b)
Simplify project management
c)
Strengths and weaknesses of current solution
d)
Develop sections in parallel
6.
State two purposes of problem decomposition
a)
Develop sections in parallel
b)
Simplify testing and maintenance
c)
Backtracking
d)
Data mining
7.
Describe how the Divide and Conquer technique works
a)
The problem size is halved with every iteration. Each individual subproblem is then solved recursively. The solutions to the subproblems are then recombined o<br />form the final solution to the problem.
b)
A computational technique in which excessive details are removed to simplify a problem
c)
Identify sections which can make use of pre-coded modules or libraries
d)
The backtracking algorithm works by methodically visiting each path and building a solution based on the paths found to be correct. If a path is found to be invalid at any point, it backtracks to the previous stage and visits an alternate path.
8.
Give two applications of divide and conquer
a)
Merge sort
b)
Binary search
c)
Dijkstra's
d)
A-Star
9.
Which programming construct do many problems solved using Divide and Conquer use?
a)
Recursion
b)
Backtracking
c)
Pipelining
d)
Data mining
10.
What is representational abstraction?
a)
A computational technique in which excessive details are removed to simplify a problem
b)
Identify sections which can make use of pre-coded modules or libraries
c)
The problem size is halved with every iteration. Each individual subproblem is then solved recursively. The solutions to the subproblems are then recombined to form the final solution to the problem.
d)
The backtracking algorithm works by methodically visiting each path and building a solution based on the paths found to be correct. If a path is found to be<br />invalid at any point, it backtracks to the previous stage and visits an alternate path.
11.
What type of abstraction is used to group together sections of the problem based on their functionality?
a)
Abstraction by generalisation
b)
Identify sections which can make use of pre-coded modules or libraries
c)
The backtracking algorithm works by methodically visiting each path and building a solution based on the paths found to be correct. If a path is found to be<br />invalid at any point, it backtracks to the previous stage and visits an alternate path.
d)
The problem size is halved with every iteration. Each individual subproblem is then solved recursively. The solutions to the subproblems are then recombined to form the final solution to the problem.
12.
State two problem solving techniques
a)
Backtracking
b)
Data mining
c)
Recursion
d)
Dijkstra's
13.
State two problem solving techniques
a)
Abstraction
b)
Divide and conquer
c)
Merge sort
d)
Binary search
14.
State two problem solving techniques
a)
Pipelining
b)
Backtracking
c)
Easier to code
d)
Separate into small, sections
15.
Describe how backtracking works
a)
The backtracking algorithm works by methodically visiting each path and building a solution based on the paths found to be correct. If a path is found to be invalid at any point, it backtracks to the previous stage and visits an alternate path.
b)
Identify sections which can make use of pre-coded modules or libraries
c)
The problem size is halved with every iteration. Each individual subproblem is then solved recursively. The solutions to the subproblems are then recombined to form the final solution to the problem.
d)
The backtracking algorithm works by skipping and building a solution based on the answers found to be correct.
16.
When might heuristics be used in problem-solving?
a)
When the standard way to solve the problem is unreasonably time-consuming or resource-intensive
b)
Bees
c)
Identify sections which can make use of pre-coded modules or libraries
d)
Find the shortest path
17.
State two advantages of using performance modelling
a)
Relatively inexpensive
b)
Less time-consuming
c)
Adds to documentation
d)
Useful for small programs
18.
What is pipelining?
a)
A process in which tasks are developed in parallel. The output of one process inpipelining becomes the input of another, resembling a production line.
b)
Multiple processes done simultaneously.
c)
Multi-core CPU
d)
RISC
19.
What is the name given to the technique used to identify patterns and trends in large sets of data?
a)
Data mining
b)
Problem Decomposition
c)
Problem Definition
d)
Abstraction
Reset
