Exam 2 FAQ

I can't say too much about Exam 2 because my hints may be jumping ahead of how you're thinking about the problem. This page mostly covers clarifications.

• Clarifications on problem 1.
  • You cannot assume that the number of cookies are a power of 2.
  • All the nonpoisonous cookies are of an equal weight.
• Clarifications on problem 2.

  This is more a clarification in your understanding of the problem: What does n represent in this problem?

  The starter code I provide is just for helping you think about the problem. You do not know how long the actual input size/function is--it's infinite.

• Clarifications on problem 3.

  When I ask "What is the total waiting time of all customers?", I am looking for a formula, not an example with a total value.

  Customers all get mad at the same rate.

• Clarifications on problem 4.

  You are given k air horns, but you don't know beforehand if k is enough airhorns to cover the given holes.

  The output should be "no" or "yes and here is where to place the airhorns". You don't care about covering as many airhorns as possible if you don't have enough airhorns.

  Hedgehogs and groundhogs are the same thing.

• General reminders
  • You may use my lecture notes/slides, your notes, your journals, the textbook. You may not talk to anyone else nor can you use the Internet.

Honor Code Policy

Open brain, your notes, your (and only your) problem sets, solutions on Sakai, your wiki, my slides, and the textbook.

Closed everything else.

There should be no discussion of the exam with peers, e.g., nothing about how hard/easy it is, how much time certain problems take to solve, what types of problems there are, etc. There will be plenty of opportunities to discuss the exam after the submission deadline.