CSE16: Applied Discrete Mathematics
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. Prerequisite(s): MATH 19A or MATH 19B or MATH 11B or AM 11B or AM 15B or ECON 11B.5 credits
Year | Fall | Winter | Spring | Summer |
---|---|---|---|---|
2024-25 |
|
|
|
|
2023-24 |
|
|
|
|
2022-23 |
|
|
|
|
2021-22 |
|
|
|
|
2020-21 |
|
|
|
While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.