Overview

This unit of study aims to provide students with mathematical knowledge and skills needed to support their concurrent and subsequent engineering, science and computer science studies. Students will gain experience in understanding and writing proofs and develop skills for creating and analysing algorithms, for a range of topics in combinatorics, graph theory, network theory, finite group theory, and mathematical games.

Requisites

Prerequisites
MTH00007 Preliminary Mathematics

OR
MTH10012 Calculus and Applications
OR
MTH10013 Linear Algebra and Applications
OR
MTH10010 Essential Mathematics
OR
MTH10020 Mathematics for Computing

Pre-requisite
100cp of prior studies

Teaching periods
Location
Start and end dates
Last self-enrolment date
Census date
Last withdraw without fail date
Results released date
Semester 1
Location
Hawthorn
Start and end dates
01-March-2027
30-May-2027
Last self-enrolment date
14-March-2027
Census date
30-March-2027
Last withdraw without fail date
20-April-2027
Results released date
06-July-2027

Unit learning outcomes

Students who successfully complete this unit will be able to:

  1. Write computer code to implement network, graph theoretic, and cryptographic algorithms, and to study mathematical puzzles and games.
  2. Characterise algorithm performance using big O notation
  3. Analyse real-world networks by applying network algorithms
  4. Construct mathematical proofs for problems in discrete mathematics

Teaching methods

All applicable locations

Type Hours per week Number of weeks Total (number of hours)

On-Campus
Lecture

2.00  12 weeks 24
On-Campus
Class
1.00 12 weeks 12
On-Campus
Class
1.00 12 weeks 12
Unspecified Activities
Independent Learning
7.50 12 weeks 90
Online
Asynchronous Lecture
1.00 12 12
TOTAL     150

Assessment

Type Task Weighting ULOs
Project Individual 25 - 40% 1,2,3,4
Test 1 Individual 25 - 40% 4
Test 2 Individual 25 - 40% 1,2,4

Content

  • Graphs and networks
  • Combinatorics, including problems such as the knight's tour for chess
  • Finite group theory and mathematical games, including the study of puzzles such as the 15-puzzle and Rubik's cube
  • Algorithms and algorithmic complexity
  • Number theory and cryptography
  • Computer programming skills involving the implementation of algorithms
  • Applications to problems in science and engineering, including analysis of networks such as the internet and electricity networks, and the study of combinatorial problems relevant to chemistry and physics

Study resources

Reading materials

A list of reading materials and/or required textbooks will be available in the Unit Outline on Canvas.