DISCRETE MATHEMATICS

MAT4DM

2019

Credit points: 15

Subject outline

This subject is a foundational introduction to discrete mathematics, which is a fundamental part of modern mathematics and essential background knowledge for computer scientists. This subject is designed for students enrolled in coursework masters programs to achieve proficiency in the mathematical underpinnings of concepts in computing and information science. There are a range of topics not typically taught in a standard undergraduate mathematics curriculum, including: 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.

SchoolSchool Engineering&Mathematical Sciences

Credit points15

Subject Co-ordinatorMarcel Jackson

Available to Study Abroad StudentsYes

Subject year levelYear Level 4 - UG/Hons/1st Yr PG

Exchange StudentsYes

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-requisitesN/A

Incompatible subjects MAT1DM

Equivalent subjectsN/A

Special conditionsN/A

Readings

Resource TypeTitleResource RequirementAuthor and YearPublisher
ReadingsDiscrete MathematicsPrescribedBooklist 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. Analyse computing processes and algorithms to devise mathematical formulas to describe iterative and recursive behaviour.

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 and interpretations of computing processes in succinct written form using both words and mathematical notation.

Activities:
All activities undertaken in practice classes and assignments.

Subject options

Select to view your study options…

Start date between: and    Key dates

Melbourne, 2019, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Enrolment information

Subject Instance Co-ordinatorMarcel Jackson

Class requirements

Practical Week: 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/Workshop Week: 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.

Lecture Week: 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.

Computer Laboratory Week: 13 - 13
One 1.0 hours computer laboratory per study period on weekdays during the day from week 13 to week 13 and delivered via face-to-face.
"Online test"

Assessments

Assessment elementComments% ILO*
5 Written Assignments due fortnightly (typically 3-4 pages equiv. to 200 words each)Formative20 01, 02, 03, 04, 05, 06, 07
4 extended online quizzes (equiv. to 100 words each) done fortnightly for final 7 weeks of semesterFormative10 01, 02, 03, 04
1 combinatorics and number base test, in week 4 of semester (equiv. to 600 words)Summative15 02, 03
One 2.5-hour examinationSummative55 01, 02, 03, 04, 05, 06, 07