DISCRETE MATHEMATICS

MAT4DM

2020

Credit points: 15

Subject outline

This subject is a foundation 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: combinatorics, 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 you develop their mathematical problem-solving and research skills.

School: Engineering and Mathematical Sciences (Pre 2022)

Credit points: 15

Subject Co-ordinator: Marcel Jackson

Available to Study Abroad/Exchange Students: Yes

Subject year level: Year Level 4 - UG/Hons/1st Yr PG

Available as Elective: No

Learning Activities: N/A

Capstone subject: No

Subject particulars

Subject rules

Prerequisites: Students must be admitted in one of the following courses: SMIT or SMITCN or SMICT or SGIT or SZHSMN or SMITB

Co-requisites: N/A

Incompatible subjects: MAT1DM

Equivalent subjects: N/A

Quota Management Strategy: N/A

Quota-conditions or rules: N/A

Special conditions: N/A

Minimum credit point requirement: N/A

Assumed knowledge: N/A

Learning resources

Discrete Mathematics

Resource Type: Book

Resource Requirement: Prescribed

Author: Booklist available from the Department of Mathematics.

Year: N/A

Edition/Volume: N/A

Publisher: Department of Mathematics, La Trobe University.

ISBN: N/A

Chapter/article title: N/A

Chapter/issue: N/A

URL: N/A

Other description: N/A

Source location: N/A

Career Ready

Career-focused: No

Work-based learning: No

Self sourced or Uni sourced: N/A

Entire subject or partial subject: N/A

Total hours/days required: N/A

Location of WBL activity (region): N/A

WBL addtional requirements: N/A

Graduate capabilities & intended learning outcomes

Graduate Capabilities

Intended Learning Outcomes

01. Implement algebraic and graphical methods in logic and circuits.
02. Analyse mathematical processes and use algorithms arising in computer science.
03. Perform arithmetic in number bases arising in the study of computing processes.
04. Analyse and classify network graphs and related objects according to various significant properties.
05. Analyse computing processes and algorithms to devise mathematical formulas to describe iterative and recursive behaviour.
06. Independently investigate and implement outcomes to perform basic mathematical and computer operations
07. Present mathematical thinking and interpretations of computing processes in succinct written form using both words and mathematical notation.

Bendigo, 2020, Semester 1, Day

Overview

Online enrolment: Yes

Maximum enrolment size: N/A

Subject Instance Co-ordinator: Christopher Lenard

Class requirements

Computer LaboratoryWeek: 10 - 22
One 1.00 hour computer laboratory per study period on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Online test

LectureWeek: 10 - 22
Two 1.00 hour lecture 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.00 hour lecture/workshop per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

PracticalWeek: 10 - 22
Two 1.00 hour practical per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

Assessments

Assessment elementCommentsCategoryContributionHurdle%ILO*

5 Written Assignments due fortnightly (typically 3-4 pages equiv. to 250 words each)Formative

N/AN/AN/ANo20SILO1, SILO2, SILO3, SILO4, SILO5, SILO6, SILO7

4 online quizzes (200 words per quiz; total 800words) done fortnightly for final 7 weeks of semesterFormative

N/AN/AN/ANo10SILO1, SILO2, SILO3, SILO4

1 combinatorics and number base test, in approximately week 4 of semester (equiv. to 600 words)Summative

N/AN/AN/ANo15SILO2, SILO3

One 2-hour examination (equiv 2000 words)Summative

N/AN/AN/ANo55SILO1, SILO2, SILO3, SILO4, SILO5, SILO6, SILO7

Melbourne (Bundoora), 2020, Semester 1, Day

Overview

Online enrolment: Yes

Maximum enrolment size: N/A

Subject Instance Co-ordinator: Marcel Jackson

Class requirements

Computer LaboratoryWeek: 13 - 13
One 1.00 hour computer laboratory per study period on weekdays during the day from week 13 to week 13 and delivered via face-to-face.
Online test

LectureWeek: 10 - 22
Two 1.00 hour lecture 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.00 hour lecture/workshop per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

PracticalWeek: 10 - 22
Two 1.00 hour practical per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

Assessments

Assessment elementCommentsCategoryContributionHurdle%ILO*

5 Written Assignments due fortnightly (typically 3-4 pages equiv. to 250 words each)Formative

N/AN/AN/ANo20SILO1, SILO2, SILO3, SILO4, SILO5, SILO6, SILO7

4 online quizzes (200 words per quiz; total 800words) done fortnightly for final 7 weeks of semesterFormative

N/AN/AN/ANo10SILO1, SILO2, SILO3, SILO4

1 combinatorics and number base test, in approximately week 4 of semester (equiv. to 600 words)Summative

N/AN/AN/ANo15SILO2, SILO3

One 2-hour examination (equiv 2000 words)Summative

N/AN/AN/ANo55SILO1, SILO2, SILO3, SILO4, SILO5, SILO6, SILO7