mat1dis discrete mathematics
Credit points: 15
In Discrete Mathematics you will explore some important mathematical ideas that play a key role in modern computing. Topics include number bases, logic, sets, relations, recursion, Boolean algebra and cryptography. Although Discrete Mathematics is designed in particular for those who are studying information technology, the subject is relevant and useful for any person with an interest in contemporary mathematics and its applications.
SchoolSchool Engineering&Mathematical Sciences
Subject Co-ordinatorSimon Smith
Available to Study Abroad StudentsYes
Subject year levelYear Level 1 - UG
|Resource Type||Title||Resource Requirement||Author and Year||Publisher|
|Readings||Discrete mathematics for computing.||Prescribed||Grossman, P.||3RD EDN. PALGRAVE MACMILLAN, BASINGSTOKE, 2009.|
Graduate capabilities & intended learning outcomes
01. By the end of this subject, students will be able to convert numbers between bases, carry out arithmetic in non-decimal bases, and apply some of the mathematical ideas involved in storing and manipulating numbers in a computer.
- Students are required to convert numbers between bases, carry out arithmetic in non-decimal bases, and solve mathematical problems related to the storage and manipulation of numbers in computers, in Test 1 and the exam.
02. Apply the laws of logic and truth tables to establish and verify equivalences in propositional and simple predicate logic.
- Students are required to solve a variety of problems in propositional and simple predicate logic, supported by appropriate explanations, in Tests 1 and 2 and the exam.
03. Demonstrate an understanding of basic concepts of set theory, and use the laws of sets to establish set equalities.
- Students are required to solve problems in elementary set theory, and to use the laws of sets to simplify a given expression, in Test 2 and the exam.
04. Classify, and construct examples of, binary relations according to key properties that they may or may not possess, and determine structures (e.g. partitions) that equivalence and partial order relations generate in their underlying sets.
- Students are required to solve problems on binary relations, and to construct examples of relations with specific properties, supported by appropriate explanations, in Test 2 and the exam.
05. Analyze and design simple iterative and recursive algorithms.
- Students are required to solve problems related to recursion (particularly recursively-defined sequences) and simple recursive algorithms in Test 2 and the exam.
06. Apply the laws of Boolean algebra to the simplification of Boolean expressions and design of digital circuits.
- Students are required to solve problems in Boolean algebra and its applications in the exam.
07. Encrypt and decrypt messages using fundamental secret key and public key methods.
- Students are required to encrypt and decrypt short messages in the exam.
08. Demonstrate effective written communication skills by presenting mathematical ideas and solutions to problems in a clear and logical fashion, supported by appropriate explanations and correct use of mathematical notation.
- Students are required to demonstrate effective communication skills in Tests 1 and 2 and the exam. In all assessment items, communication is one of the factors taken into account when awarding marks to question responses.
Select to view your study options…
Bendigo, 2015, Semester 2, Day
Maximum enrolment sizeN/A
Subject Instance Co-ordinatorSimon Smith
TutorialWeek: 31 - 43
One 1.0 hours tutorial per week on weekdays during the day from week 31 to week 43 and delivered via face-to-face.
LectureWeek: 31 - 43
Three 1.0 hours lecture per week on weekdays during the day from week 31 to week 43 and delivered via face-to-face.
|one 3-hour examination||65||01, 02, 03, 04, 05, 06, 07, 08|
|two 50-minute tests (15% and 20%)||35||01, 02, 03, 04, 05, 08|