1. Backtracking algorithms are based on breadth-first recursive search. A. True B. False

2. The minimum spanning tree of an undirected graph G exists if and only if G is connected. a. True b. False

3. The searching algorithm of ordered array is faster than regular array, but the insertion time is slower than regular array. a. True b. False

4. The depth-first search algorithm can be based on a queue; the breadth-first search algorithm can be based on a stack. a. True b. False

5. In a weighted graph, the minimum spanning tree (MST) tries to minimize the number of edges connecting all the vertices. a. True b. False

6. In many situations the array is the first kind of structure you should consider when storing and manipulating data, especially the amount of data is reasonably small. a. True b.False

7. A topological sort can be carried out only on a DAG, a directed acyclic (no cycles) graph. a. True B. False

8. The last node in a heap is always on the bottom row.

A. True b. False