This unit was introduced to provide the mathematical background for computer science students, necessary for the second and third years of the undergraduate program.

31/8/2015 - Updated for course architecture programs. Effective Semester 1, 2016. Further maths score 35.

Change from 60 to 90 minute tutorials and from objectives to outcomes (these were been approved by the School of Mathematical Sciences Education Committee on 17 April 2014). Changes to be implemented from Semester 1 2015.

4/9/2015 - Updated for course architecture programs. Effective semester 1, 2016.

21/3/2017 Assessment loading has changed to 60/40 since there is now a university requirement that final exams not be 70%. The final examination should remain 3 hours. This is *NOT* a change.

The reasons for this *non-change* are:

We are testing not just conceptual understanding but also ability to work things out. Calculations and deductions take time.

Time pressure in mathematics is a disaster because questions go pear-shaped if you make a minor error early in a calculation or miss some subtlety of the question. This may result in a lot of wasted time trying to make something work when it isn't going to, or in having to do a question completely again from the start. Redoing questions in this way is common on maths exams.

There are lots of concepts in MAT1830. We go a little way into a lot of different directions. In fact there are elements of numerous very different branches of mathematics (logic, number theory, probability, combinatorics, graph theory etc). To get coverage of a healthy fraction of these concepts requires a longer exam. If the coverage is less it disadvantages students whose strengths are not tested, and introduces a larger luck factor in the final results.

(Almost) all MTH units have a 3 hour final exam, for reasons similar to the above.

14/09/2018 - Admin: updating CE and workload to reflect new activity types as per university policy.

24/9/19: Admin - updating the exam duration to include additional 10 minutes as per University requirement.

16/09/2020 - Admin: Update to include new assessment and teaching approach fields as per Handbook requirements.

This unit is a core requirement and mathematics component of the BCS. It is based on previous offerings of the unit.

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.

010101

This unit introduces fundamental discrete mathematics topics including combinatorics, sets, relations and functions; methods of logic and proof, especially proof by induction; probability theory, Baye's theorem; recursion; recurrence relations; trees and other graphs. It establishes the mathematical basis required for studies in Computer Science and Software Engineering.

Course notes booklet (available as a pdf from the course Moodle page and in hardcopy from the Clayton campus bookshop).

On-campus

Peer assisted learning

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

1. Weekly assignments x 10 - 35% (3.5% each) - ULO: 1, 2, 3, 4, 5, 6
2. Applied class participation - 5% - ULO: 1, 2, 3, 4, 5, 6
3. End of semester examination - 60% - ULO: 1, 2, 3, 4, 5, 6

6

Minimum total expected workload equals 12 hours per week comprising:

(a.) Contact hours for on-campus students:

(b.) Additional requirements (all students):

School of Mathematical Sciences