computational methods Flashcards

1
Q

problem decomposition

A

decompose problem into smaller subproblems so it is easier to solve,test,debug and maintain

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

divide and conquer

A

uses recursion to split the problem into seaprate task, each task is then sorted and combined to make a solution

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

use of abstraction

A

removing unnecessary pieces of data and keeping relevant pieces of data
saves memory,solve problem faster,reduce complexity

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

backtracking

A

uses recursion to move from one part of the problem to another
only used for sequential problems

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

Data mining

A

searching through unconnected data searching for correlations between components
the analysis of large data to provide new information

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

heuristics

A

guessing the best approach to solve a problem by reducing computation time

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

performance modelling

A

simulating or modelling the performance of a system before it is used

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

Identify ways performance modelling could be used to test the new system

A

Testing it with a large number of simultaneous orders (stress testing)
Testing it with a large number of customers/items/orders

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

use of computational methods

A

costs effective
time saving
but requires accurate data

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