An introduction to a number of the structures of discrete mathematics with wide applicability in areas such as: computer logic, analysis of algorithms, telecommunications, networks and public key cryptography. In addition it introduces a number of fundamental concepts which are useful in Statistics, Computer Science and further studies in Mathematics. Topics covered are: sets, binary relations, directed and undirected graphs; propositional and some predicate logic; permutations, combinations, and elementary probability theory; modular arithmetic.
|Prerequisite(s):||At least one of MATHS165, MATHS166, MATH165, MATH166, or 16 credits in NCEA Level 3 Mathematics.|
|Internal assessment / examination:||50:50|
Semesters and Locations
|Occurrence Code||When taught||Where taught|
|20B (HAM)||B Semester : 13 Jul 2020 - 8 Nov 2020||Hamilton|
|20B (TGA)||B Semester : 13 Jul 2020 - 8 Nov 2020||Tauranga|
Timetabled Lectures for Discrete Structures (MATHS135)
|Mon||11:00 AM||12:00 PM||ELT.G.01||Jul 13 - Oct 18|
|Thu||9:00 AM||10:00 AM||L.G.01||Jul 13 - Oct 18|
|Fri||9:00 AM||10:00 AM||L.G.01||Jul 13 - Oct 18|
|Mon||2:00 PM||3:00 PM||TCBD.2.13||Jul 13 - Oct 18|
|Thu||1:00 PM||2:00 PM||TCBD.2.13||Jul 13 - Oct 18|
|Fri||12:00 PM||1:00 PM||TCBD.3.02||Jul 13 - Oct 18|
NB:There may be other timetabled events for this paper such as tutorials or workshops.
Visit the online timetable for MATHS135 for more details
Indicative Fees for Discrete Structures (MATHS135)
The following 2019 paper outlines are available for MATHS135. Please contact the Faculty or School office for details on 2020 outlines.
Paper details current as of : 26 February 2020 3:05pm
Indicative fees current as of : 31 January 2020 4:26pm