Undergraduate - UnitMAT1830 - Discrete mathematics for computer science

This unit entry is for students who completed this unit in 2013 only. For students planning to study the unit, please refer to the unit indexes in the the current edition of the Handbook. If you have any queries contact the managing faculty for your course or area of study.

print version

6 points, SCA Band 2, 0.125 EFTSL

To find units available for enrolment in the current year, you must make sure you use the indexes and browse unit tool in the current edition of the Handbook.

Level	Undergraduate
Faculty	Faculty of Information Technology
Offered	Clayton First semester 2013 (Day) Sunway First semester 2013 (Day)
Coordinator(s)	Dr Daniel Horsley (Clayton); Associate Professor Lan Boon Leong (Sunway)

Synopsis

Topics fundamental to mathematics and computing including elementary number theory, sets, relations and functions; methods of logic and proof, especially proof by induction; recurrence relations and difference equations; trees and other graphs.

Outcomes

At the completion of this unit students will:

have an understanding of sets, relations and functions and associated concepts and their uses in mathematics and computer science;
be able to use basic methods of proof, particularly induction, to solve problems in graph theory, combinatorics and number theory;
become familiar with simple first and second order recurrence relations;
will understand the basic concepts and algorithms of number theory, such as the euclidean algorithm and its role in investigating divisors and primes.