Mathematics for Computer Science: Discrete Mathematics
Title  Mathematics for Computer Science: Discrete Mathematics (50103) 

Quarter  Summer 2017 
Instructor  Geraldine Brady (gb52@uchicago.edu) 
Website  http://people.cs.uchicago.edu/~brady/MPCS50103/ 
Syllabus  Course Description
Course ContentsTopics covered include: logic and proof; mathematical induction; modular arithmetic; basic counting, permutations, combinations, binomial theorem, pigeonhole principle, inclusion/exclusion; discrete probability spaces, conditional probability, independence, Bernoulli trials, Bayes's theorem, random variables, expected value, variance, geometric and binomial distributions; graphs and trees; recurrences and methods of solving simple recurrences.Requirements
Course gradeThe course grade is based on homework, quizzes, and exams.
TextbookDiscrete Mathematics and its Applications (7th edition) (McGrawHill) by Kenneth H. Rosen (ISBN 9780073383095).Web page
Course information, announcements, assignments, and supplemental material can be found on the course web page:http://people.cs.uchicago.edu/~brady/MPCS50103/ Class Dates:
First class: Tuesday June 20
Lectures: Tuesdays 5:30–8:30 pm in Ryerson 251
* No lecture July 4; makeup lecture Thursday, July 6 5:30–8:30 pm Last Class will meet Tuesday, August 22th, 5:30–8:30 pm
Final Exam — Thursday August 24th, 5:30–8:30 pm
Problemsolving sessions: Saturdays 12:00 noon–2:00 pm in Ryerson 251

Prerequisites (Courses)  
Prerequisites (Other)  Only MPCS students can register for this course. 
Satisfies  Immersion 
Time  Tuesday 5:308:30pm 
Location  Ryerson 251 