|Faculty or Section :||Faculty of Health, Engineering and Sciences|
|School or Department :||School of Mathematics, Physics & Computing|
|Grading basis :||Graded|
|Course fee schedule :||https://www.unisq.edu.au/current-students/administration/fees/fee-schedules|
|Version produced :||27 January 2023|
Discrete methods underlie the areas of data structures, computational complexity and the analysis of algorithms. Continuing advances in technology - particularly in applications of computing - have enhanced the importance of discrete (or finite) mathematics for understanding not only the foundations of computer science but also the basis on which computational solutions to a wide variety of applications problems rests.
This course introduces the basic elements of discrete mathematics which provide a foundation for an understanding of algorithms and data structures used in computing. Topics covered include number systems, logic, relations, functions, induction, recursion, Boolean algebra and graph theory.