MATHEMATICS FOR IT
Credit points: 15
In Mathematics for IT you will develop and consolidate key algebra skills that are needed for your information technology course or to support your studies in areas such as science or education. As well, you will be introduced to several aspects of modern mathematics, such as number theory, error-detecting codes and graph theory, which are not only fundamental to IT, but which also play an important role in everyday life. Wherever possible, practical applications of the mathematics will be illustrated and emphasised. Successful completion of Mathematics for IT will mean you have quantitative skills in place to support your studies in IT or other discipline area, and will also ensure you are well-prepared for the subject Discrete Mathematics (MAT1DIS).
SchoolSchool Engineering&Mathematical Sciences
Subject Co-ordinatorChristopher Lenard
Available to Study Abroad StudentsYes
Subject year levelYear Level 1 - UG
Graduate capabilities & intended learning outcomes
01. Use the laws of algebra to manipulate and simplify numerical and symbolic expressions.
- Students are required to manipulate and simplify numerical and symbolic expressions in Test 1 and the exam.
02. Use appropriate rules to manipulate powers, exponentials and logarithms, and apply these methods to problems in information systems and time complexity.
- Students are required to solve a range of problems related to powers, exponentials and logarithms, and their applications, in Test 2 and the exam.
03. Solve simple problems in modular arithmetic, and use modular arithmetic to encrypt and decrypt messages using basic cryptographic schemes.
- Students are required to solve a range of problems related to modular arithmetic and its applications to cryptography, supported by appropriate explanations, in Test 3 and the exam.
04. Demonstrate an effective understanding of the principles of error-detecting and error-correcting codes by solving problems related to the use of such codes.
- Students are required to solve a range of problems related to error-detecting and error-correcting codes (such as the EAN-13 barcode, credit card numbers and simple binary codes), supported by appropriate explanations, in Test 3 and the exam.
05. Describe basic concepts of graph theory and lossless data compression, and apply simple algorithms based on trees to optimization problems and Huffman codes.
- Students are required to provide short written answers to questions, and to use appropriate ideas and algorithms from graph theory to solve given network and encoding problems, in the exam.
06. 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, 2 and 3 and the exam. In the tests, marks are allocated specifically to communication, while in the exam, communication is one of the factors taken into account when awarding marks to question responses.
Select to view your study options…
Bendigo, 2019, Semester 1, Day
Maximum enrolment sizeN/A
Subject Instance Co-ordinatorChristopher Lenard
Three 1.0 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
One 1.0 hours tutorial per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
|one 3-hour examination||60||01, 02, 03, 04, 05, 06|
|one 50-minute test (20%) and two 30-minute tests (each 10%)||40||01, 02, 03, 04, 06|