mat4dm discrete mathematics

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.

SchoolEngineering and Mathematical Sciences

Credit points15

Subject Co-ordinatorMarcel Jackson

Available to Study Abroad/Exchange StudentsYes

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

Available as ElectiveNo

Learning ActivitiesN/A

Capstone subjectNo

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

Incompatible subjectsMAT1DM

Equivalent subjectsN/A

Quota Management StrategyN/A

Quota-conditions or rulesN/A

Special conditionsN/A

Minimum credit point requirementN/A

Assumed knowledgeN/A

Learning resources

Discrete Mathematics

Resource TypeBook

Resource RequirementPrescribed

AuthorBooklist available from the Department of Mathematics.

YearN/A

Edition/VolumeN/A

PublisherDepartment of Mathematics, La Trobe University.

ISBNN/A

Chapter/article titleN/A

Chapter/issueN/A

URLN/A

Other descriptionN/A

Source locationN/A

Career Ready

Career-focusedNo

Work-based learningNo

Self sourced or Uni sourcedN/A

Entire subject or partial subjectN/A

Total hours/days requiredN/A

Location of WBL activity (region)N/A

WBL addtional requirementsN/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.

Subject options

Select to view your study options…

Start date between: and    Key dates

Bendigo, 2020, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Subject Instance Co-ordinatorChristopher 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) FormativeN/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 semester FormativeN/AN/AN/ANo10SILO1, SILO2, SILO3, SILO4
1 combinatorics and number base test, in approximately week 4 of semester (equiv. to 600 words) SummativeN/AN/AN/ANo15SILO2, SILO3
One 2-hour examination (equiv 2000 words) SummativeN/AN/AN/ANo55SILO1, SILO2, SILO3, SILO4, SILO5, SILO6, SILO7

Melbourne (Bundoora), 2020, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Subject Instance Co-ordinatorMarcel 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) FormativeN/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 semester FormativeN/AN/AN/ANo10SILO1, SILO2, SILO3, SILO4
1 combinatorics and number base test, in approximately week 4 of semester (equiv. to 600 words) SummativeN/AN/AN/ANo15SILO2, SILO3
One 2-hour examination (equiv 2000 words) SummativeN/AN/AN/ANo55SILO1, SILO2, SILO3, SILO4, SILO5, SILO6, SILO7