DISCRETE MATHEMATICS

MAT4DM

2015

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. Project work is designed to help students develop their mathematical problem-solving and research skills in a team setting.

SchoolSchool Engineering&Mathematical Sciences

Credit points15

Subject Co-ordinatorYuri Nikolayevsky

Available to Study Abroad StudentsYes

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

Exchange StudentsYes

Subject particulars

Subject rules

Prerequisites Enrolment in one of the following courses: SMIT, SMICT, SMCSC, SMBBS, SGBS, SGDCS, SGDIT, SPCS, SGCS.

Co-requisitesN/A

Incompatible subjects CSE21DMO, MAT12DM, MAT11DM, 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. Analyse logic and circuits using algebraic and graphical methods.

Activities:
Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.

02. Perform mathematical analyses of 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 calculations in various number systems used in computer science.

Activities:
Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.

04. Model iterative and recursive processes using recurrence relations.

Activities:
Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.

05. Model networks and related applications using the tools of graph theory.

Activities:
Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.

06. Analyse the behaviour of finite state machines.

Activities:
Explained in lectures, students work through problem sheets in practice classes and write up problem solutions carefully in assignments.

07. Report on independent team investigations of discrete mathematics topics beyond the core curriculum topics described in 1 to 6 above.

Activities:
Students assigned to teams to undertake research project on a topic thst extends the core curriculum material and prepare and submit a report.

08. Present mathematical reasoning in clear and succinct terms.

Activities:
All activities undertaken in practice classes, team projects and assignments.

Subject options

Select to view your study options…

Start date between: and    Key dates

Melbourne, 2015, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Enrolment information

Subject Instance Co-ordinatorYuri Nikolayevsky

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.

Assessments

Assessment elementComments% ILO*
5 Written Assignments due fortnightly (typically 3-4 pages each)20 01, 02, 03, 04, 05, 06, 08
5 extended online quizzes done fornightly10 07, 08
one 3-hour examination70 01, 02, 03, 04, 05, 06