2.2.2 Computational methods - Filip Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

define decomposition

A

breaking down a large problem into lots of small problem which re more manageable

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

define abstraction

A

ignoring insignificant/ unnecessary details

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

define back tracking

A

methodically going down every possible path then going back on yourself once you find an error

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

define data mining

A

a technique used to find anomalies/ patterns in large sets of data

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

define hueristics

A

rules of thumb which are a non exact result

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

define pipelining

A

different tasks being undertaken at the same time to improve efficiency

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

define performance modelling

A

Performance modelling eliminates the need for true performance testing by providing
mathematical methods to test a variety of loads on different operating systems.

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

what’s divide and conquer

A

in this context divide and conquer refers to a way of decomposition involving divining then solving then merging parts of a larger problem back together

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