Computational Methods Flashcards

1
Q

Abstraction and Decomposition

A

Applying techniques like abstraction and decomposition help to simplify the complexity of a problem and break it down making it easier to write an algorithm to solve the problem

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

Enumeration

A

Involves designing an algorithm that performs an exhaustive search and attempts all possible solutions until the correct one is found

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

Theoretical Approach

A

If a problem can be boiled down to pure theory, it becomes easy to represent using mathematical equations and due to computers being great at maths these problems are great candidates for being solved by an algorithm

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

Simulation

A

The process of designing a model of a real life system in an attempt to understand its behaviour

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

Automation

A

Building problem-solving models and putting them into action

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

Simulation and Automation

A

Both simulation and automation make heavy use of abstraction and are ways of turning complex problems into ones that can be more easily solved by algorithms

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

Problem Decomposition

A

The process of taking a large problem and breaking it down into several smaller parts making the problem more manageable and easier to understand

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

Divide and Conquer

A

A technique that reduces the size of a problem with each successive iteration

1.) Take a problem
2.) Apply some rules
3.) Based on the outcome of those rules, discard any data that doesn’t match
4.) Take the remaining data and start again from step 1

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

Back Tracking

A

The process of incrementally building towards a solution, abandoning partial success when the solution can’t be completed and going back to a previously successful match

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

Data Mining

A

Analysing vast amounts of data gathered from a variety of sources to discover new information and trends

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

Heuristics

A

Using experience and estimates to find a solution that can be considered “good enough”

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

Performance Modelling

A

The process of approximating how well models perform using mathematics

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

Pipelining

A

Splitting a large task into manageable 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
14
Q

Visualisation

A

Allows a user to create a mental image of what a program will do or how it will work

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