DISCRETE MATHEMATICS
MAT4DM
2018
Credit points: 15
Subject outline
This subject is an introduction to discrete mathematics, which is a fundamental part of modern mathematics and essential background knowledge for computer scientists. Designed for students enroled in coursework masters programs, the subject contains a range of topics not typically taught in a standard undergraduate mathematics curriculum. Among the topics covered are: numbers in bases other than 10, recurrence relations, complexity of algorithms, graph theory, Boolean logic, and finite state machines. Examples within each topic are chosen with a view to their relevance to computer science. Some independent learning tasks will be given to help students develop their mathematical problem-solving and research skills.
School: School Engineering&Mathematical Sciences
Credit points: 15
Subject Co-ordinator: Marcel Jackson
Available to Study Abroad Students: Yes
Subject year level: Year Level 4 - UG/Hons/1st Yr PG
Exchange Students: Yes
Subject particulars
Subject rules
Prerequisites: Students must be admitted in one of the following courses: SMIT or SMITCN or SMICT or SGIT or SZHSMN.
Co-requisites: N/A
Incompatible subjects: MAT1DM
Equivalent subjects: N/A
Special conditions: N/A
Learning resources
Readings
| Resource Type | Title | Resource Requirement | Author and Year | Publisher |
|---|---|---|---|---|
| Readings | Discrete Mathematics | Prescribed | Booklist available from the Department of Mathematics. | Department of Mathematics, La Trobe University. |
Graduate capabilities & intended learning outcomes
01. Implement algebraic and graphical methods in logic and circuits.
- Activities:
- Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.
02. Analyse mathematical processes and use algorithms arising in computer science.
- Activities:
- Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.
03. Perform arithmetic in number bases arising in the study of computing processes.
- Activities:
- Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.
04. Analyse and classify network graphs and related objects according to various significant properties.
- Activities:
- Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.
05. Obtain formulas describing iterative and recursive processes in enumeration.
- Activities:
- Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.
06. Perform independent investigations using provided resources and implement the outcomes of the investigation to perform basic mathematical and computer exercises.
- Activities:
- Students engage with material provided and learn independently.
07. Present mathematical thinking in succinct written form using both words and mathematical notation.
- Activities:
- All activities undertaken in practice classes and assignments.
Melbourne, 2018, Semester 1, Day
Overview
Online enrolment: Yes
Maximum enrolment size: N/A
Enrolment information:
Subject Instance Co-ordinator: Marcel Jackson
Class requirements
PracticalWeek: 10 - 22
Two 1.0 hours practical per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Lecture/WorkshopWeek: 10 - 22
One 1.0 hours lecture/workshop per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
LectureWeek: 10 - 22
Two 1.0 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Assessments
| Assessment element | Comments | % | ILO* |
|---|---|---|---|
| 5 Written Assignments due fortnightly (typically 3-4 pages equiv. to 200 words each) | 20 | 01, 02, 03, 04, 05, 06, 07 | |
| 5 extended online quizzes (equiv. to 100 words each) done fornightly | 10 | 01, 02, 03, 04 | |
| one 3-hour examination | 70 | 01, 02, 03, 04, 05, 07 |