# DISCRETE MATHEMATICS

MAT1DIS

2021

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.

SchoolEngineering and Mathematical Sciences

Credit points15

Subject Co-ordinatorMumtaz Hussain

Subject year levelYear Level 1 - UG

Available as ElectiveNo

Learning ActivitiesN/A

Capstone subjectNo

## Subject particulars

### Subject rules

PrerequisitesN/A

Co-requisitesN/A

Incompatible subjectsN/A

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

Resource TypeBook

Resource RequirementPrescribed

AuthorGrossman, P.

Year2009

Edition/Volume3RD EDN

PublisherPALGRAVE MACMILLAN, BASINGSTOKE

ISBNN/A

Chapter/article titleN/A

Chapter/issueN/A

URLN/A

Other descriptionN/A

Source locationN/A

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

## Graduate capabilities & intended learning outcomes

### 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.

## Subject options

Select to view your study options…

Start date between: and    Key dates

## Bendigo, 2021, Semester 2, Day

### Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Subject Instance Co-ordinatorMumtaz Hussain

### Class requirements

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

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

### Assessments

Assessment elementCategoryContributionHurdle% ILO*

One 3-hour examination

Central examIndividualNo60 SILO1, SILO2, SILO3, SILO4, SILO5, SILO6, SILO7, SILO8

One 50-minute test (20%) and two 30-minute tests (each 10%)

OtherIndividualNo40 SILO1, SILO2, SILO3, SILO4, SILO5, SILO8