Discrete Mathematics

CSC 2110

Site menu:

• Information
• Announcement
• Notes
• Homework
• Tutorial
• Project
• Class Photo
• Blog

CSC2110 - Discrete Mathematics

Lectures:	Mondays: 2:30-4:15 in TYW LT, Wednesdays: 1:30-2:15 in LSB LT1
Instructor:	Lau Lap Chi
Office hours:	Tuesdays: 10:00am-5:00pm in SHB 911.
Tutorials:	Thursdays: 12:30-1:15 in ERB 404, 1:30-2:15pm in ERB 404, 6:30-7:15pm in ERB 408.
Tutors:	Chan Yuk Hei (Tom) Cheung Ho Yee (Leo) Leung Kai Man (Hackson) Zhang Zixi (Jesse)
TA office hours:	Fridays: 3:00-5:00pm 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 four major topics in this course.

• Logic and Proofs
• Propositional logic, first order logic.
• Proof by cases, induction, contradiction.
• Invariant method, impossibility proof.
• Number theory
• Number sequences.
• Euclidean algorithm.
• Prime numbers, modular arithmetic, Chinese remainder theorem.
• Cryptography, RSA protocol.
• Counting
• Sets and functions
• Combinations, permutations, binomial theorem.
• Counting by mapping, pigeonhole principle, inclusion-exclusion principle
• Recursion
• Graph Theory
• Degree sequence, Eulerian graphs, isomorphism.
• Trees, counting trees
• Stable matching, bipartite matching.
• Graph coloring, planar graphs.

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