1.3.2 Databases Flashcards

1
Q

What is a Graph?

A

An abstract data structure used to show relationships between items.

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

What is a Node?

A

An item , or a peice of data

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

What is an Edge (or arc)?

A

A relationship between nodes

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

What is a weighted graph?

A

Each edge has a value, or a cost to traverse.

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

What is an unweighted graph?

A

Edges have no values or costs.

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

What is a directed graph?

A

Edges can only be traversed in one direction.

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

What is a depth-first traversal?

A

Read a graph by going as far down each route as you can before backtracking.

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

What is breadth-first traversal?

A

Read a graph by checking all the available routes from a node before progressing

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

What is a binary search tree?

A

A rooted tree where each node has a maximum of 2 children. Makes data easy to search.

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