Assigned:
Wed. September 4, 2002
Due:
Mon., September 9, 2002, in class
Points: 10 pts total. You will receive zero
points if this assignment is late!
Instructions
Please supply the following information:
- Name
- Program year
- Your email address:
- List relevant background courses and where you have taken them
(e.g. data strucutres, discrete math, algorithms, other advanced math
courses):
- How familiar are you with the following topics (None, Somewhat,
Very):
- Recurrences
- Proof by induction
- Big-O notation
- Probability
- Balanced search trees
- Graph algorithms
- NP-completeness
- Why are you taking this course?
Switch to:
cs2035@columbia.edu