F 5 an algorithm that runs in o2n runs faster than

F 5. An algorithm that runs in O(2n) runs faster than another version that runs in O(4n) .
T F 6. Every full binary tree is also a complete binary tree.
F 7. Twice the length of a minimum spanning tree (MST) is an upper bound on the Traveling
Salesman Problem (TSP).
F 8. Prim’s algorithm guarantees a minimum length solution, but Kruskal’s algorithm does not.
F 9. For any graph, a Minimum Spanning Tree (MST) can always be found using a greedy
algorithm.
T F 10. To calculate the shortest path from one node to all others in an unweighted graph we can use
a breadth-first traversal.
F 12. Given a min heap with more than two values, we can always find the two smallest values in
a min heap in constant time.

13. The following code using an explicit stack will display theNumber equivalent in binary,
with the digits in the correct order.
An Eulerian walk is a trail in a graph which visits each edge exactly once.
14. There is a Eulerian walk for the following graph:
F 15. There is a Eulerian walk for the following graph:
T F 16. A heap of n elements stored using an array representation in an array of size n takes less
storage than an equivalently sized linked representation.
CS 251, Midterm #2, Spring 2015 page 2