units

MAT1830

Faculty of Information Technology

Undergraduate - Unit

print version

6 points, SCA Band 2, 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.

LevelUndergraduate
FacultyFaculty of Information Technology
OfferedClayton First semester 2014 (Day)
Malaysia First semester 2014 (Day)
Coordinator(s)Dr Daniel Horsley (Clayton); Associate Professor Lan Boon Leong (Malaysia)

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)

Workload requirements

Minimum total expected workload equals 12 hours per week comprising:

(a.) Contact hours for on-campus students:

  • Three hours of lectures
  • One 1-hour tutorial

(b.) Additional requirements (all students):

  • A minimum of 8 hours independent study per week for completing tutorial and project work, private study and revision.

This unit applies to the following area(s) of study

Prohibitions

MAT1077, MTH1112

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