Exam 1 FAQ
I can't say too much about Exam 1 because my hints may be jumping ahead
of how you're thinking about the problem. This page mostly covers
clarifications.
- Clarifications on problem 2.
You may want to think about the final answer/output to the
problem as truncated itineraries. For example, the
schedule for hipster 1 ends on day 3, and the schedule for
hipster 2 ends on day 2. So, a hipster will not necessarily
visit all the coffee shops for his final schedule.
The original itineraries for the hipsters (the input to the
problem) have the hipsters visiting each coffee shop during the m
days.
- General reminders
- Analyze the correctness and runtime of each algorithm you
create. That's the rules of algorithm design
and analysis--we always need to analyze the runtime of
our algorithm. (Remember the process we outlined for the
Stable Matching problem.)
- Even though I give hints about how to solve a problem, make
sure you state the algorithm from the given input--not the
state that I hint you should use for the algorithm.
- 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.