MATH R130 — Discrete Mathematics
This course is an introduction to discrete mathematical systems, which has application to computer science. Topics include logic; set theory; functions; relations; proof techniques; mathematical induction; recurrence relations; graph theory and trees; combinatorics and probability; Boolean algebra; and a brief introduction to programming.