1. What abstract data type do you use when implementing breadth first search?

a. FIFO

b. LIFO

c. Linked-List

d. Priority Queue

e. Array

2. When you are coding a depth first traversal of a graph, what abstract data structure must you use to store nodes that need to be processed.

a. FIFO

b. LIFO

c. List

d. Binary Tree

e. Priority Queue

3. For a connected graph of N nodes, how many edges would be in a minimum spanning tree?

a. One

b. N

c. N^2

d. N-1

e. N/2

4. A non-directed graph of must have a cycle if

a. any vertex can be reached from some other vertex.

b. the number of paths is greater than the number of vertices.

c. the number of edges is greater than or equal to the number of vertices

d. the number of paths is less than the number of edges.

5. For a connected graph of 3 edges and 3 nodes, how many different minimum spanning trees are there?

a. One

b. Two

c. Three

d. Four

6. A minimum spanning tree is a graph in which

a. the number of edges connecting all the vertices is as small as possible

b. the number of edges is equal to the number of vertices

c. all unnecessary vertices have been removed

d. every combination of two vertices is connected by the minimum number of edges