CSE321: Discrete Structures

4

Fundamentals of set theory, graph theory, enumeration, and algebraic structures, with applications in computing.

CSE 143; either MATH 126, MATH 129, or MATH 136.

Discrete Mathematics and Its Applications, Rosen (6th Edition)

Provide students with the definitions and basic tools for reasoning about discrete mathematical objects useful for computer science and engineering.

propositional logic and predicate logic set theory, functions the integers: divisibility, modular arithmetic, primality, etc. methods of proof and formal reasoning mathematical induction recursive definitions counting discrete probability theory binary relations graph theory and graph algorithms applications, including RSA

Meetings: 3 1-hour lectures per week, 1 recitation section hour per week Assignments: weekly written assignments Midterm plus final

(l) knowledge of probability and statistics

(m) knowledge of discrete mathematics

(a) an ability to apply knowledge of mathematics, science, and engineering

bensonl