I finished the quiz in just under a half an hour. I forgot a couple
formulae, but that's because I didn't study. I didn't find any of the
problems conceptually difficult. This quiz seems a bit more factually
oriented than the previous -- it seems like they need to remember more
specific items (e.g. the number of trees on n vertices, the closed
form of sum x^i, etc... not that I think this is unreasonable). I
liked problems 2 the most -- it ties together quite a few concepts.
The recurrence in problem 4 is pretty simple -- good difficulty for a
quiz. I definitely think this quiz will be fair. In is undoubtedly
easier than the first.

A couple of notes -- typo on page 6: "Cthere are seven sequences..."

On the solution to 2b (I know these aren't in synch with the quiz, so
maybe this is already fixed) -- it states that the number of connected
components is non-decreasing, but clearly we end up with a tree (with
1 connected component), having started with a possibly unconnected
graph. Should it be non-increasing, or am I missing something?