Information on this page, including unit offerings, is from the 2017 academic year.
Foundations of Discrete Mathematics (MAS162)
|School||School of Engineering and Information Technology|
|Availability||MURDOCH: S1-internal, S1-external, S2-internal, S2-external|
|Teaching Timetables||Murdoch S1
|Description||In this unit, students will learn to use the prominent mathematical computer package MATLAB to perform basic mathematical procedures and to solve problems in the general area of discrete mathematics. Topics include: recurrence relations, solving equations graphically and iteratively, computer arithmetic, basics of counting and discrete probability, matrices and linear transformations of the plane, propositional and predicate logic, mathematical induction, Boolean algebra and logic networks.|
|Unit Learning Outcomes||On successful completion of the Unit, you should be able to:
1. Formulate and use recursive definitions in various contexts and applications.
2. Write MATLAB programs to solve various mathematical and applied problems.
3. Perform base conversions and explain aspects of computer arithmetic.
4. Use counting techniques and understand the basics of discrete probability.
5. Use matrix algebra and derive linear transformations of the plane.
6. Apply propositional logic to analyse the validity of arguments, express statements in predicate logic and use proof by mathematical induction.
7. Solve basic problems in Boolean algebra and represent a Boolean function as a logic network.
8. Appreciate the important role that computing has in mathematics and the essential importance of discrete mathematics for the foundations of computer science.
9. Present coherent written solutions to various problems related to the material in the Unit.
|Timetabled Learning Activities||Lectures: 3 x 1 hour per week; tutorials: 1 x 1 hour per week; optional Peer Assisted Study Session (PASS): 1 hour per week.|
|Unit Learning Experiences||The approach to learning this unit uses is a combination of lectures, tutorials and self-paced learning. The learning approach is very much problem based using a combination of theoretical and computational viewpoints to investigate and explore the unit material. This is done via examples in lectures and problem solving in tutorials and assessments.|
|Assessment||The assessment in this unit has three main components that are applied as appropriate for internal/external mode. These are: tutorial exercises and assignment questions (25%/30%) and supervised exam (65%/70%)/test (10%/0%). Tutorial participation provides an assessment driven incentive for internal students to keep up with the unit material
throughout the semester. The material covered in the tutorials prepares students for the assignments, mid-semester test, and final exam. The tutorials and assignments are also where students will get feedback on their work from both their tutors and their peers.
|Prerequisites||MAS164 Fundamentals of Mathematics OR a final scaled score of 55% or more in ATAR Mathematics Applications or WACE Mathematics 2C/2D OR a final scaled score of 50% or more in ATAR Mathematics Methods or WACE Mathematics 3A/3B (or higher) OR equivalent.|
|Exclusions||Students who have successfully completed MAS167 Computational Mathematics cannot enrol in this unit for credit.|
2013: 'Computational Mathematics'
|Appears in these Courses/Majors:
see individual structures for context
|Internet Access Requirements||Murdoch units normally include an online component comprising materials, discussions, lecture recordings and assessment activities. All students, regardless of their location or mode of study, need to have access to and be able to use computing devices with browsing capability and a connection to the Internet via Broadband (Cable, ADSL or Mobile) or Wireless. The Internet connection should be readily available and allow large amounts of data to be streamed or downloaded (approximately 100MB per lecture recording). Students also need to be able to enter into online discussions and submit assignments online.|