4.3.6 Optimisation Algorithms Flashcards

1
Q

What is the purpose of an optimisation algorithm?

A

To find the best possible solution to the problem posed.

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

What is the purpose of Dijkstra’s algorithm.

A

To find the shortest path between two nodes one being the root within a weighted graph.

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

Which of the following is not an example of where Dijkstra’s Algorithm is used:
1. Satellite navigation
2. Binary Tree Search
3. Packet routing

A

Binary Tree Search

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

What is heuristic technique?

A

Heuristic Technique is a method employed to solve a problem quickly when typical methods are too slow.

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

What is meant by an intractable problem?

A

A problem where there exists an algorithm to solve it but it cannot do so in a polynomial time. This often means useing a brute-force approach.

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