MAT1830

Mathematics for computer science II

J Stillwell

6 points - Three 1-hour lectures and 1 hour of practical work per week - First/Second semester - Clayton - Recommendations: VCE Mathematical Methods units 3 and 4 - Prohibitions: GAS1614, MAT1077, MAT1130, MAT1470, MTH1110

Objectives On the completion of this subject, students will understand what a proof is; be able to construct proofs using modus ponens, contradiction and mathematical induction; be able to represent information using numbers, relations, functions and graphs.

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.

Assessment Examination (3 hours): 85% - Assignments: 15%

Recommended texts

Grossman P A Discrete mathematics for computing Macmillan, 1995

Back to the 1999 Information Technology Handbooks