CSE 21: Mathematics for Algorithms and Systems (Winter 10)
Instructor: Joseph Pasquale
(office hours: Thu 5:30-6:30 or by appt, EBU3B 3112)
Teaching Assistant: Albert (Yonghahk) Park
(office hours: Wed 10-11, Fri 11-12, APM Annex, Room 1832)
Teaching Assistant (half-time): Chengmo Yang
Tutor: Mohammad Zohour
(office hours: Mon 5-6pm, Thu 7-10:30pm, Fri 3-4pm, EBU3B B250A or if busy, B250)
Lectures: Tue/Thu 3:30-4:50, CENTR 113
Discussion: Fri 10:00-10:50, CENTR 113
The course is completed. Best wishes with your future studies at UCSD.
This course will provide an introduction to the discrete mathematical tools
needed to analyze algorithms and systems. Topics will include
combinatorics, discrete probability, graph theory, algorithmic analysis.
The course is organized of the following:
Lectures: the lectures comprise the core material
Discussion: the discussion sections are led by the TA, and may be
organized as discussions on specific topics or question/answer sessions
Readings: the readings in the textbook supplement the lectures
Homework: homework problems will be assigned every week
Exams: there are two midterm exams and a final exam (all closed-book)
covering the material presented in the lectures
20% Midterm exam 1 (Tues, Jan 26, in class)
30% Midterm exam 2 (Thur, Feb 25, in class)
50% Final exam (Tues, Mar 16, 3:00pm-5:59pm)
Textbook: Essentials of Discrete Mathematics, by David J. Hunter,
Jones and Bartlett Publishers, 2009.
The book has a small number of errors. Here is the
as of Nov. 3, 2009
(the latest copy can always be found at the
publisher's web site).