CSE 215 — Discrete Structures CSE 215 5 Credits/Units
Discrete structures and analysis techniques for computing by building on students' skills in programming and logic. Topics include: functions, relations and their properties; sets, sequences and tuples; probability, counting (permutations and combinations); propositional logic and logical connectives; introduction to predicate logic and its limitations; formal proof strategies (counterexample, contraposition); contradiction, recursion, computational complexity; trees, graphs and traversal strategies; modeling computation (finite state & turing machines). [GE, SE]