UTS Maths/Stats Teaching Seminar: Murray Elder
Topic: What is Discrete Mathematics 37181?
Discrete Mathematics is a first-year course which is core for B. Computer Science students and will become core for Mathematics students too under the new curriculum. What is it? It covers logic, valid/invalid arguments (if I am an axe murderer, I own an axe. I do not own an axe. Therefore I am not an axe murderer), how to read and write PROOFS, mathematical notation (\forall, \exists, etc), set theory, functions between sets, infinity, proof by induction, counting, analysis of algorithms (correctness, complexity), graph theory (networks, trees), basic number theory (as much as needed to understand the RSA cryptosystem). I want to give this presentation so everyone knows what is in this course, to inform what goes into later courses. You might also give me feedback about what else should be included or omitted. I will also describe the way we run Whiteboard Workshops in the course. All welcome!