This unit is designed to introduce students to fundamental mathematical concepts required in computer science and software development disciplines.


Teaching periods
Start and end dates
Last self-enrolment date
Census date
Last withdraw without fail date
Results released date

Learning outcomes

Students who successfully complete this unit will be able to:

  • Solve problems related to computer science by using discrete mathematical concepts such as sets, relations, functions, logic, and combinatorics
  • Demonstrate how data can be represented in digital form
  • Apply the principles of Boolean algebra to simple circuits
  • Explain the role of probability and statistics in computer science and software development
  • Describe how discrete structures such as graphs are used in computer science
  • Construct algorithms to solve problems and understand the principles of complexity

Teaching methods


Type Hours per week Number of weeks Total (number of hours)
Face to Face Contact (Phasing out)
2.00 12 weeks 24
Face to Face Contact (Phasing out)
2.00 12 weeks 24
Unspecified Learning Activities (Phasing out)
Independent Learning
8.50 12 weeks 102


Type Task Weighting ULO's
AssignmentIndividual/Group 50% 1,2,3,4,5,6 
ExaminationIndividual 50% 1,2,3,4,5,6 


As the minimum requirements of assessment to pass a unit and meet all ULOs to a minimum standard, an undergraduate student must have achieved:

(i) an aggregate mark of 50% or more, and(ii) at least 40% in the final exam.Students who do not successfully achieve hurdle requirement (ii) will receive a maximum of 45% as the total mark for the unit.


  • Algorithms, computability and complexity
  • Data representation
  • Set theory
  • Propositional and Predicate logic
  • Boolean algebra
  • Probability and Statistics
  • Basic graph theory

Study resources

Reading materials

A list of reading materials and/or required textbooks will be available in the Unit Outline on Canvas.