DISCRETE MATHEMATICS

MAT1DIS

2020

Credit points: 15

Subject outline

In Discrete Mathematics you will explore some important mathematical ideas that play a key role in modern computing. Topics include number bases, logic, sets, relations, recursion, Boolean algebra and cryptography. Although Discrete Mathematics is designed in particular for those who are studying information technology, the subject is relevant and useful for any person with an interest in contemporary mathematics and its applications.

School: Engineering and Mathematical Sciences (Pre 2022)

Credit points: 15

Subject Co-ordinator: Mumtaz Hussain

Available to Study Abroad/Exchange Students: Yes

Subject year level: Year Level 1 - UG

Exchange Students: No

Available as Elective: No

Learning Activities: N/A

Capstone subject: No

Subject particulars

Subject rules

Prerequisites: N/A

Co-requisites: N/A

Incompatible subjects: N/A

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 for computing.

Resource Type: Book

Resource Requirement: Prescribed

Author: Grossman, P.

Year: 2009

Edition/Volume: 3RD EDN

Publisher: PALGRAVE MACMILLAN, BASINGSTOKE

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. By the end of this subject, students will be able to convert numbers between bases, carry out arithmetic in non-decimal bases, and apply some of the mathematical ideas involved in storing and manipulating numbers in a computer.

02. Apply the laws of logic and truth tables to establish and verify equivalences in propositional and simple predicate logic.

03. Demonstrate an understanding of basic concepts of set theory, and use the laws of sets to establish set equalities.

04. Classify, and construct examples of, binary relations according to key properties that they may or may not possess, and determine structures (e.g. partitions that equivalence and partial order relations generate in their underlying sets.

05. Analyse and design simple iterative and recursive algorithms.

06. Apply the laws of Boolean algebra to the simplification of Boolean expressions and design of digital circuits.

07. Encrypt and decrypt messages using fundamental secret key and public key methods.

08. Demonstrate effective written communication skills by presenting mathematical ideas and solutions to problems in a clear and logical fashion, supported by appropriate explanations and correct use of mathematical notation.

Bendigo, 2020, Semester 2, Day

Overview

Online enrolment: Yes

Maximum enrolment size: N/A

Enrolment information: N/A

Subject Instance Co-ordinator: Mumtaz Hussain

Class requirements

LectureWeek: 31 - 43
Three 1.00 hour lecture per week on weekdays during the day from week 31 to week 43 and delivered via face-to-face.

TutorialWeek: 31 - 43
One 1.00 hour tutorial per week on weekdays during the day from week 31 to week 43 and delivered via face-to-face.

Assessments

Assessment element	Comments	Category	Contribution	Hurdle	%	ILO*
One 3-hour examination	N/A	N/A	N/A	No	60	SILO1, SILO2, SILO3, SILO4, SILO5, SILO6, SILO7, SILO8
One 50-minute test (20%) and two 30-minute tests (each 10%)	N/A	N/A	N/A	No	40	SILO1, SILO2, SILO3, SILO4, SILO5, SILO8