CSCE 750 - Analysis of Algorithms - Fall 2002

Dr. Duncan A. Buell

3A01 Swearingen, 777-2880, email ID is "buell" in domain "cse.sc.edu"

Meeting time: TTH 9:30-10:45, SWR 2A31

Office hours: TTH 10:45-11:45, SWR 3A01

Text: Cormen, Leiserson, Rivest, Stein, Intro to Algorithms, 2d edition, McGraw Hill.

This URL is www.cse.sc.edu/~buell/csce750/csce750_2002_4fall.html

  • Departmental syllabus for CSCE 750
  • General plan and outline for this semester
  • Tests and assignments
  • Lecture notes and pointers
  • Grading Scheme
  • Deadlines
  • Academic Honesty
  • Proper Use of Computing Resources
  • Outline for this semester

    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.

    Tests and assignments

    There will be two tests during the semester. The first test will be on 1 October 2002, timed so that you can get back your exams just before the deadline to drop.

    The final exam is scheduled for Thursday, 12 December 2002, at 9:00 am.

    Assignment 1, due 3 September 2002: Page 10, Exercises 1.1.1, 1.1.2, 1.1.5; Page 13, Exercises 1.2.2, 1.2.3, Problem 1.1; Page 21, Exercises 2.1.1, 2.1.4; Page 27, Exercise 2.2.2; Page 36, Exercises 2.3.1, 2.3.4; Page 38, Problem 2.3.

    Assignment 2, due 17 September 2002: Page 50, Exercises 3.1.1, 3.1.2; Pages 57ff, Exercises 3.2.2, 3.2.3, 3.2.7, Problems 3.1, 3.2, 3.3, 3.4;

    Assignment 3, due 26 September 2002: Page 67, Exercise 4.1.2; Page 72, Exercise 4.2.5; Page 75, Exercise 4.3.1; Page 85ff, Problems 4.1{b,f,h},4.4{a,h}.

    Assignment 4, due 24 October 2002: Postscript, pdf

    Assignment 5, due 7 November 2002: Page 192, Exercises 9.3.1, 9.3.2, 9.3.3, and also describe the parallel complexity of a SELECT algorithm. Page 208, Exercise 10.2.6. Page 216, Exercise 10.4.2. Page 256, Exercise 12.1.2, 12.1.5.

    Lecture notes and pointers

  • Lecture notes and pointers for Fall 2002
  • (Caveat: These notes are often change during the lecture process; if you print them too early and too often you may use up your print quota.)
  • Notes from the Spring 2002 course
  • Grading scheme

    The final grade will be computed on the basis of the weighted average of the scores in the two tests, the homework assignments, and the final exam. The weights will be 25% for each of the two tests, 25% for the final, and 25% 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.

    Deadlines

    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.

    Academic Honesty

    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.

    Proper Use of Computing Resources

    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.