CPSC 411: Quiz 3
September 11, 2008

Printed Name:________________________________________

"On my honor, as an Aggie, I have neither given nor received unauthorized aid on this academic work. In particular, I certify that I have not received or given any assistance that is contrary to the letter or the spirit of the collaboration guidelines for this assignment."


  1. (1 pt) What is the greedy algorithm design paradigm?

  2. (2 pts) True or False: If every edge in a graph has a unique weight, then the minimum spanning tree (MST) of the graph is unique.

  3. (2 pts) Why is Kruskal's MST algorithm greedy?