Skip to main content
### Details

#####
Courses that offer this unit

Non-award/non-degree study If you wish to undertake one or more units of study (subjects) for your own interest but not towards a degree, you may enrol in single units as a non-award student. Cross-institutional study If you are from another Australian tertiary institution you may be permitted to undertake cross-institutional study in one or more units of study at the University of Sydney.
To help you understand common terms that we use at the University, we offer an online glossary.
## Media

## Student links

Year - 2020

This unit introduces students to several related areas of discrete mathematics, which serve their interests for further study in pure and applied mathematics, computer science and engineering. Topics to be covered in the first part of the unit include recursion and induction, generating functions and recurrences, combinatorics. Topics covered in the second part of the unit include Eulerian and Hamiltonian graphs, the theory of trees (used in the study of data structures), planar graphs, the study of chromatic polynomials (important in scheduling problems).

Classes

Three 1 hour lectures, one 1 hour tutorial and one 1 hour practice class per week.

Assessment

One 2 hour exam, assignments, quizzes (100%)

6 credit points of Junior Mathematics units

ProhibitionsMATH2011 or MATH2009 or MATH2969

Faculty: Science

Semester 1

24 Feb 2020

Department/School: Mathematics and Statistics Academic Operations

Study Mode: Normal (lecture/lab/tutorial) day

Census Date: 31 Mar 2020

Unit of study level: Intermediate

Credit points: 6.0

EFTSL: 0.125

Available for study abroad and exchange: Yes

Faculty/department permission required? No

Location

Camperdown

More details

HECS Band: 2

Leadership for good starts here

ABN: 15 211 513 464

CRICOS Number: 00026A

TEQSA: PRV12057