Remember to check the announcements frequently.

• Time & Place
  • Tu / Th 3:30 - 4:50; SOLIS 104 (lecture)
  • F 12:00 - 12:50; WLH 2204 (discussion section led by Samory)
  • F 3:00 - 3:50; PETER 104 (discussion section led by Qinke)
• Instructor
• Professor Fan Chung Graham (fan@ucsd.edu)
• Office hours: W 11:00-12:00; APM 7101
• Teaching Assistant
• Samory Kpotufe (skpotufe@cs.ucsd.edu)
  Office hours: Fr. 1-2:30 pm EBU3b B260A


• Qinke Wang (qiwang@cs.ucsd.edu)
  Office hours: Fr. 4-5 pm EBU3b B240A
• 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, and generating functions. Matrix notation. Applied discrete probability.
• Textbook
• Required:  Susan Epp, Discrete Mathematics with Applications, 3rd ed.
  The errata of this book can be found at http://condor.depaul.edu/~sepp/Errata3e.htm.
• Grading
• There will be two midterms and a final for the course. The better of your two midterm scores will count for 25% and the worse for 15%.  The final will count for 60%. Suggested homework problems will be assigned each Tuesday, but will not be collected or graded. However, since most of the test questions will be strongly based on these homework problems, it is definitely in your best interest to have a complete understanding of how to solve such problems.
• In addition, from time to time I will assign extra credit problems. These problems will be more challenging than the usual homework problems, and offer you a chance to really impress the instructor! 
• Schedule (subject to change)
    

• Date	Topic	Reading (Epp)
  1/10-12	Overview, Sequences, Induction	4.1-4.4
  1/17-19	Counting	6.1-6.3
  1/24-26	Combinations	6.4-6.5
  1/31-2/2	Binomial Coefficients, Midterm I	6.6 - 6.7
  2/7-9	Probability	6.8-6.9
  2/14-16	Functions	7.1 - 7.4
  2/21-23	Recursions	8.1 - 8.4
  2/28-3/2	Growth of Functions, Midterm II	9.1 - 9.2, 9.4
  3/7-9	Efficiency of Algorithms, Graphs I	9.3, 9.5, 11.1, 11.2
  3/14-16	Graphs II, Trees	11.4 - 11.6
  3/24	Final exam 3-6 pm	-