Section | 1 |
---|---|

Instructor(s) | Brady, Geraldine (gb52) |

Location | JCL 011 |

Meeting Times | Tuesday 11am - 12:20pm Thursday 11am - 12:20pm |

Fulfills | Immersion Math |

**Course Description**

This course is an introduction to ideas and techniques from discrete mathematics that are used in computer science. It emphasizes mathematical proof and problem solving, employed on a variety of useful and interesting examples in counting, discrete probability, graphs, and basic number theory.

On completion of the course, students will be practiced in using mathematical concepts and techniques to solve problems, and in expressing mathematical notions precisely. They will be able to use ideas and techniques from discrete mathematics in subsequent courses in computer science, in particular courses in the design and analysis of algorithms, networks, numerical methods, software engineering, data analysis, and machine learning.

**Course Contents**

Topics covered include: methods of proof, including mathematical induction; number theory, incuding divisibility, prime numbers, and modular arithmetic; counting, including permutations, combinations, binomial theorem, pigeonhole principle, inclusion/exclusion principle; discrete probability, including conditional probability, independence, Bayes's theorem, random variables, expected value, variance; graphs, including graph isomorphism, Euler and Hamiltonian paths and circuits, trees, and graph coloring; recurrences and asymptotic notation. ** **

**RequirementsStudents are responsible for all material presented in class and on homework assignments.**

• Lectures: Students are responsible for all material presented in lectures.

• Problem sessions: Weekly problem-solving sessions are held on Saturdays. Students are responsible for material covered at the problem sessions. Class participation is encouraged.

• Homework: Weekly homework assignments are assigned after class and due the day before the next class. Students are required to submit homework electronically.

• Exams: There are four quizzes (weeks 3, 4, 9, and 10), a midterm exam (week 5), and a final exam (week 11). There will be no make-up exams.

**Course grade**

The course grade is based on homework, quizzes, and exams.

• Homework: 5%.

• Quizzes: 20% (5% for each of 4 quizzes).

• Midterm examination: 25%.

• Final examination: 50%.

**Textbook**

Discrete Mathematics and its Applications (7th edition) (McGraw-Hill) by Kenneth H. Rosen (ISBN 978-0073383095).

**Prerequisites**

Precalculus, especially logarithms and exponentials, is a prerequisite; calculus is recommended but not required. High-school level familiarity with sets, functions, relations, and mathematical notation will be assumed.

MPCS 50101 Concepts of Programming (completed or concurrently taking) OR successfully passing the Programming Placement exam.

MPCS Students only.

This class is scheduled at a time that does not conflict with any other classes this quarter.