Credit points: 15
This subject is an introduction to discrete mathematics, which is a fundamental part of modern mathematics and essential background knowledge for computer scientists. Designed for students enroled in coursework masters programs, the subject contains a range of topics not typically taught in a standard undergraduate mathematics curriculum. Among the topics covered are: numbers in bases other than 10, recurrence relations, complexity of algorithms, graph theory, Boolean logic, and finite state machines. Examples within each topic are chosen with a view to their relevance to computer science. Project work is designed to help students develop their mathematical problem-solving and research skills in a team setting.
FacultyFaculty of Science, Tech & Engineering
Subject Co-ordinatorNarwin Perkal
Available to Study Abroad StudentsYes
Subject year levelYear Level 4 - UG/Hons/1st Yr PG
Prerequisites Enrolment in one of the following courses: SMIT, SMICT, SMCSC, SMBBS, SGBS, SGDCS, SGDIT, SPCS, SGCS.
Incompatible subjects CSE21DMO, MAT12DM, MAT11DM, MAT1DM
|Resource Type||Title||Resource Requirement||Author and Year||Publisher|
|Readings||N/A||Prescribed||Booklist available from the Department of Mathematics.||N/A|
|Readings||FSTE First Year Survival Guide (second edition)||Recommended||Faculty of Science, Technology and Engineering||LA TROBE UNIVERSITY 2012|
Select to view your study options…
Melbourne, 2014, Semester 1, Day
Maximum enrolment sizeN/A
Subject Instance Co-ordinatorNarwin Perkal
Two 1.0 hours practical per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
One 1.0 hours lecture/workshop per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Two 1.0 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
|5 Written Assignments due fortnightly (typically 3-4 pages each)||10|
|Team Project Report approx 6000 words||10|
|one 3-hour examination||80|