Overview
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.
Offerings
NOV12-CLAYTON-ON-CAMPUS
OCT-MY-01-MALAYSIA-ON-CAMPUS
S1-01-CLAYTON-ON-CAMPUS
S1-01-MALAYSIA-ON-CAMPUS
S1-FF-CLAYTON-FLEXIBLE
S2-01-MALAYSIA-ON-CAMPUS
Rules
Enrolment Rule
Contacts
Chief Examiner(s)
Professor Ian Wanless
Unit Coordinator(s)
Dr Tony Huynh
Professor Ian Wanless
Dr Daniel Horsley
Notes
IMPORTANT NOTICE:
Scheduled teaching activities and/or workload information are subject to change in response to COVID-19, please check your Unit timetable and Unit Moodle site for more details.
Learning outcomes
On successful completion of this unit, you should be able to:
1.
Identify basic methods of proof, particularly induction, and apply them to solve problems in mathematics and computer science;
2.
Manipulate sets, relations, functions and their associated concepts, and apply these to solve problems in mathematics and computer science;
3.
Use and analyse simple first and second order recurrence relations;
4.
Use trees and graphs to solve problems in computer science;
5.
Apply counting principles in combinatorics;
6.
Describe the principles of elementary probability theory, evaluate conditional probabilities and use Bayes' Theorem.
Teaching approach
Active learning
Assessment
1 - In-semester assessment
2 - Examination (3 hours and 10 minutes)
Scheduled and non-scheduled teaching activities
Applied sessions
Lectures
Workload requirements
Workload
Availability in areas of study
Applied mathematics
Computational science
Mathematics
Software engineering
Computational science
Mathematics
Software engineering