Description

This course covers the basic concepts of discrete mathematics used in computer science and other disciplines that involve formal reasoning. The topics include logic, proof, counting, discrete probability, relations, graphs, trees, and Boolean algebra.

Lectures

_ COB2 140, Monday and Wednesday 3:00 pm to 4:15 pm

Labs

_ SE 138, Monday 7:00 pm to 10:20 am

_ SE 138, Monday 10:30 pm to 1:20 pm

_ Kolling 202, Monday 4:30 pm to 7:20 pm

_ CLSSRM 281, Friday 10:30 am to 1:20 pm

Office hours and contact information

_ Instructor: Ming-Hsuan Yang (Please call me Ming-Hsuan)

_ Email: mhyang @ ucmerced.edu

_ Office hours: Wednesday 4:30 pm to 5:30 pm, SE2 216

_ Teaching assistant: Mehul Divecha (mdivecha @ucmerced.edu) and Han-Kai “Kevin” Hsu (hhsu22 @ucmerced.edu)

Textbook and lecture notes

_ Textbook: Discrete Mathematics and Its Applications by Kenneth H. Rosen (Seventh Edition).

_ All lecture slides will be available on the course website.

Topics

_ Logic

_ Proof

_ Sets

_ Functions

_ Counting

_ Discrete probability

_ Relations

_ Graph

_ Boolean algebra

Prerequisites

_ Basic knowledge of calculus covered in MATH 21 and MATH 22.

Grading

_ 5% Class participation

_ 25% Homework

_ 45% Three midterms

_ 25% Final