# CSC478/2412 (Spring 1997) Assignment 4 grading scheme

Updated March 21, 1997
April 15, 1997: 9 marks for implementation of DDF is reduced to 4 marks because EDF is not required.
Quote of the page:
A student: ``It would be nice to have a grading scheme for the next assignment.''

The tutor: ``Yes, it would be nice.''

Here's the grading scheme for assignment 4.
1. 5 marks.
• Implementation, including correctness and style: 7 marks
• At least three good examples: 3 marks
• Square-free factorization over integers: 4 marks
• Square-free factorization over integers mod 3: 2 marks (since many of the steps might be the same, but you still have to show all the work)
• Implementation, including correctness and style: 9 marks
April 15, 1997:These 9 marks have been reduced to 4 marks because equal degree factorization is not required. My apologies.
• Examples from 8.17: 3 marks
• Derivation: 6 marks
• Implementation, including correctness and style: 4 marks
• Listing of all the irreducible polynomials of degree 4 over the integers mod 2: 4 marks

Please sort this list into dictionary order. That is, a polynomial of degree 4 over Z_2 may be viewed as a string of 5 zeroes and ones (the coefficients from highest degree on the left to lowest degree on the right). Then you determine the relative ordering of two polynomials by comparing their corresponding strings of coefficents.

For example: x^4+x^3+1 corresponds to the string 11001, and x^4+x corresponds to the string 10010. The list of these two polynomials in dictionary order would be:

```			x^4+x
x^4+x^3+1
```
In addition, you can even list the coefficient strings. (This would be easier to grade. (Hint hint.)) In this case, this coefficient string list would be:
```			10010
11001
```
The total number of marks is 42.

Back to the CSC478/2412 Computer Algebra course page
Back to David Neto's teaching page