1. How many arrays, each big enough to hold all the data, does it take to sort a heap? 2. In a graph, an _______ connects two _________ . 3. How do you tell, by looking at its adjacency matrix, how...

1.
How many arrays, each big enough to hold all the data, does it take to sort a

heap?

2.
In a graph, an _______ connects two _________ .

3.
How do you tell, by looking at its adjacency matrix, how many edges there are

in an undirected graph?

4.
In a game simulation, what graph entity corresponds to a choice about what

move to make?

5.
A directed graph is one in which

a.
you must follow the minimum spanning tree.

b.
you must go from vertex A to vertex B to vertex C and so on.

c.
you can go in only one direction from one given vertex to another.

d.
you can go in only one direction on any given path.