The University of Newcastle, Australia
Available in 2019

Course handbook

Description

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.


Availability2019 Course Timetables

Callaghan

  • Semester 2 - 2019

Learning outcomes

On successful completion of the course students will be able to:

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

Assumed knowledge

MATH1510Discrete MathematicsDiscrete 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.FSCITFaculty of Science724School of Mathematical and Physical Sciences1010005980Semester 2 - 2019CALLAGHANCallaghan2019HSC Mathematics (Bands 5 or 6), or equivalent. Elementary set theory Relations and functions Graph theory Modular arithmetic Logic and proofs Enumeration techniques Elementary probability theory Recurrence relations YOn successful completion of this course, students will be able to:1Be able to read, interpret and write some basic mathematical notation2Be able to recognise and/or construct examples of mathematical objects introduced during the course, such as sets and functions3Have been introduced to several mathematical models, (e.g. propositional logic, trees) including some of those underlying computing and information technology4Have had the opportunity to develop capacity in knowing what constitutes a valid argument, and in constructing valid arguments/proofs5Have had opportunity to develop problem solving skills; and been introduced to ways of thinking useful for simplifying complex situations Quiz: QuizFormal Examination: Formal examinationWritten Assignment: Written Assignments CallaghanLectureFace to Face On Campus4hour(s)per Week for0Full Term0WorkshopFace to Face On Campus2hour(s)per Week for11Weeks0CallaghanLectureFace to Face On Campus4hour(s)per Week for0Full Term0WorkshopFace to Face On Campus2hour(s)per Week for11Weeks0


Assessment items

Quiz: Quiz

Formal Examination: Formal examination

Written Assignment: Written Assignments


Contact hours

Callaghan

Lecture

Face to Face On Campus 4 hour(s) per Week for Full Term

Workshop

Face to Face On Campus 2 hour(s) per Week for 11 Weeks

Callaghan

Lecture

Face to Face On Campus 4 hour(s) per Week for Full Term

Workshop

Face to Face On Campus 2 hour(s) per Week for 11 Weeks