Discrete Mathematics II - DMTH237
The purpose of this unit is to give a grounding in discrete mathematics. It is important preparation for both theoretical computing and abstract algebra. In particular, the unit: explores the concept of computability, and the measures of computational complexity and finite state machines; studies recurrence relations and generating functions; provides an introduction to matrices with applications to systems of linear equations and vectors; applies graph theory to a range of problems; and examines a variety of error correcting and public key cryptography codes
| Credit Points: | 3 |
| When Offered: | S1 Day - Session 1, North Ryde, Day |
| Staff Contact(s): | Mathematics staff |
| Prerequisites: | |
| Corequisites: | |
| NCCW(s): | MATH237 |
| Unit Designation(s): | |
| Unit Type: | |
| Assessed As: | Graded |
| Offered By: | Department of Mathematics Faculty of Science and Engineering |
Course structures, including unit offerings, are subject to change.
Need help? Ask us.