You can contact staff by:
- Calling +64 7 838 4466 select option 1, then enter the extension.
Extensions starting with 4, 5, 9 or 3 can also be direct dialled:
- For extensions starting with 4: dial +64 7 838 extension.
- For extensions starting with 5: dial +64 7 858 extension.
- For extensions starting with 9: dial +64 7 837 extension.
- For extensions starting with 3: dial +64 7 2620 + the last 3 digits of the extension e.g. 3123 = +64 7 262 0123.
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.
Students have until the sixth Friday from Mon 18th July to determine if they wish to change down to a less difficult Mathematics paper (subject to lecturer’s approval) without any fees loss. It is recommended such a change be done as soon as possible.
The learning outcomes for this paper are linked to Washington Accord graduate attributes WA1-WA11. Explanation of the graduate attributes can be found at: https://www.ieagreements.org/ .
There are 3 lectures per week, delivered on the Hamilton campus. These will be recorded via Panopto for later viewing on MOODLE. Tutorials start in week 2. During week 1 students should choose a tutorial slot online (via MOODLE). Tutorials give assistance and feedback with problems and assignments. There will also be a zoom tutorial for students who cannot come onto campus. A link for this will appear on Moodle. Students who are ill can use the ZOOM tutorial until they recover.
Students who successfully complete the paper should be able to:
Understand notation and basic concepts (WA1)
The student will become familiar with the notions and ideas of
Linked to the following assessments:• Assignments (1)• Quizzes (2)• Exam (3)
- sets, functions, and binary relations defined on sets (especially partial orders and equivalence relations).
- directed and undirected graphs and some of their applications.
- combinatorial concepts such as permutations and combinations, and methods of counting, and ability to apply them.
- modular arithmetic.
- logical formulae and formal logical argument.
Apply concepts and solve problems (WA1)
The student will learn to apply these concepts and solve basic problems relating to the topics listed above. They will understand the application of these ideas to theoretical computer science.Linked to the following assessments:• Assignments (1)• Quizzes (2)• Exam (3)
The convenor reserves the right to change assessment weightings and/or the form of assessment in response to changing circumstances.
Assessment will consist of
- Assignments (25%)
- Quizzes (25%)
- Exam (50%)
In order to pass this paper with an unrestricted grade (Grade C- or better) you must get an overall total of 50% or greater, and ALSO at least 40% in the exam.
Assignments: There is a weekly assignment. This should be submitted to the mailbox in FG-link. If you are unable to come onto campus you can also submit your assignments online via a mailbox on Moodle, however we ask that you submit a paper version if you are able to do so as online assignments are more difficult to mark and it is harder to give feedback. If you submit online we ask that you include a short explanation for why you cannot submit a paper version. An assignment mark of zero will be awarded for missed assignments however your worst assignment mark will not be counted. This is intended to make allowance for short term illness without the need to deal with medical certificates. If there is a problem that will cause you to miss more than one assignment you should contact the convenor.
Quizzes: We will be having a Moodle quiz each week. These are timed and should take half an hour or less. Once you start a quiz you must finish within the time limit. A mark of zero will be awarded for missed quizzes however your worst quiz mark will not count. This is to allow for one incident of illness and/or power cut or internet outage without the need for medical certificates or other paperwork. If a problem causes you to miss more than one quiz you should contact the convenor.
Exam: This is a compulsory item of assessment. If you miss the exam you will be awarded the grade of IC (incomplete). You may apply to the Examinations Office for special consideration if you are forced to miss an exam for good reason. Anything to do with examinations is the domain of the Examinations Office.
If you are enrolled in a BE (Hons) degree: Samples of your work may be required as part of the Engineering New Zealand accreditation process for BE (Hons) degrees. Any samples taken will have the student name and ID redacted. If you do not want samples of your work collected, then please email the engineering administrator, Natalie Shaw (email@example.com ), to opt out.
The internal assessment/exam ratio (as stated in the University Calendar) is 50:50. There is no final exam. The final exam makes up 50% of the overall mark.
The internal assessment/exam ratio (as stated in the University Calendar) is 50:50 or 0:0, whichever is more favourable for the student. The final exam makes up either 50% or 0% of the overall mark.
Error: Assessment components must add up to 100%
At least one Assessment Component needs to be entered
|Component Description||Due Date||Time||Percentage of overall mark||Submission Method||Compulsory|
Required and Recommended Readings*
Linkages to Other Papers*
Prerequisite papers: At least one of MATHS165 or MATHS166; or 14 credits in NCEA Level 3 Mathematics.