Assignments for CS717 (as of 16jan06)
There will be an assignment every week, due at beginning of class the following
In dealing with homework problems, you may take as proven any homework problem
preceding it in the notes. On the other hand, it is not cricket to use,
unproven, results that follow the problem in the notes.
The instructor welcomes
cooperation among students and the use of books. However, handing in
homework that makes use of other people's work (be it from a fellow
student, a book or paper, or whatever) without explicit acknowledgement is
considered academic misconduct.
- 1. (due 9 sep): I.7 (i.e., H.P.(7) in Chapter I; it happens to be on
- 2. (due 16 sep): I.9, I.11, I.13, I.18.
- 3. (due 23 sep): I.20, I.24, I.28, I.36.
- 4. (due 30 sep): I.39; II.1; either II.4 or II.8; II.9.
- 5. (due 07 oct): either II.18 or II.19; II.22; II.25; II.29.
- 6. (due 14 oct): III.4; III.10; III.13; III.17.
- 7. (due 21 oct, in my CS mail box): III.20; IV.1; IV.2.
- 8. (due 28 oct): I changed my mind re this homework; Auerbach's theorem
may be too tricky without further hints and explanations. So, do instead IV.5
- 9. (due 11 nov): IV.7; (IV.12 optional); IV.13; IV.14; V.2; V.4.
- 10. (due 18 nov): V.13; V.20; V.22; VI.1.
- 11. (due 25 nov): VI.5; VI.9 (this might be hard); VI.14; VI.19.
- 12. (due 04 dec): VII.9; VII.13.
- 13. (due 13 dec): VII.18; VIII.1; VIII.2; VIII.4; IX.7.
- that is the last assignment.