Review Questions in Advanced Algorithms
=======================================

1. What is the products of all roots of unity of degree n for n>2?

2. Write the inverse of F_4 explicitely.

3. Write an optimum speedup algorithm that multiplies n numbers on a 
   CREW PRAM in time O(log n).

4. Can you write an algorithm that multiplies n numbers on a 
   CREW PRAM in time O(1)? Why?

5. Consider the following strategy for the 3-server problem: move the 
   servers in round-robin fashion (i.e. 1,2,3,1,2,3, ...).
   Show that this strategy is not competitive.

The exam questions will be of similar flavor and difficulty.

Good luck!