MTH129 Discrete Mathematics (8)
Abstract
Discrete mathematics explores finite mathematic objects such as the integers, graphs and logical statements which assume distinct and separated values. The importance of discrete mathematics has greatly increased with the development of digital computers which themselves operate in discrete steps and store data in discrete units (bits). Students will learn the concepts and notation which are fundamental in studying several areas of computer science, including computer algorithms, data structures, programming languages, cryptography and software development. 


+ Subject Availability Modes and Location
Session 2 

Internal  Bathurst Campus  Distance  Bathurst Campus 
Continuing students should consult the SAL for current offering details: MTH129
Where differences exist between the Handbook and the SAL, the SAL should be taken as containing the correct subject offering details.


Subject informationDuration  Grading System  School: 

One session.  HD/FL  School of Computing and Mathematics 


Learning OutcomesUpon successful completion of this subject, students should:
 be able to recognise and use mathematical notation and operations to simplify expressions and prove properties of sets, formal logic and computer circuits and other discrete objects;
 be able to follow and apply simple mathematical statements and proofs;
 be able to understand that numbers can be represented in several bases, and be able to reason in nondecimal bases such as binary and hexadecimal;
 be able to work with discrete probabilities, and the related statistics such as expectations and variances;
 be able to understand the basic algorithms for analysing graphs, apply them to examples, and to estimate running times;
 be able to analyse growth rates in terms of recursions and recurrence equations;



SyllabusThe subject will cover the following topics:
 Sets: operations on sets, algebra of sets and venn diagrams.
 Logic: truth tables, propositional calculus and types of proof.
 Number systems: binary and hexadecimal system, and principles of counting.
 Discrete probability functions, expected value and variance, conditional probability and independence.
 Binomial and poisson distributions, bivariate distributions and random numbers.
 Graphs: types of graphs, traversibility, planarity, digraphs and trees. Adjacency matrices, maximal flow and minimum spanning algorithms.
 Recursion, recursive definitions and algorithms, solution of recurrence equations, big "O" notation and complexity of algorithms.
 Boolean algebra and logic circuits.



Back
The information contained in the 2016 CSU Handbook was accurate at the date of publication: 06 September 2016. The University reserves the right to vary the information at any time without notice.