2.2.2 Computational methods Flashcards

1
Q

What are the features that make a problem solvable?

A

-abstraction and decomposition
-enumeration
-theoretical approach
-simulation and automation

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

How do abstraction and decomposition make a problem solvable?

A

Simplify the complexity of a problem and break it down makes it far easier to write an algorithm to solve a problem

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

How does enumeration make a problem solvable?

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
4
Q

How does a theoretical approach make a problem solvable?

A

If a problem can be boiled down to pure theory, I becomes easy to represent using mathematical equations

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

How do simulation and automation make a problem solvable?

A

-Simulation is the process of designing a model of a real system in an attempt to understand its behaviour.
-Automation is about building problem solving models and putting them into action
-they both make heavy use of abstraction to turn complex problems into more easily solved problems

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

What are the key principles of computational methods?

A

-decomposition
-pattern recognition
-abstraction
-algorithms
-calculations and storage

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

What is problem recognition?

A

The ability to:
“Recognise and acknowledge that an issue exists or that a situation needs attention in an existing process or program”.​
“Define the problem and determine exactly what it is.”​

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

What is problem decomposition?

A

“The process of taking a large problem and breaking it down into several smaller problems.”​
-not all problems are easily broken down by a top-down approach

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

What is a good way of tackling problem decomposition?

A

step wise refinement to produce a top-down modular design

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

What is the aim of problem decomposition?

A

To end up with small independent modules, which can then be written by a single person or a small team

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

What is the divide and conquer technique?

A

A technique that reduces the size of a problem with each successive iteration
-can also refer to the concept of splitting a task down into smaller tasks, which are then tackled separately (similar to decomposition)

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

What is backtracking?

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
-Logic problems, especially those that involve paths or route-finding, can particularly benefit from using backtracking as an approach

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

What is data mining?

A

-the concept of analysing vast amounts of data gathered from a variety of sources to discover new information and trends
-It is often associated with the concept of Big Data which refers to extremely large data sets

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

Who is data mining used by?

A

-Used by companies to help them maximise their profits

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

Practical application of data mining:

A

-Weather modelling​
-Science and engineering​
-Medical research​
-Law enforcement​

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

What is heuristics?

A

-an approach to solving problems that allows or even encourages us to make use of our experience and find a solution that can be considered “good enough”.​
​-do not guarantee the best solution

17
Q

What is a heuristic approach to solving a problem?

A

-We take previous experiences into account, apply them to the problem and make an educated guess

18
Q

What is performance modelling?

A

-the process of approximating how well models perform using mathematics
-can then be used to calculate how the servers would perform under more stress

19
Q

What is pipelining?

A

-splitting a large task into manageable chunks and overlapping these smaller processes to speed up the overall process

20
Q

What is visualisation?

A

-allows us to create a mental image of what a program will do or how it will work
-it makes it easier to understand
-this is why we often use flow diagrams to illustrate the logic of an algorithm

21
Q

Advantages of visualisation:

A

-Visualisations present the information in a simpler form to understand​
-Visualisations can best explain complex situations