View source for MATH1005

{{DISPLAYTITLE:MATH1005: Discrete Mathematics}}

Your basic maths course for computer scientists. Covers basic combinatorics, networks / graphs, Boolean logic, etc. As far as university maths courses go this course is fairly straightforward, you will probably be fine.

If you’re doing a School of Computing degree, this course is probably compulsory for you. If you're doing the BAC R&D you can optionally do [[MATH2222]] instead (more difficult). If you’re doing a CS major in the BSc, you can do [[MATH1013]] or [[MATH1115]] instead as well. It’s OK to not know what subfield of CS you want to end up in yet, but if you plan on pursuing machine learning, taking at least MATH1013 (instead or as well) will serve you well. (MATH1115 is a more rigorous, proof-heavy version of MATH1013, recommended if you’re a maths nerd or plan on studying maths in greater depth. It will help with [[COMP3600|Algorithms]] as well.)

Anyway, so by choice or lack thereof, you’re taking MATH1005.

Pay attention to the logic section and induction. It will make [[COMP1600]] next semester easier.

The course itself is pretty standard, but the non-assessable information is an interesting glimpse into other stuff if you’re a bit of a maths nerd (like Russell’s paradox etc. and ZFC set theory).

Make sure you get all your assignments done on time, otherwise you’re just throwing away marks. Find a buddy to check the assignments with so that you don’t make silly calculation mistakes.

[[Category:1000-level courses]]
[[Category:MATH courses]]