Monash home | About Monash | Faculties | Campuses | Contact Monash |
Staff directory | A-Z index | Site map |
Undergraduate |
(SCI)
|
Leader: Dr Anthony Lun
Offered:
Clayton Second semester 2006 (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 if 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 and/or practicals: 15%
Contact Hours: Three 1-hour lectures and one 1-hour support class per week