Module Descriptors
MATHEMATICS FOR COMPUTING AND IT
XMAT50361
Key Facts
Faculty of Computing, Engineering and Sciences
Level 5
10 credits
Hours of Study
Scheduled Learning and Teaching Activities: 36
Independent Study Hours: 44
Total Learning Hours: 80
Assessment
- MULTI-CHOICE TEST weighted at 50%
- EXAMINATION - UNSEEN IN EXAMINATION CONDITIONS weighted at 50%
Module Details
Module Assessment
A MULTI-CHOICE TEST length .83 HOUR(S) weighted at 50%. A EXAMINATION - UNSEEN IN EXAMINATION CONDITIONS length 1.5 HOUR(S) weighted at 50%.
Module Indicative Content
Discrete probability: basic theory, joint probabilities and conditional probabilities, probability trees
Introduction to matrices and the basic operations including the inverse of a 2x2 matrix
Truth tables and an introduction to logic including the testing of the validity of arguments
Introduction to graph theory: undirected , directed and weighted graphs. Algorithms for minimum spanning tree (unrooted and rooted)
Basic differentiation with applications to simple polynomials and investigation of their extrema.
Module Learning Outcome
1. Solve simple probability problems using the laws of probability and probability trees.
2. Manipulate matrices and apply them to solve simultaneous equations in two unknowns and model 2-dimensional transformations.
3. Construct truth tables of logic functions and use them to test the validity of arguments.
4. Apply simple algorithms to weighted graphs.
5. Differentiate polynomial functions and apply calculus to investigate the maxima and minima of simple polynomial functions.
This module will also give you opportunity to demonstrate the following skills:
(a) Understanding of a specific body of knowledge and skills
(b) Evaluate
(c) Application of number appropriate to discipline or career needs
2. Manipulate matrices and apply them to solve simultaneous equations in two unknowns and model 2-dimensional transformations.
3. Construct truth tables of logic functions and use them to test the validity of arguments.
4. Apply simple algorithms to weighted graphs.
5. Differentiate polynomial functions and apply calculus to investigate the maxima and minima of simple polynomial functions.
This module will also give you opportunity to demonstrate the following skills:
(a) Understanding of a specific body of knowledge and skills
(b) Evaluate
(c) Application of number appropriate to discipline or career needs
Module Additional Assessment Details
1. Three tests (50%) consisting of multichoice questions (Learning outcomes 1,2,3,5, a-c)
2. Exam (50%) (Learning outcomes 1-5, a-c)
2. Exam (50%) (Learning outcomes 1-5, a-c)
Module Resources
A scientific calculator.
Module Texts
For background reading only, e.g.
Maurer S B and Ralston A - Discrete Algorithmic Mathematics, Addison -Wesley, 1991
Wilson R and Watkin JJ- Graphs, An Introductory Approach, Wiley 1990
Maurer S B and Ralston A - Discrete Algorithmic Mathematics, Addison -Wesley, 1991
Wilson R and Watkin JJ- Graphs, An Introductory Approach, Wiley 1990
Module Learning Strategies
You will learn the core material through lectures (24 hours) and tutorials (12 hours). In the tutorials, exercises and problems will be attempted and discussed to reinforce and apply the salient points of the lectures. Each week you will be encouraged to attempt further exercises and problems in your independent study time.
Within this module you will be introduced to and/or be able to develop your
- Intellectual skills
- Communication
- Problem solving
- Application of number
- Information Technology
- Personal skills for Lifelong Learning
Within this module you will be introduced to and/or be able to develop your
- Intellectual skills
- Communication
- Problem solving
- Application of number
- Information Technology
- Personal skills for Lifelong Learning