Quiz CSIS-385: 9
Name____________________________________
1. We have actually learned two ways to compute the shortest path from a single source: (1) Dijkstras algorithm or (2) you can do a Breadth First Search from the source vertex. However, Breath First Search will only produce a shortest path for which types of graphs (Circle one). a. b. c. d. Complete Graphs Directed Graphs Un-weighted Graphs Directed Acyclic Graphs
2. Trees are actually graphs. Thus, you could run Dijkstras algorithm on a tree to find the shortest distance from a node to any other node. Explain why this would be pointless. 3. 4. If you worked for the Census Bureau and you had to implement an algorithm for sorting all U.S. residents (300 million) by their Social Security number 9 digits, which algorithm would be the fastest theoretically? The log2(300,000,000) = 28.16. Your computer has 8GB of RAM and a 9 digit integer be can sorted using 4 bytes. a. b. c. d. Quick Sort Radix Sort Counting Sort Bubble Sort Briefly explain your answer for partial credit:
5. Would your answer change if the government switched to a 16 digit Social Security number? a. Yes b. No Briefly explain your answer for partial credit.
6. Would your answer change if your algorithm had to be implemented on a computer with 512MB of Ram a. Yes b. No Briefly explain your answer for partial credit.
7. Given the following graph, show the last five update steps of Prims algorith...