Discrete Mathematics

Subject 620-353 (2009)

Note: This is an archived Handbook entry from 2009. Search for this in the current handbook

Credit Points: 12.50
Level: 3 (Undergraduate)
Dates & Locations:

This subject has the following teaching availabilities in 2009:

Semester 2, - Taught on campus.
Pre-teaching Period Start not applicable
Teaching Period not applicable
Assessment Period End not applicable
Last date to Self-Enrol not applicable
Census Date not applicable
Last date to Withdraw without fail not applicable

Lectures and practice classes.

Timetable can be viewed here. For information about these dates, click here.
Time Commitment: Contact Hours: 36 one-hour lectures (three per week) and up to 12 practice classes (one per week)
Total Time Commitment: 120 hours total time commitment.

Any two second year level subjects from the Department of Mathematics and Statistics. The computer science subject Algorithms and Data Structures may be substituted for one of these subjects.

Corequisites: None
Recommended Background Knowledge: None
Non Allowed Subjects: None
Core Participation Requirements: It is University policy to take all reasonable steps to minimise the impact of disability upon academic study and reasonable steps will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact upon their active and safe participation in a subject are encouraged to discuss this with the relevant subject coordinator and the Disability Liaison Unit.


Prof Peter John Forrester
Subject Overview:

Discrete mathematics is concerned with the study of objects which are finite in number and typically computable. At a computational level one seeks efficient algorithms and formulas for the listing and counting of the objects. Theory provides a way to these algorithms and formulas, and further provides links between seemingly disparate areas of discrete mathematics.

Five main topics are studied. These are Counting, permutations and combinations; Combinatorial logic; Recursions and generating functions; Groups and permutations; Hall's theorem and designs. Outside of mathematics, aspects of these topics come up in the study of computer science, communication engineering, architecture and physics.
A common theme throughout the course will be the constructive aspect of the subject, whereby algorithms and formulas are formulated for the enumeration and listing of discrete objects. Through studying this course students will gain an appreciation of the practical use of theoretical analysis.

Objectives: .

Up to 48 pages of written assignments due during semester (20%); a 3-hour written examination in the examination period (80%).

Prescribed Texts: None
Breadth Options:

This subject potentially can be taken as a breadth subject component for the following courses:

You should visit learn more about breadth subjects and read the breadth requirements for your degree, and should discuss your choice with your student adviser, before deciding on your subjects.

Fees Information: Subject EFTSL, Level, Discipline & Census Date
Notes: This subject is available for science credit to students enrolled in the BSc (pre-2008 degree only), BASc or a combined BSc course.
Related Majors/Minors/Specialisations: Mathematics and Statistics (Applied Mathematics specialisation)
Mathematics and Statistics (Discrete Mathematics specialisation)
Mathematics and Statistics (Mathematical Physics specialisation)
Mathematics and Statistics (Pure Mathematics specialisation)

Download PDF version.