The University of Adelaide
You are here » Home » Course directory
Text size: S | M | L
Printer Friendly Version
February 2012
M T W T F S S
    1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29        
             

Mathematics for Information Technology I

Go to this course in the University Course Planner.

Description

This course provides an introduction to a number of areas of discrete mathematics with wide applicability. Areas of application include: computer logic, analysis of algorithms, telecommunications, gambling and public key cryptography. In addition it introduces a number of fundamental concepts which are useful in Statistics, Computer Science and further studies in Mathematics.


Objective

To provide an introduction to the elementary concepts of discrete mathematics and probability with applications to information security and encryption.


Content

Topics covered are: Discrete mathematics: sets, relations, logic, graphs, mathematical induction and difference equations; probability and permutations and combinations; information security and encryption: prime numbers, congruences.

 
Year Semester Level Units
2012 2 1 3
Adrian Koerber
Lecturer for this course

Delivery

60 hours lectures, tutorials and computer practicals.


Assessment

Ongoing assessment 30%, exam 70%.


Graduate attributes


Linkage past

No past linkages have been noted.


Linkage present

This subject gives some interesting background and insights into the potential applications of mathematics.


Linkage future

This course is not recorded as prequisite for other courses.


Restrictions

None.


Recommended text

None.