MATH 261 (2019) - Home Page

Announcements

Test 2 has been marked and can be collected from the SMS office.

Solutions to the two tests are on the Solutions page.

Here is the enumeration test from 2018.

Homepage

This is the course homepage for MATH261: Discrete Mathematics 2, Trimester 1, 2019.

MATH261 covers graph algorithms and enumeration. Graph theory is the mathematical study of networks, such as electrical networks, or social networks. In algorithmic graph theory, we study computer procedures that answer questions about graphs. Enumeration is the mathematics of counting objects.

All information relating to the course will be found here. That includes copies of the course notes, copies of lecture slides, assignments and solutions, tutorial timetables.

Table of contents

Course Information

  • Assessment is based on weekly assignments, two tests, and a three-hour examination. There will be ten weekly assignments, but the last one will not be assessed. In order to receive any credit for your completed assignments, you must hand in at least 8 out of the 9 assessed assignments.

  • If you do not hand in at least 8 out of the 9 assignments, your final grade will be calculated as the maximum of the following two options.
    • 100% of the exam mark
    • 70% of the exam mark and 30% of the average test mark
  • If you do hand in 8 out of 9 assignments, then your final grade will calculated as the maximum of four options: the two above, and the following two.
    • 91% of the exam mark and 9% of the average assignment mark
    • 61% of the exam mark, 30% of the average test mark, and 9% of the average assignment mark

Lecture timetable

There are three lectures a week. They all take place in Cotton Lecture Theatre 122.

  • Monday 2.10pm
  • Wednesday 2.10pm
  • Friday 2.10pm

Calendar

  • There are two tests, both held in Cotton Lecture Theatre 122.
    • Test 1 is at 6.00pm on Wednesday 27 March.
    • Test 2 is at 2.10pm (normal class time) on Friday 7 June.

Office Hours

  • Rod Downey is available from 1.00 until the start of the lecture on Wednesdays and Fridays, and other times by request. He is happy for someone to see him whenever he is in.

  • Dillon Mayhew is happy for people to knock on his door most of the time, and if he is not in, you should email him to make an appointment.

Course Notes

Course notes

Lecture Slides

Slides from lectures

Assignments

Assignments

Assignments will be made available on this site, and hard copies can be collected in lectures. You will submit your assignments via the Submission System maintained by the School of Engineering and Computer Science.

You can access your marks and graded assignment at https://apps.ecs.vuw.ac.nz/cgi-bin/studentmarks

Solutions

Solutions

Tutorials

Tutorials begin in the second week of the trimester.

Day Start-Fin Room Tutor Style % full 1st tut
Mon 1.10-2pm AM102 Rod Downey / Dillon Mayhew    
Tue 2.10-3pm AM102 Meenu Jose    

Please sign up for a tutorial at MyAllocator.

You are encouraged to attend as many tutorials as like. You should go to at least one a week.

Class Representative

The class representative for MATH261 is George Hanley-Steemers. Thanks George!

Facebook group

Here is the MATH261 facebook group.

University policies and statutes

It is worthwhile becoming familiar with the following information. Other relevant policies can be found at the academic policy website.

Topic attachments
I Attachment Action Size Date Who Comment
2018-test2-modelsolutions.pdfpdf 2018-test2-modelsolutions.pdf manage 473 K 21 May 2019 - 17:16 Main.mayhew  
261-2019-1.pdfpdf 261-2019-1.pdf manage 108 K 21 Feb 2019 - 11:48 Main.downey