Graduate Algorithms

In problem 2, some students pointed out that there might be ambiguity in the question. Here’s what it’s asking: if you’re receiving gifts on the first day of christmas, the second, the third, all the way upto the nth day, what is the TOTAL number of gifts you receive over all days ?

In problem 3, although I asked for a randomized algorithm, any other one will do (the randomized one is easiest though :)). Also, what I’m primarily concerned with is showing that the requisite number of bichromatic edges exist in the coloring: you will not be docked points if you didn’t analyze the running time of your method.

In problem 5, you may assume (if you choose) that I tell you which White piece I want to move.

This entry was posted on Thursday, August 23rd, 2007 at 1:56 pm and is filed under Homework, News.