CSE 21
Mathematics for Algorithm and Systems Analysis
Fall, 2009



Midterm II will be given on Wednesday, Nov. 18 at the usual time and place. As usual, it will be closed book. However, you can bring one sheet of handwritten notes (both sides) if you wish. Also, calculators are allowed but won't be needed. Here is a Practice Midterm.



Lecturer: Professor Ron Graham (graham@ucsd.edu)

Office hours: W 3:00 - 4:00 (and by appointment) in EBU 3B 2138

TA's:
Matus Telgarsky (mtelgars@cs.ucsd.edu)
Wenbo Zhao (w3zhao@ucsd.edu)

Office hours: For now, Thursday discussion section.

Lecture: M W 5:00 - 6:20 p..m.

Place: CENTR 113

Discussion Sections:
M (concepts, tricky problems) HSS 1330 12:00p - 12:50p
Th (questions, hw help/hints, related examples) Peter 104 6:00p - 6:50p

Course Objectives: This course introduces mathematical tools for the qualitative and quantitative analysis of algorithms and computer systems. It also explores the mathematical theory of discrete structures useful in modeling computational processes and hence in designing the same. Topics to be covered include basic enumeration and counting techniques; recurrence relations; graph theory; asymptotic notation; elementary applied discrete probability. Other related topics will be presented as time permits.


Course Description: This course will provide an introduction to the discrete mathematical tools needed to analyze algorithms and systems. Enumerative combinatorics: basic counting principles, inclusion-exclusion, generating functions and applied discrete probability.

Textbook: Schaum's Outlines Series: Discrete Mathematics (3rd edition) by S. Lipschutz and M. Lipson.
The Bookstore has copies. Also, you can get it on Amazon for a few dollars less.

Note: I won't follow the textbook presentation exactly, but rather use it as a guideline for the material to be covered. Lecture notes will be posted for material given in class that is not in the text.

In addition, I will occasionally post extra credit problems which typically are a lot harder than the homework problems, but solving any of them would definitely impress the instructor!

Approximate reading assignment schedule:
Remarks: You should check the Announcements link frequently. It will contain the latest information concerning possible changes in office hours, reading assignments, etc.

Announcements | Grading Policy | Homework | Extra Credit