There is a curve: add 2 to your raw score (given out of 50)
Some particular comments:
Went pretty well.
I faked some of you out by my "in other words" remark. I misspoke!
Biggest problem: not seeing the forests for the
trees.... ooh, sorry about that!
I asked for a recurrence relation, but few gave one.
If you suggested a sequential search, then you
should have been consistent in giving your answers in c
and d. If you went with a divide and conquer (which is
what we talked about in class), then you should be
consistent with that.
Make sure that your answer makes sense. Try some simple
cases. How many weighings would it take if there were 2
coins? How about 3?
Can't use RAN2 when there are false
intersections. So it's not useful for diagnosing
planarity from a given graph (unless there are no false
intersections, in which case it will work).
I was thinking that you might go with the identity
mapping $n \longrightarrow \{n\}$; you do need to
handle the case of the empty set.