CSE390D: Discrete Math for Computer Science (for non-CSE majors)

Description: This course provides an introduction to the structures and proof techniques used in computer science. Topics include propositional logic (and set theory), predicate logic, basic number theory, methods of proof, mathematical induction, counting, discrete probability, binary relations, undirected and directed graphs.

Prerequisites: either CSE 123 or CSE 143 AND either MATH 126 or MATH 136.
Credits: 4.0

---

Portions of the CSE390D web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE390D Web: © 1993-2024, Department of Computer Science and Engineering, University of Washington. Administrative information on CSE390D (authentication required).