Review Notes for Quiz #2

The quiz on May 7 will cover material from the following
sections of Brassard and Bratley:

5.8 -- Binomial Heaps
5.9 -- Disjoint Set Structures (the Merge-Find Problem)
6.3 -- Graphs: Minimum Spanning Trees (Kruskal's and Prim's algorithms)
6.4 -- Graphs: Shortest Paths (Dijkstra's algorithm)
7.5 -- Finding the Median (the selection problem)
7.6 -- Matrix Multiplication (Strassen's algorithm)
7.7 -- Exponentiation
7.8 -- Putting It All Together: introduction to cryptography

You are responsible for understanding the algorithms discussed
in all the sections listed above (not just the algorithms
specifically named above).  You do not have to memorize the
algorithms.  However, if I give you the text of an algorithm I
will expect you to be able to describe exactly what the it
does, including showing the values it gives to its variables
and data structures as each statement is executed (not just the
output of the algorithm, but any intermediate values it
calculates).

In this particular quiz, I will not be asking you questions
that require you to do any big-O, big-theta, or big-omega
analyses.  I think that can wait until the third quiz.
Nevertheless, you will probably want to retain some of that
information in order to better prepare for this quiz.