Decision - Other Flashcards

1
Q

What is an algorithm?

A

A finite sequence of step-by-step instructions carried out to solve a problem

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

What is the order of an algorithm?

A

The order of an algorithm can be described as a function of its size. If an algorithm has order f(n), then increaasing the size of the problem from n to m will increase the run time of the algorithm by a factor of approximately f(m)/f(n)

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

What are isomorphic graphs?

A

isomorphic graphs are graphs that show the same information but may be drawn differently

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

What is an adjacency matrix?

A

A matrix providing information about the connections between vertices in a graph. Each entry in an adjacency matrix describes the number of arcs joining the corresponding vertices

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

What is a trace table?

A

A table used to record the values of each variable when you carry out an algorithm

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

What is a distance matrix?

A

A matrix where the entries represent the weight of each arc, not the number of arcs

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

What is the chinese postman algorithm?

A

Route inspection

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

When is a distance matrix symmetrical along the leading diagonal?

A

For any undirected graph

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