Discrete Mathematics

CSC 2110

Site menu:

• Information
• Announcement
• Notes
• Homework
• Tutorial

CSC2110 - Discrete Mathematics

Lectures:	Mondays: 2:30pm-4:15pm in SC L1, Wednesdays: 1:30pm-2:15pm in SC L1
Instructor:	Lau Lap Chi
Office hours:	Tuesdays 10am-12pm, Thursdays 10am-12pm, or by appointments, in SHB 911
Tutorials:	Wednesdays: 5:30pm-6:15pm in LSB C2 (English), Thursdays: 12:30pm-1:15pm in ERB 803 (Cantonese), 1:30pm-2:15pm in LSB C1 (Cantonese).
Tutors:	Kwok Tsz Chiu Wong Chun Hoi (Hollis) Yu Yuanming
TA office hours:	Fridays 10am-12pm, or by appointments, in SHB 117
Newsgroup:	news://news.erg.cuhk.edu.hk/cuhk.cse.csc2110

Text: Discrete Mathematics with Applications, by Susanna S. Epp.

Reference: Course notes of "mathematics for computer science" in MIT.

There are three major topics in this course.

• Counting
• Sets, functions, number sequences
• Combinations, permutations, binomial theorem.
• Counting by mapping, pigeonhole principle, inclusion-exclusion principle
• Recursion
• Logic and Proofs
• Propositional logic, first order logic.
• Proof by cases, proof by contradiction.
• Induction, invariant method.
• Graph Theory
• Degree sequence, Eulerian graphs, isomorphism.
• Trees.
• Stable matching, bipartite matching.
• Graph coloring, planar graphs.

Computer Science and Enginnering, The Chinese University of Hong Kong.