2.2.2 computational methods flashcards

1
Q

what is meant by a computable problem?

A

a problem that can be solved using an algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

give 3 limiting factors to computable problems

A

processing power, processor speed, computer memory, time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

state 2 factors which may be considered during the problem definition phase

A

strengths and weaknesses of current solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

state 2 purposes of problem decomposition

A

develop sections in parallel, faster project delivery

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

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 to form the final solution to the problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

give 2 applications of divide and conquer

A

merge sort, binary search, quick sort

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

which programming construct do many problems solved using divide and conquer use?

A

recursion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

what is representational abstraction?

A

a computational technique in which excessive details are removed to simplify a problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

what type of abstraction is used to group together sections of the problem based on their functionality

A

abstractions by generalisation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

state 2 problem solving techniques

A

back tracking, data mining, abstraction, divide and conquer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

what might heuristics be used in problem solving?

A

when the standard way to solve the problem is unreasonably time consuming or resource-intensive

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

state 2 advantages of using performance modelling

A

safe, less time consuming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

what is pipelining?

A

A process in which tasks are developed in parallel. The output of one process in pipelining becomes the input of another, resembling a production line

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the name given to the technique used to identify patterns and trends in large sets of data?

A

data mining