Accessibility Skip to Global Navigation Skip to Local Navigation Skip to Content Skip to Search Skip to Site Map Menu

MATH272 Discrete Mathematics

Graph theory and algorithms; combinatorial counting techniques; sets, relations, modular arithmetic and applications to cryptography. There will be an emphasis on both proof techniques and practical algorithms.

Paper title Discrete Mathematics
Paper code MATH272
Subject Mathematics
EFTS 0.1500
Points 18 points
Teaching period Second Semester
Domestic Tuition Fees (NZD) $851.85
International Tuition Fees (NZD) $3,585.00

^ Top of page

Prerequisite
MATH 170 or MATH 103
Schedule C
Arts and Music, Science
Eligibility
This paper should be of interest to three main groups:
  • The first covers anyone who has ever had an interest in puzzles of a mathematical nature. This is because the topics of the paper frequently come very close to the concepts often used in such puzzles
  • The second group is Computer Science students. Discrete mathematics ideas are useful in computer science, especially where algorithms and computability are concerned
  • Finally, the paper should be of interest to Mathematics majors and Honours students. It provides a good foundation for other papers, both as background and in exposure to proof techniques
Contact
maths@otago.ac.nz
Teaching staff
Professor Robert Aldred
Paper Structure
Main topics from:
  • Basic counting, inclusion-exclusion
  • Logical equivalence, rules of inference
  • Introduction to graph theory
  • Set theory
  • Congruences and elementary number theory
  • Cryptography
Teaching Arrangements
Five lectures per fortnight and one weekly tutorial
Textbooks
Required text: Discrete and Combinatorial Mathematics 5th edition by Ralph P. Grimaldi

Useful references: A First Look At Graph Theory, J Clark and D A Holton, World Scientific (1996)
Course outline
View course outline for MATH 272
Graduate Attributes Emphasised
Communication, Critical thinking.
View more information about Otago's graduate attributes.
Learning Outcomes
Students will learn how to formulate and test rigorous discrete mathematical concepts.

^ Top of page

Timetable

Second Semester

Location
Dunedin
Teaching method
This paper is taught On Campus
Learning management system
Other

Lecture

Stream Days Times Weeks
Attend
L1 Monday 16:00-16:50 28-34, 36-41
Wednesday 16:00-16:50 28-34, 36-41
Thursday 16:00-16:50 28-34, 36-41

Tutorial

Stream Days Times Weeks
Attend
T1 Tuesday 14:00-14:50 29-34, 36-41