CSC478/2412 (Spring 1997) Assignment 3 grading scheme

Created April 3, 1997

Here's the grading scheme for assignment 3. The average was 47.4 out of 54, or something near 87.5%.

1. algorithm: 4 marks
  uniqueness: 2 marks
2. big O estimate: 3 marks
3. computing a sample U: 3 marks
1. solving recurrences: 4 marks
  upper and lower bounds: 2 marks
  conclusion: 1 mark
2. space requirement, including big O in terms of n: 3 marks
1. two complex numbers: 3 marks
2. three complex numbers: 1 mark
3. n complex numbers, including number of Real multiplies: 3 marks
1. evaluate FFT for A and B: 4 marks
2. point-wise product and reconstruction of C: 3 marks
3. implementation and check of example: 5 marks
1. decomposition: 2 marks
2. symmetry condition and proof of sufficiency: 3 marks
3. proof that a primitive root of unity satisifies the symmetry condition: 3 marks
4. runtime estimate: 2 marks
5. the 3-way FFT algorithm in Maple-like detail: 3 marks

The total number of marks is 54.