Unspecified/Staff
Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include finite and infinite sets, elementary combinatorial problems, and graph theory. Development of tools and mechanisms for reasoning about discrete problems. Prerequisite: CS 1110, 1111, 1112 or 1120 with a grade of C- or higher.
Difficulty 4，Hotness，难度大的一节课，教授一般，讲逻辑然后将数论，多做做题应该会好，因为难度大教授给分比较松。
，难度中，作业很简单，考试很难，但不需要特别花精力，grade给的很容易
：主要靠自学