Teaching Assistants:
Balasundaram Radheshyam (radhe@ucsd.edu)
Lawrence Shibu Stanroop (sslawren@ucsd.edu)
Tutors:
Jayaprakash Sneha (sjayapra@ucsd.edu)
Kuong Chao (knchao@ucsd.edu)
Justin Lai (jwlai@ucsd.edu)
Seto Chapman A ( caseto@ucsd.edu)
Thompson Hannah Nehir (hnthomps@ucsd.edu)
Classes: Monday, Wednesday, Friday 10AM - 10:50AM at WLH 2005.
Discussions (Optional): Wednesday 3PM - 3:50PM at CENTR 115.
Textbook for the course is "Mathematics for Algorithms and Systems Analysis" by E.A.Bender and S.G.Williamson.
Also one may refer to the following books:
"A short course in Discrete Mathematics" by E.A.Bender and S.G.Williamson
"Lists, Decisions and Graphs" by E.A.Bender and S.G.Williamson (Available online).
"Essentials of Discrete Mathematics" by David Hunter.
Office hours by the instructor will be by appointment only. Please email the instructor if you have any question regarding the course.
All TAs and tutors will conduct regular office hours. The schedule is give below:
Monday 3PM to 5PM by Lawrence Shibu Stanroop in B240A in the CSE building.
Tuesday 1PM to 3PM by Balasundaram Radheshyam in B250A in the CSE building.
Wednesday 6PM to 8PM by Chapman Seto in B260A in the CSE building.
Thursday 3PM to 5PM by Justin Lai in the Basement Hallway in the CSE building.
Friday 3PM to 5PM by Thompson Hannah in B260A in the CSE building.
Saturday 12:30PM to 2:30PM by Jayaprakash Sneha in the Basement Hallway in the CSE building.
Grades are based on Endterm (40%), a midterm (30%), around 6 quizzes (5% each).
Regular assignments will be posted every Wednesday. The assignments will not contain any marks. They will be for practice only. No need to hand in the assignments. Solutions to the assignments will be posted on the webpage on the following Monday of every assignment. Students are encouraged to solve the assignments and discuss them with the tutors, TAs and fellow students.
Lecture 1 (6th January): (pdf) Representing integers in different bases, sets and functions.
Lecture 2 (8th January): (pdf) Representing sets, functions and relations among objects.
Lecture 3 (10th January): (pdf) Introduction to Graphs.
Lecture 4 (13th January): (pdf) Induction on graphs.
Lecture 5 (15th January): Quiz 1 (pdf).
Lecture 6 (17th January): Problems on Graph Induction.
Lecture 7 (22nd January): (pdf) Induction on Graphs.
Lecture 8 (24th January): Counting.
Lecture 9 (27th January): Counting.
Lecture 10 (29th January): Counting.
Lecture 11 (31st January): (pdf) Counting.
Assignment 1 (8th January): (pdf).
Assignment 2 (15th January): (pdf).
Assignment 3 (22nd January): (pdf).
Assignment 4 (29th January): On WebWork.
Assignment 5 (7th February): On WebWork.
Assignment 6 (9th February): (pdf).
Midterm Review: (pdf).
Midterm Practice: (pdf).
Assignment 7 (21st February): (pdf).
Quiz 4 (5th March): (pdf).
Assignment 9 (9th March): (pdf).
Solution of Assignment 1: (pdf).
Solution of Assignment 2: (pdf).
Solution of Assignment 3: (pdf).
Solution of Assignment 6: (pdf).
Solution of Assignment 7: (pdf).
Solution of Assignment 8: (pdf).
Solution of Midterm Practice Test: (pdf).
Solution of Midterm: (pdf).
Solution of Quiz 1: (pdf).
Solution of Quiz 2: (pdf).
Solution of Quiz 3: (pdf).
Solution of Quiz 4: (pdf).
Solution of Quiz 5: (pdf).