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.
á COB2 140, Monday and Wednesday 3:00 pm to 4:15 pm
á 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
á 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)
á Logic
á Proof
á Sets
á Functions
á Counting
á Discrete probability
á Relations
á Graph
á Boolean algebra
á Syllabus