MATHEMATICS FOR IT

MAT1MIT

2020

Credit points: 15

Subject outline

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).

SchoolEngineering and Mathematical Sciences

Credit points15

Subject Co-ordinatorChristopher Lenard

Available to Study Abroad/Exchange StudentsYes

Subject year levelYear Level 1 - UG

Available as ElectiveNo

Learning ActivitiesN/A

Capstone subjectNo

Subject particulars

Subject rules

PrerequisitesN/A

Co-requisitesN/A

Incompatible subjectsN/A

Equivalent subjectsN/A

Quota Management StrategyN/A

Quota-conditions or rulesN/A

Special conditionsN/A

Minimum credit point requirementN/A

Assumed knowledgeN/A

Career Ready

Career-focusedNo

Work-based learningNo

Self sourced or Uni sourcedN/A

Entire subject or partial subjectN/A

Total hours/days requiredN/A

Location of WBL activity (region)N/A

WBL addtional requirementsN/A

Graduate capabilities & intended learning outcomes

Graduate Capabilities

Intended Learning Outcomes

01. Use the laws of algebra to manipulate and simplify numerical and symbolic expressions.
02. Use appropriate rules to manipulate powers, exponentials and logarithms, and apply these methods to problems in information systems and time complexity.
03. Solve simple problems in modular arithmetic, and use modular arithmetic to encrypt and decrypt messages using basic cryptographic schemes.
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.
05. Describe basic concepts of graph theory and lossless data compression, and apply simple algorithms based on trees to optimization problems and Huffman codes.
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.

Subject options

Select to view your study options…

Start date between: and    Key dates

Bendigo, 2020, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Subject Instance Co-ordinatorChristopher Lenard

Class requirements

Lecture Week: 10 - 22
Three 1.00 h lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

Tutorial Week: 10 - 22
One 1.00 h tutorial per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

Assessments

Assessment elementCommentsCategoryContributionHurdle% ILO*
One 3-hour examinationN/AN/AN/ANo60 SILO1, SILO2, SILO3, SILO4, SILO5, SILO6
One 50-minute test (20%) and two 30-minute tests (each 10%)N/AN/AN/ANo40 SILO1, SILO2, SILO3, SILO4, SILO6