2.2.2 - Computational methods Flashcards

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

tractable vs intractable problems

A

tractable = any problem that can be solved in polynomial time or better.

intractable = any problem that cannot be solved in polynomial time or better.

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

What is performance modelling?

A

The process of approximating how well models perform using mathematics.

EG - A company could test a high-end cloud server farm at max capacity putting a lot of stress on their hardware. This is expensive and time-consuming. Instead, mathematical modelling can calculate how the servers would perform under stress.

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

What is pipelining?

A

Splitting a large task into small chunks and overlapping these smaller processes to speed up the overall process.

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

What is visualisation?

A

Allows us to create a mental image of what a program will do or how it will work before we start to solve it.

Humans naturally respond well to visual representations.

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

What is heuristics?

A

Make use of independent experiences to get to a problem that is “good enough”.

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