Discrete Mathematics

Course aim

To develop aspects of discrete mathematics relevant to computer science and related disciplines.

Course content

Logic: propositions, truth tables, quantifiers, theorem and proof. Number systems.
Sets, relations, functions. Induction.
Algorithms, time complexity, analysis.
Counting, permutations and combinations.
Graphs, paths and cycles.
Boolean algebra, circuit synthesis

Textbook(s)

Johnsonbaugh, R 2013, Discrete Mathematics, 7th, Prentice Hall

Prerequisite(s)

Nil

Corequisite(s)

Nil

Teaching method

Component	Duration
INTERNAL, MAWSON LAKES
Lecture	3 hours x 13 weeks
Tutorial	1 hour x 7 weeks
Computer Practical	1 hour x 6 weeks
EXTERNAL, MAWSON LAKES, ONLINE
External	N/A x 13 weeks

Note: These components may or may not be scheduled in every study period. Please refer to the timetable for further details.

Assessment

Assignment 1, Assignment 2, Examination, Practical (in class assessment)

Fees

EFTSL*: 0.125
Commonwealth Supported program (Band 2)
To determine the fee for this course as part of a Commonwealth Supported program, go to:
How to determine your Commonwealth Supported course fee. (Opens new window)

Fee-paying program for domestic and international students
International students and students undertaking this course as part of a postgraduate fee paying program must refer to the relevant program home page to determine the cost for undertaking this course.

Non-award enrolment
Non-award tuition fees are set by the university. To determine the cost of this course, go to:
How to determine the relevant non award tuition fee. (Opens new window)

Not all courses are available on all of the above bases, and students must check to ensure that they are permitted to enrol in a particular course.

* Equivalent Full Time Study Load. Please note: all EFTSL values are published and calculated at ten decimal places. Values are displayed to three decimal places for ease of interpretation.