CSC281-Discrete Mathematics for Computer Science

The goal of this course is to introduce students to ideas and techniques from discrete mathematics that are widely used in Computer Science. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, sets, relations; elementary graph theory; number theory; aalgorithms; counting principles， discrete probability and so on.