MATHS135

Discrete Structures

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.

MATHS135 - 18B (HAM)

15.0 Points

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.

Restriction(s): COMP235, MATH258

Internal assessment/examination ratio: 1:1

Timetabled Lectures

The Timetable for 2018 is not available.

Indicative Fees

Fees for 2018 are not yet available.

Paper Outlines

Paper outlines are currently not available for this paper. Please contact the Faculty or School office for further details.

Available Subjects:  Computer Science | Applied Computing | Mathematics | Software Engineering

Paper details current as of : 20 September 2017 4:40pm
Indicative fees current as of : 21 September 2017 4:30am

This page has been reformatted for printing.