Introduction to applications of discrete mathematical systems. Topics include sets, functions, relations, graphs, predicate calculus, mathematical proof methods (induction, contraposition, contradiction), counting methods (permutations, combinations), and recurrences. Examples are drawn from computer science and computer engineering. Knowledge of computer programming is useful before taking this course. Students who do not have prior programming experience are strongly recommended to take CSE 20 or CSE 30 before taking this course.
Prerequisites:
Quality:
Difficulty:
Remarks:
- First class with proofs
- Pay attention in this class, material will be needed later in CSE 102, CSE 103, and any other class with mathematical proofs