MAT1101 Discrete Mathematics for Computing |Semester 1, 2013 On-
campus Toowoomba| |Faculty or Section :||Faculty of Sciences|
|School or Department :||Maths and Computing| |Version produced
:||20 June 2013| Examiner: Nicolas Jourdan Moderator: Xiaohui
Tao Current skills at the level of Queensland Senior Secondary
School Studies Mathematics B or equivalent are recommended.
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, fu