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|
|Teaching period||Not offered in 2015, expected to be offered in 2016|
|Domestic Tuition Fees||Tuition Fees for 2015 have not yet been set|
|International Tuition Fees||Tuition Fees for international students are elsewhere on this website.|
- MATH 170 or MATH 103
- Schedule C
- Arts and Music, Science
- Teaching staff
- Professor Robert Aldred
- More information link
- View further information about MATH 272
- Paper Structure
- Main topics
- Basic counting, inclusion-exclusion
- Logical equivalence, rules of inference
- Introduction to graph theory
- Set theory
- Congruences and elementary number theory
- Required text:
Discrete and Combinatorial Mathematics 5th edition by Ralph P. Grimaldi
A First Look At Graph Theory, J Clark and D A Holton, World Scientific (1996)
- Graduate Attributes Emphasised
- Critical thinking. View more information about Otago's graduate attributes.
- Course outline
- View course outline for MATH 272
- Learning Outcomes
- Students will learn how to formulate and test rigourous discrete mathematical concepts.
- 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 mathematical majors and honours students. It provides a good foundation for other papers, both as background and in exposure to proof techniques.
Not offered in 2015, expected to be offered in 2016
- Teaching method
- This paper is taught On Campus
- Learning management system