Home  /   Course Handbook  /  Discrete Mathematics (MATH1510)

Discrete Mathematics

Available in 2013

Callaghan Campus Semester 2 Semester 1

Previously offered in 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004

Discrete mathematics is the study of mathematical structures that are discrete, separated or distinct; in contrast with calculus which deals with continuous change. It is an important area of pure and applied mathematics, as well as providing the mathematical basis for the understanding of computers and modern computation. Discrete Mathematics is important in the sciences, where it has increasing application in many areas, an exemplar of which is the understanding of DNA sequences in molecular biology. The Discrete Mathematics course introduces first year students to the basic concepts of discrete mathematics, covering topics such as sets, logic, enumeration methods, probability, recurrence relations, induction and graph theory. The course provides important background for students pursuing a BMath degree. It covers much of the mathematics essential for students majoring in Computer Science or Software Engineering, and is a compulsory course in those degree programs.

Objectives On satisfactory completion of the course the student will:
1. be able to read, interpret and write some basic mathematical notation
2. be able to recognise and/or construct examples of mathematical objects introduced during the course, such as sets and functions
3. have been introduced to several mathematical models, (e.g. propositional logic, trees) including some of those underlying computing and information technology
4. have had the opportunity to develop capacity in knowing what constitutes a valid argument, and in constructing valid arguments/proofs
5. have had opportunity to develop problem solving skills; and been introduced to ways of thinking useful for simplifying complex situations
Content . Elementary set theory
. Relations and functions
. Graph theory
. Modular arithmetic
. Logic and proofs
. Enumeration techniques
. Elementary probability theory
. Recurrence relations
Replacing Course(s) n/a
Transition n/a
Industrial Experience 0
Assumed Knowledge HSC Mathematics (Bands 5 or 6), or equivalent.
Modes of Delivery Internal Mode
Teaching Methods Lecture
Tutorial
Assessment Items
Contact Hours Tutorial: for 2 hour(s) per Week for Full Term
Lecture: for 4 hour(s) per Week for Full Term
Timetables 2013 Course Timetables for MATH1510
• Last Updated: Monday, 20 May 2013 5:04 PM AEST