From the course catalog:
This course explores advances in algorithm design, algorithm analysis and data structures. The primary focus is on randomized and approximation algorithms, randomized and advanced data structures, and algorithmic complexity. Topics include combinatorial algorithms for cut, packing, and covering problems, linear programming algorithms, approximation schemes, hardness of approximation, random search trees, and hashing.
Let's keep it simple. There are 11 tutorial meetings. I'll grade the work you present at each meeting on completeness, clarity, and comprehension. Your course grade will be the average of your weekly grades.
Each week there will be a handout containing a topic accompanied by readings, questions, and problems.
Readings and written responses to questions should be finished and exchanged with your tutorial partner at least 2-3 days before the tutorial meeting. You should critique your partner's responses and be prepared to present both your written solutions and critiques during the tutorial meeting. Additionally, you and your partner should be prepared to present solutions to the problems on the board.