Undergraduate - UnitMAT1830 - Discrete mathematics for computer science

This unit entry is for students who completed this unit in 2012 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 0 (NATIONAL PRIORITY), 0.125 EFTSL

Refer to the specific census and withdrawal dates for the semester(s) in which this unit is offered, or view unit timetables.

Level	Undergraduate
Faculty	Faculty of Information Technology
Offered	Clayton First semester 2012 (Day) Sunway First semester 2012 (Day)
Coordinator(s)	Dr Daniel Horsley (Clayton)

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.

Assessment

Examination (3 hours): 70%; In-semester assessment: 30%

Chief examiner(s)

Dr Daniel Horsley

Contact hours

3 hrs lectures/wk, 1 hr tutorial/wk

Prohibitions

MAT1077, MTH1112

Additional information on this unit is available from the faculty at:

http://www.infotech.monash.edu.au/units/mat1830