Discrete Structures - MATHS135 (2019)
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|
|19A (HAM)||A Semester : 25 Feb 2019 - 23 Jun 2019||Hamilton|
Timetabled Lectures for Discrete Structures (MATHS135)
|Mon||2:00 PM||3:00 PM||L.G.01||Feb 25 - Jun 2|
|Thu||11:00 AM||12:00 PM||ELT.G.01||Feb 25 - Jun 2|
|Fri||2:00 PM||3:00 PM||ELT.G.01||Feb 25 - Jun 2|
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)
Paper Outlines for Discrete Structures (MATHS135)
The following paper outlines are available for Discrete Structures (MATHS135).
If your paper occurrence is not listed contact the Faculty or School office.
Paper details current as of : 21 August 2019 9:39am
Indicative fees current as of : 29 July 2019 3:04pm