| Week | Dates | Assigns/Midterm | Sections | Topics | 1 | Jan 5-9 | ~ | Chapter 2 | Introd. to the course. Addition and multiplication of numbers and polynomials. Division with remainder. |
| 2 | Jan 12-16 | ~ | 3.1-3.2 | Euclidean and extended Euclidean algorithm. |
| 3 | Jan 19-23 | ~ | 3.2-3.3 | Correctness and analysis of extended Euclidean algorithm. |
| 4 | Jan 26-30 | ~ | 3.3; 4.1 | Analysis of extended Euclidean algorithm (cont). Applications to modular arithmetic. |
| 5 | Feb 2-6 | A1 handed-out | 4.2-4.4; 5.1-5.2 | Inverses in finite fields. Repeated squaring. Change of representation. Evaluation. |
| 6 | Feb 9-13 | ~ | 5.2-5.4 | Interpolation and an application: secret sharing. Chinese remainder theorem and algorithm. |
| 7 | Feb 16-20 | WINTER | BREAK | NO CLASSES THIS WEEK |
| 8 | Feb 23-27 | A1 handed-in; Midterm Test |
5.4 | Chinese remainder theorem and algorithm. Revision for midterm test. |
| 9 | Mar 2-6 | A2 handed-out | 5.4; 8.1; 12.1 | Cost analysis of Chinese remainder algorithm. Karatsuba's algorithm. Strassen's algorithm. |
| 10 | Mar 9-13 | ~ | 8.2 | Discrete Fourier transform. |
| 11 | Mar 16-20 | ~ | 8.3; 9.1 | Multiplication of polynomials and DFT. Newton iteration. Fast division with remainder. |
| 12 | Mar 23-27 | A2 handed-in | 9.1 | Newton iteration and fast division with remainder (cont). Selected topic: Groebner basis or symbolic integration/summation. |
| 13 | Mar 30 - Apr 3 | ~ | ~ | Selected topic: Groebner basis or symbolic integration/summation. Review of the course. |
Note. Sections and chapters are from the textbook: Modern Computer Algebra by Joachim von zur Gathen and Jurgen Gerhard.