This is a huge book. We will by no means do all of it. Some supplemental material on parallel algorithms will also be added from time to time.
I have had established a CSE department email list for CSCE 750. You are responsible for putting your name on this list. This can be done by following the links from the departmental web page. You can put in this mail list any address you choose that gets mail to you.
A mass mailing to the entire class will be done through the mail alias csce750 mentioned above. If I need to initiate an email to you individually, I will do so using the CSE departmental account that all students get as part of being registered in this class. You are responsible for reading email sent to this account or else setting up the dot forward file to send it on to an account that you do read regularly.
There will be one exam during the semester and a final exam. The first test will be on 29 September 2003 and will be returned on 1 October 2003, timed so that you will get back your exams just before the 2 October 2003 deadline to drop without receiving a WF grade.
The final exam is scheduled for Saturday, 13 December 2003, at 2:00 pm.
Assignment 1, due (at my office) Friday noon, 5 September 2003: Page 1062, Exercises A.1-1, A.1-6; Page 1067, Exercises A.2-1, A.2-2, A.2-4; Page 10, Exercises 1.1-5; Page 13, Exercises 1.2-3; Page 27, Exercise 2.2-1; Page 50, Exercises 3.1-1, 3.1-2, 3.1-4.
Assignment 2, due by noon Tuesday, 16 September 2003: Page 57, Exercises 3.2-3 Page 58, Problem 3.3a (do the second row only!) and 3.3b Page 59, Exercises 3.4a, 3.4d, 3.4f PROBLEM: Describe a function f(n) for which there is a function g(n) such that f(n) = Omega(g(n)) in the original definition of Omega(.) but NOT Omega(g(n)) under Knuth's definition of Omega(.). Page 67, Exercises 4.1-2, 4.1-5.
Assignment 3, due 29 September 2003: Page 67, Exercise 4.1.6; Page 72, Exercise 4.2.4; Page 75, Exercise 4.3.2, 4.3.4; Page 85ff, Exercise 4.1.a, 4.1.c, 4.1.e, 4.4.b, 4.4.e, 4.4.i.
Assignment 4, due at class time 15 October 2003: Page 129ff, Exercise 6.1.3, 6.1.4, 6.1.6; Page 132, Exercise 6.2.3, 6.2.6; Page 136ff, Exercise 6.4.3, 6.4.4; Page 140ff, Exercise 6.5.6, 6.5.8.
Assignment 5, due at class time 27 October 2003: Page 148, Exercise 7.1.3; Page 153, Exercise 7.2.4; Page 168, Exercise 8.1.3; Page 173, Exercise 8.3.4; Page 178, Exercise 8.2; Page 193, Exercise 9.3.7.
Assignment 6, due at class time 3 November 2003: Page 222, Exercise 11.1.2; Page 256, Exercise 12.1.2, 12.1.5; Page 260, Exercise 12.2.5; Page 277, Exercise 13.1.6; Page 287, Exercise 13.3.5;
"Assignment 7"; quiz 12 November 2003, see new rules under Academic Honesty: Page 501, Exercises 21.1.3; Page 530, Exercises 22.1.1, 22.1.3, 22.1.4, 22.1.6; Page 539, Exercises 22.2.2, 22.2.3, 22.2.8; Page 548, Exercises 22.3.4, 22.3.8;
"Assignment 8"; quiz 3 December 2003, see new rules under Academic Honesty: Page 978, Exercises 34.1.2, 34.1.3, 34.1.5; Page 983, Exercises 34.2.2, 34.2.7; Page 994, Exercises 34.3.1, 34.3.2; Page 1002, Exercises 34.4.1, 34.4.5;
The final grade will be computed on the basis of the weighted average of the scores in the exam, the final exam, and the homework assignments. The weights will be 40% for the exam, 40% for the final, and 20% for the assignments. The final grades will be curved, but you should expect no lower a grade than you would receive under the usual 90/80/70/60/50 scheme.
Homework assignments will have due dates and will be turned in at the beginning of the class period on the due date. Late assignments will not be accepted without prior arrangement to accommodate truly extraordinary circumstances.
Assignments and examination work are expected to be the sole effort of the student submitting the work. Students are expected to follow the Code of Student Academic Responsibility. Every instance of a suspected violation will be reported. Students found guilty of violations of the Code will receive the grade of F for the course in addition to whatever disciplinary sanctions are applied. Some good sources of text for what is or is not acceptable behavior are the academic honesty policy statement from Harvey Mudd College, the statement from Professor Steven Huss-Lederman at Beloit College, and the text of part of the statement from MIT.
A sample first-offense admission can be found at admission.
New Rules as of 5 November 2003: It is becoming increasingly impossible to distinguish much of your work from the work that is posted, sometimes in violation of copyright, on the web. I have decided not to try to make those distinctions or to second-guess your process of answering homework questions. I will therefore assign "homework" questions. You are free to use any source available to you in learning how to answer the questions. This includes other texts and the web. Instead of having you turn in all the homework, there will be a quiz each Wednesday at the beginning of class. The quiz will be one or two questions selected from that week's homework questions. The quiz will be closed book. If you can memorise an answer long enough to re-create it for the quiz, then I will not worry about the provenance of that answer.
Students are expected to be aware of the university policy on use of computing resources, including the Student Guidelines for Responsible Computing, as well as the college and departmental policies on proper use of computing resources. Every instance of a suspected violation will be reported.