| Unit convenor and teaching staff |
Unit convenor and teaching staff
Lecturer
Paul Bryan
Contact via email
Lecturer
Steve Lack
Contact via email
|
|---|---|
| Credit points |
Credit points
10
|
| Prerequisites |
Prerequisites
MATH1007 or MATH1020 or MATH1025
|
| Corequisites |
Corequisites
|
| Co-badged status |
Co-badged status
|
| Unit description |
Unit description
The purpose of this unit is to give a grounding in discrete mathematics. It is important preparation for theoretical computing, software engineering and abstract algebra. The unit explores topics in areas such as computability and computational complexity; formal languages and finite state machines; recurrence relations and generating functions; computational applications of graphs, trees and matrices; and formal methods in programming. |
Information about important academic dates including deadlines for withdrawing from units are available at https://www.mq.edu.au/study/calendar-of-dates
On successful completion of this unit, you will be able to:
Achieve a total mark equal to or greater than 50% across all assessments.
Unless a Special Consideration request has been submitted and approved, a 5% penalty (of the total possible mark of the task) will be applied for each day a written report or presentation assessment is 3not submitted, up until the 7th day (including weekends). After the 7th day, a grade of ‘0’ will be awarded even if the assessment is submitted.
The Special Consideration Policy aims to support students who have been impacted by short-term circumstances or events that are serious, unavoidable and significantly disruptive, and which may affect their performance in assessment. If you experience circumstances or events that affect your ability to complete the assessments in this unit on time, please inform the convenor and submit a Special Consideration request through https://connect.mq.edu.au.
The submission time for all uploaded assessments is 11:55 pm. A 1-hour grace period will be provided to students who experience a technical concern. For any late submission of time-sensitive tasks, such as scheduled tests/exams, performance assessments/presentations, and/or scheduled practical assessments/labs, please apply for Special Consideration.
Assessments where Late Submissions will be accepted:
| Name | Weighting | Hurdle | Due | Groupwork/Individual | Short Extension | AI Approach |
|---|---|---|---|---|---|---|
| Skills Exercise | 20% | No | 05/06/2026 | Individual | No | Observed |
| Examination | 50% | No | Examination Period | Individual | No | Observed |
| Project | 30% | No | 24/05/2026 | Individual | Yes | Open |
Assessment Type 1: Practice-based task
Indicative Time on Task 2: 12 hours
Due: 05/06/2026
Weighting: 20%
Groupwork/Individual: Individual
Short extension 3: No
AI Approach: Observed
You will undertake exercises that develop and assess your discrete mathematics skills, reinforcing theoretical knowledge through consistent practice to support mastery of essential concepts.
Assessment Type 1: Examination
Indicative Time on Task 2: 20 hours
Due: Examination Period
Weighting: 50%
Groupwork/Individual: Individual
Short extension 3: No
AI Approach: Observed
In the exam, you will be assessed on your ability to apply the concepts and techniques acquired in the unit.
Assessment Type 1: Experiential task
Indicative Time on Task 2: 18 hours
Due: 24/05/2026
Weighting: 30%
Groupwork/Individual: Individual
Short extension 3: Yes
AI Approach: Open
In this project, you will apply the knowledge gained in the unit to a larger-scale mathematical problem, extending beyond the short questions typical of assignments.
1 If you need help with your assignment, please contact:
2 Indicative time-on-task is an estimate of the time required for completion of the assessment task and is subject to individual variation.
3 An automatic short extension is available for some assessments. Apply through the Service Connect Portal.
Lectures (beginning in Week 1): There are two one-hour lectures each week.
SGTA classes (beginning in Week 2): There is one two-hour sgta each week.
Suggested textbooks The following textbooks are useful as supplementary resources, for additional questions and explanations. They are available from the Macquarie University library:
Other useful resources and materials will be made available via the MATH2907 iLearn site.
We will communicate with you via your university email or through announcements on iLearn. Queries to convenors can either be placed on the iLearn discussion board or sent to your lecturers from your university email address.
Students are expected to have access to an internet-enabled computer with a web browser and Adobe Reader software. Most areas of the university provide wireless access for portable devices. There are computers for student use in the Library.
Furthermore, some assessments may require you to write solutions to problems in handwritten form and to scan them in for online upload. So you should have access to a device, such as a flatbed scanner or mobile phone, that will allow you to make electronic images of your work.
Difficulties with your home computer or internet connection do not constitute a reasonable excuse for lateness of, or failure to submit, assessment tasks.
Here is a provisional weekly plan for topics covered. Any changes will be announced via iLearn.
| Week | Topics |
|---|---|
| 1 | Graph colouring |
| 2 | Network flows |
| 3 | Minimal spanning trees |
| 4 | Languages |
| 5 | Grammars |
| 6 | Deterministic finite state machines |
| 7 | Non-determinism |
| 8 | Minimization |
| 9 | Turing machines |
| 10 | Counting |
| 11 | Recurrence relations |
| 12 | Generating functions |
| 13 | Revision |
Macquarie University policies and procedures are accessible from Policy Central (https://policies.mq.edu.au). Students should be aware of the following policies in particular with regard to Learning and Teaching:
Students seeking more policy resources can visit Student Policies (https://students.mq.edu.au/support/study/policies). It is your one-stop-shop for the key policies you need to know about throughout your undergraduate student journey.
To find other policies relating to Teaching and Learning, visit Policy Central (https://policies.mq.edu.au) and use the search tool.
Macquarie University students have a responsibility to be familiar with the Student Code of Conduct: https://students.mq.edu.au/admin/other-resources/student-conduct
Results published on platform other than eStudent, (eg. iLearn, Coursera etc.) or released directly by your Unit Convenor, are not confirmed as they are subject to final approval by the University. Once approved, final results will be sent to your student email address and will be made available in eStudent. For more information visit connect.mq.edu.au or if you are a Global MBA student contact globalmba.support@mq.edu.au
At Macquarie, we believe academic integrity – honesty, respect, trust, responsibility, fairness and courage – is at the core of learning, teaching and research. We recognise that meeting the expectations required to complete your assessments can be challenging. So, we offer you a range of resources and services to help you reach your potential, including free online writing and maths support, academic skills development and wellbeing consultations.
Macquarie University provides a range of support services for students. For details, visit http://students.mq.edu.au/support/
Academic Success provides resources to develop your English language proficiency, academic writing, and communication skills.
The Library provides online and face to face support to help you find and use relevant information resources.
Macquarie University offers a range of Student Support Services including:
Got a question? Ask us via the Service Connect Portal, or contact Service Connect.
For help with University computer systems and technology, visit http://www.mq.edu.au/about_us/offices_and_units/information_technology/help/.
When using the University's IT, you must adhere to the Acceptable Use of IT Resources Policy. The policy applies to all who connect to the MQ network including students.
Unit information based on version 2026.03 of the Handbook