Syllabus for CSE 101: Algorithms
Fall, 2004

This page (check it frequently): http://www.cse.ucsd.edu/classes/fa04/cse101/index.html

Announcements:

• A brief list of topics to be covered is available here. Now with chapters from the textbook.

Lectures: Tuesday, Thursday 8-9:20am, Pepper Canyon Hall 109.

Instructor: Josh Buresh-Oppenheim
Email:
Office Hours: Tuesday, 10am-12pm, AP&M 4131.

Discussion Sessions:

• Monday, 3-3:50pm, HSS 1330
• Monday, 5-5:50pm, SOLIS 104

TAs: Sashka Davis, Ragesh Jaiswal, Steven Huang, Qian Peng.

TA Office Hours: All in EBU-1 6307.

• Steven Huang: Wednesday, 12-1pm
• Qian Peng: Wednesday, 4-5pm
• Sashka Davis: Thursday, 9:30-10:30am
• Ragesh Jaiswal: Friday, 3-4pm

Text (Recommended): Introduction to Algorithms, by Cormen, Leiserson, Rivest and Stein (second edition).

Marking Scheme:

• 4 Homeworks worth 15% each (tentative due dates are: October 14, November 2, November 18, December 2 at the beginning of lecture)
• 1 Midterm worth 10% (on November 9)
• 1 Final worth 30% (on December 7, 8am)

Lateness: No late submissions will be accepted.

Collaboration and Plagiarism: Collaboration can be very instructive. You are encouraged to discuss concepts and problems with your fellow students. All homework, however, must be written alone and must be your own work. Obviously any communication during exams will not be tolerated. Violations of this policy will be prosecuted by the university.

Homeworks Posted Here:

• Guidelines for writing homeworks (might be updated)
• Guidelines for homework regrades (might be updated)
• Calibration Homework: PS PDF
• Homework 1: PS PDF
• Homework 2: PS PDF
• Homework 3: PS PDF
• Homework 4: PS PDF

Exams:

• Midterm Solutions: PS PDF Stats

Lecture Notes Posted Here (after lectures):