MAT1830 - Mathematics for computer science 2
6 points, SCA Band 0 (NATIONAL PRIORITY), 0.125 EFTSL
Undergraduate Faculty of Information Technology
Leader(s): Dr Daniel Delbourgo (Clayton); Dr Leow Soo Kar (Malaysia)
Offered
Clayton Second semester 2009 (Day)
Sunway Second semester 2009 (Day)
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.
Objectives
On 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; will be able to use basic methods of proof, particularly induction, to solve problems in graph theory, combinatorics and number theory; will become familiar with simple first and second order recurrence relations; and will understand the basic concepts and algorithms of number theory, such as the euclidean algorithm and its role in investigating divisors and primes.
Assessment
Examination (3 hours): 85%
Assignments: 15%
Contact hours
Three x 1hr lectures/week, one x 1hr support class/week
Prohibitions
MAT1077, MTH1112