Lecturer: Professor Daniel Kleitman
|
Teaching Assistant: Carly Klivans
|
Questions for Exam 1 (Take-home exam will consist of 5 of these questions.)
Exam 1 (due Wednesday Ocober16, 2002)
Exam 2 (due Monday November 25, 2002)
2. Sorting
4. Non-Adaptive Sorting: Batcher's Algorithm
6. Finding Efficient Compressions; Huffman and Hu-Tucker Algorithms
8. Coding for Error Correction: the Shannon Bound
10. Polynomial Codes and some lore about Polynomials
11. BCH Codes: Constructing them and finding the Syndrome of a Message
12. Correcting Errors in BCH Codes
13. Properties and Generalizations of our BCH Codes
16. Counting Trees
17. Symmetries
20. Secret Coding 2
22. Factoring II - Elliptic Curves
22. Factoring II - Elliptic Curves.pdf
23. The Finite Fourier Transform
23. The Finite Fourier Transform.pdf
24. FFT and Multiplication of Numbers
24. FFT and Multiplication of Numbers.pdf
25. Matrix Operations and Strassens Algorithm
25. Matrix Operations and Strassens Algorithm
Term paper26 and 27 Linear Programming
26 and 27 Linear Programming.pdf
Review Topics for Second Exam.pdf