mat1dm discrete mathematics
DISCRETE MATHEMATICS
MAT1DM
2015
Credit points: 15
Subject outline
The subject is an introduction to discrete mathematics, which is a fundamental part of modern mathematics. The subject contains a range of important mathematical topics not taught in secondary school nor in other undergraduate subjects. Students interested in going on with mathematics are strongly encouraged to enrol in this subject. Among the topics covered are: numbers in bases other than 10, recurrence relations, complexity of algorithms, graph theory, Boolean logic, and finite state machines. All these topics are central to the application of mathematics in electronics and computer science. Examples within each topic are chosen with a view to helping students develop their problem-solving skills.
SchoolSchool Engineering&Mathematical Sciences
Credit points15
Subject Co-ordinatorYuri Nikolayevsky
Available to Study Abroad StudentsYes
Subject year levelYear Level 1 - UG
Exchange StudentsYes
Subject particulars
Subject rules
PrerequisitesN/A
Co-requisitesN/A
Incompatible subjects CSE21DMO, MAT12DM, MAT11DM
Equivalent subjectsN/A
Special conditionsN/A
Learning resources
Readings
| Resource Type | Title | Resource Requirement | Author and Year | Publisher |
|---|---|---|---|---|
| Readings | Discrete Mathematics | Prescribed | Department of Mathematics. | Department of Mathematics., La Trobe University |
| Readings | FSTE First Year Survival Guide (second edition) | Recommended | Faculty of Science, Technology and Engineering | LA TROBE UNIVERSITY 2012 |
Graduate capabilities & intended learning outcomes
01. Implement algebraic and graphical methods in logic and circuits.
- Activities:
- Students are required to apply techniques in exam questions, 2 assignments and 3 quizzes.
02. Analyse mathematical processes and use algorithms arising in computer science.
- Activities:
- Students are required to analyse or apply algorithms in exam questions, 5 assignments and 5 quizzes.
03. Perform arithmetic in number bases arising in the study of computing processes.
- Activities:
- Students are required to solve numerical problems in exam questions, 2 assignments and 1 quiz.
04. Analyse and classify network graphs and related objects according to various significant properties.
- Activities:
- Students are required to analyse edge/vertex graphs and classify different types of graphs in exam questions, 2 assignments and 3 quizzes.
05. Obtain formulas describing iterative and recursive processes in enumeration.
- Activities:
- Students are required to find formulas and check formulas are correct in exam questions, 2 assignments and 2 quizzes.
06. Perform brief independent investigations using provided resources and implement the outcomes of the investigation to perform basic mathematical and computer exercises.
- Activities:
- 2 marks on each of 5 assignments designated for "Independent Learning" question.
07. Present mathematical thinking in succinct written form using both words and mathematical notation.
- Activities:
- Written assignments and the exam have marks specifically allocated to appropriate communication of ideas leading to solutions.
Subject options
Select to view your study options…
Dandenong, 2015, Semester 1, Day
Overview
Online enrolmentYes
Maximum enrolment sizeN/A
Enrolment information
Subject Instance Co-ordinatorKevin Bicknell
Class requirements
PracticalWeek: 10 - 22
Two 1.0 hours practical per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Lecture/WorkshopWeek: 10 - 22
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.
LectureWeek: 10 - 22
Two 1.0 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Assessments
| Assessment element | Comments | % | ILO* |
|---|---|---|---|
| 5 fortnightly assignments (typically 3-4 pages each) | 20 | 01, 02, 03, 04, 05, 06, 07 | |
| five diagnostic tests | 10 | 01, 02, 03, 04, 05 | |
| one 3-hour examination | 70 | 01, 02, 03, 04, 05, 07 |
Melbourne, 2015, Semester 1, Day
Overview
Online enrolmentYes
Maximum enrolment sizeN/A
Enrolment information
Subject Instance Co-ordinatorYuri Nikolayevsky
Class requirements
PracticalWeek: 10 - 22
Two 1.0 hours practical per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Lecture/WorkshopWeek: 10 - 22
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.
LectureWeek: 10 - 22
Two 1.0 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Assessments
| Assessment element | Comments | % | ILO* |
|---|---|---|---|
| 5 fortnightly assignments (typically 3-4 pages each) | 20 | 01, 02, 03, 04, 05, 06, 07 | |
| five diagnostic tests | 10 | 01, 02, 03, 04, 05 | |
| one 3-hour examination | 70 | 01, 02, 03, 04, 05, 07 |