MAT1830 - Discrete mathematics for computer science - 2019

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.

At the completion of this unit, students 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.

NOTE: From 1 July 2019, the duration of all exams is changing to combine reading and writing time. The new exam duration for this unit is 3 hours and 10 minutes.

Examination (3 hours): 60%; In-semester assessment: 40%

Minimum total expected workload equals 12 hours per week comprising:

1. Contact hours for on-campus students:
   • Three hours of lectures
   • One 90 minute tutorial
2. Additional requirements (all students):
   • A minimum of 7.5 hours independent study per week for completing tutorial and project work, private study and revision.

See also Unit timetable information

Applied mathematics

Computational science

Mathematics

Software engineering