CMSI 282
Preparation for Quiz 2
To be held on April 29, 2008
==============================================================================

Good news, everyone!

On April 29, 2008, we will have a *warm up* for the Final Exam!  It will
be a 30 minute graded quiz.

You will not have to write any code on this exam.  You will instead have
questions such as:

  - Give the best and worst case complexity for a code fragment or two,
    using recurrence relations, of course!

  - Identify properties of a graph, run traversals of a graph,
    or find paths in a graph.  This problem might require you to
    demonstrate knowledge of the rich graph terminology we've seen.
    It might have something to do with MSTs, shortest path,
    Euler tour, Hamilton Cycle, number of blocks, chromatic number, a
    vertex cover, etc.

  - Draw pictures of a heap as elements get inserted and removed.

  - Show the steps of a sorting algorithm being applied to
    a particular array.

  - Solve a numeric equation with powers and mods and logs.

  - Decide if a greedy approach will work for a certain problem,
    and justify your answer.