External Flashcards

(14 cards)

1
Q

How many degrees in an hour?

A

15

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

Perpetuities formula

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

Confounding Variable

A

A confounding variable is used to predict a difference in the response variable.

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

Bivariate data

A

Bivariate data is two sets of related data.

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

What is a walk?

A

A walk is a sequence of verticies and edges along a graph.

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

What is a trail?

A

A trail is a walk with no repated edges, but may contain repeated verices.

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

What is a path?

A

A path is a walk with no repeated edges, and no repeated vertices.

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

What is a Hamiltonian Cycle?

A

A Hamiltonian Cycle is a closed path that visits every vertex of the graph. It will also start and end at the same vertex.

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

What is a Eularian Trail?

A

A Eulerian Trail is a closed trail that involves every edge of the graph.

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

What is a Semi-Hamiltonian Graph?

A

A Semi-Hamiltonian Graph is an open path that visits every vertex of the graph.

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

What is a Semi-Eularian Graph?

A

A Semi-Eularian Graph is an open trail that involves every edge of the graph.

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

What is a minimum spanning tree?

A

A tree that connects all the vertices in a graph

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

What is a simple graph?

A

A simple graph does not have any loops and does not have any multiple edges.

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

What is a complete graph?

A

A complete graph have an edge between every pair of verticies. Every vertex in a complete graph is connected by an edge to every other vertex int he graph. AKA, each vertex is connected to one another.

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