CSE 20 - Introduction to Discrete Mathematics



Basic discrete mathematical structures: sets, relations, functions, sequences, equivalence relations, partial orders, number systems. Methods of reasoning and proofs: prepositional logic, predicate logic, induction, recursion, pigeonhold principle. Infinite sets and diagonalization. Basic counting techniques; permutation and combinations. Applications will be given to digital logic design, elementary number theory, design of programs, and proofs of program correctness.


Please see Prerequisites page.

Other Restrictions: 

NOTE: Repeat credit process for cross-reference courses: Students may receive credit for CSE 20 or Math 15A. These courses have been cross-referenced, therefore, a petition is not required for using either course when completing major requirements. However, if you fail one of the courses listed about you should take the SAME COURSE for REPEAT CREDIT. If you use another course that is equivalent, the repeat credit is not automatic and you will need to petition for repeat credit.


Every quarter: Fall, Winter, and Spring. Please see Tentative Course Offerings page.