CS42M - Discrete Mathematics
The discrete mathematical skills fundamental to the computing and information
- Describe and use discrete mathematical structures, including
Boolean algebra, numbers, sets, and graphs.
- Apply and analyse algorithms on discrete structures.
- Apply and determine properties of functions and relations
- Do basic reasoning in logic
- Boolean algebra
- Numbers, cardinality
- Natural, integer, rational, real, complex
- Elementary number theory (working with integers modulo n)
- Counting (permutations and combinations)
- Trees and Graphs
- Special trees, e.g., spanning, binary, bi-partite
- Freatures, e.g., paths, cycles
- Naive sets
- Sub, super, power
- Tuples, carthesian product
- Functions and relations
- Partial, total
- *tions (e.g., injection) and *isms (e.g., homomorphism)
- Orders of growth (definition and comparison of given functions)
- Propositional logic and truth tables
- Inklings of predicate logic
Students are required to pass both components.
- Coursework - 40%
- Test - 10%
- Assignments - 30%
- Final exam - 60%
- Richard Johnsonbuagh, Discrete Mathematics, 5th edition.
Andrew Burke, MSc. (UWI )