Topics in Discrete Mathematics - MATHS516 (2020)
An introduction to graph theory and combinatorics, including network optimisation algorithms.
|Prerequisite(s):||MATH258 or COMP235 or MATHS202 or COMPX361|
|Internal assessment / examination:||100:0|
Semesters and Locations
|Occurrence Code||When taught||Where taught|
|20B (HAM)||B Semester : 13 Jul 2020 - 8 Nov 2020||Hamilton|
Timetabled Lectures for Topics in Discrete Mathematics (MATHS516)
|Tue||10:00 AM||11:00 AM||G.3.33||Jul 13 - Oct 18|
|Wed||9:00 AM||10:00 AM||G.3.33||Jul 13 - Oct 18|
|Thu||12:00 PM||1:00 PM||G.3.33||Jul 13 - Oct 18|
NB:There may be other timetabled events for this paper such as tutorials or workshops.
Visit the online timetable for MATHS516 for more details
Indicative Fees for Topics in Discrete Mathematics (MATHS516)
Paper outlines are currently not available for this paper. Please contact the Faculty or School office for further details.
Available Subjects: Mathematics
Paper details current as of : 20 January 2020 2:00pm
Indicative fees current as of : 12 November 2019 11:10am