MonMap
A course mapper by Monash Association of Coding (MAC)
Discrete mathematics for computer science
MAT1830
Synopsis
This unit introduces fundamental discrete mathematics topics including combinatorics, sets, relations and functions; methods of logic and proof, especially proof by induction; probability theory, Bayes' theorem; recursion; recurrence relations; trees and other graphs. It establishes the mathematical basis required for studies in Computer Science and Software Engineering.
Sourced from the Monash Handbook 2026.
Quick facts
- Credit points
- 6
- Level
- 1
- Audience
- Undergraduate
- Type
- Coursework
- School
- Faculty of Information Technology
- Handbook year
- 2026
Prerequisites
No prereqs in the handbook graph.
What it unlocks (6)
Offerings (3)
- First semesterClayton · FLEXIBLE / Malaysia · ON-CAMPUS
- Second semesterMalaysia · ON-CAMPUS
Listed in 8 areas of study
- Computational scienceSupporting studies in Mathematics
- Computational scienceSupporting studies in Mathematics
- MathematicsOption 4
- MathematicsOption 4
- MathematicsAdditional mathematics and statistics unit
- Pure mathematicsAdditional sequence unit
- Pure mathematicsAdditional sequence unit
- Software engineeringPart C. Software engineering knowledge and application