Course Description in General Catalog (16-17)
20. Introduction to Discrete Mathematics (4)
Basic discrete mathematical structure: sets relations, functions, sequences, equivalence relations, partial orders, and number systems. Methods of reasoning and proofs: propositional logic, predicate logic, induction, recursion, pigeonhole principle. Infinite sets and diagonilazation. Basic counting techiniques; permutations and combinations. Applications will be given to digital logic design, elementary number theory, design of programs, and proofs of program correctness.
Three hours of lecture, one hour of discussion per week. Approximately 8 hours of outside preparation. One midterm and one final.
Prerequisites: COGS 7, CSE 8B or CSE 11 with a passing grade of C- or better.
Note: Credit not offered for both Math 15A and CSE 20. Equivalent to Math 15A.
CSE 20 Home Page