There is a more recent version of this academic item available.

Overview

This subject is an introduction to discrete mathematics. Concepts in discrete mathematics are useful in several branches of computer science as computers operate indiscrete binary states. Among the topic covered are: sets, relations, combinatorics, analysis of algorithms, Big-Onotation, graph theory and its applications, and automata. All these topics are central … For more content click the Read more button below.

Portfolio

Science, Health & Engineering (Pre 2022)

School

Engineering and Mathematical Sciences (Pre 2022)

Subject coordinator

Marcel Jackson

Subject type

Undergraduate

Year level

Year Level 2 - UG

AQF level

Level 6 - Advanced Diploma

Available as elective

No

Available to study abroad / exchange students

No

Capstone subject

No

Academic progress review - Schedule A subject

No

Subject instances

To view instance specific details which include - Assessments, Class requirements and Subject instance coordinators - please select your preferred instance via the drop-down menu at the top right-hand side of this page.

Learning resources

Recommended - Book - Discrete Mathematics for computer science

Prescribed - Book - Logics and Discrete Mathematics: A Concise Introduction

Career ready

Work based learning (placement):No

Subject intended learning outcomes

On successful completion you will be able to:
1.
Perform calculations related to computer science using sets, functions and relations.
2.
Implement calculations where enumerative combinatorics are needed.
3.
Perform calculations using Boolean algebra and apply them to computer science.
4.
Compare algorithms arising in computer science for time complexity.
5.
Investigate applications of graph theory and automata in computer science and apply them to solve computational problems.

Requisite rules

Prerequisites: Must be admitted into either SBAIO or SBACTO and have passed CSE1ITX