Full Title:Mathematics for Computing 2
Language of Instruction:English
Module Code:MATH C7Z06
 
Credits: 5
Valid From:Semester 1 - 2014/15 ( September 2014 )
Module Delivered in No Programmes
Module Description:Introduction to Linear Algebra, Graph theory and Sequences and Series and their application in computing.
Learning Outcomes:
On successful completion of this module the learner should be able to
  1. Work with formula and recursive definitions of a sequence and understand arithmetric and geometric sequences and series.
  2. Construct graphs to represent computing problems and apply suitable algorithms to solve these problems
  3. Preform matrix arithmetic and use to solve a system of simultaneous equations and perform 2D transformations.
  4. Use matrices to manipulate objects in 2d & 3d.
 

Module Content & Assessment

Indicative Content
Sequences and Series
Arithmetic; Geometric; Recursive Sequences; Summation and Sum to infinity.
Graph Theory
­Graph types; trees; representations of graphs; ­Dijkstra’s Algorithm; Prim’s Algorithm.
Linear Algebra
Matrices; Matrix Operations; Determinant; Inverse of a matrix; Use of matrices to solve system of simultaneous equations; 2D transformations.
Matrices and Movement
Translations, Scaling, Reflections & Rotations. Combi matrices.
Assessment Breakdown%
Course Work50.00%
End of Module Formal Examination50.00%

Full Time

Course Work
Assessment Type Assessment Description Outcome addressed % of total Marks Out Of Pass Marks Assessment Date Duration
Short Answer Questions Written test 1,2 25.00 0 0 Week 7 0
Short Answer Questions Written test 3,4 25.00 0 0 Week 12 0
No Project
No Practical
End of Module Formal Examination
Assessment Type Assessment Description Outcome addressed % of total Marks Out Of Pass Marks Assessment Date Duration
Formal Exam End-of-Semester Final Examination 1,2,3,4 50.00 0 0 End-of-Semester 0
Reassessment Requirement
A repeat examination
Reassessment of this module will consist of a repeat examination. It is possible that there will also be a requirement to be reassessed in a coursework element.

DKIT reserves the right to alter the nature and timings of assessment

 

Module Workload & Resources

Workload: Full Time
Workload Type Workload Description Hours Frequency Average Weekly Learner Workload
Lecture   3.00 Every Week 3.00
Tutorial   1.00 Every Week 1.00
Directed Reading No Description 1.00 Every Week 1.00
Independent Study No Description 3.00 Every Week 3.00
Total Weekly Learner Workload 8.00
Total Weekly Contact Hours 4.00
Workload: Part Time
Workload Type Workload Description Hours Frequency Average Weekly Learner Workload
Lecture No Description 3.00 Every Week 3.00
Tutorial No Description 1.00 Every Week 1.00
Directed Reading No Description 1.00 Every Week 1.00
Independent Study No Description 3.00 Every Week 3.00
Total Weekly Learner Workload 8.00
Total Weekly Contact Hours 4.00
Resources
Recommended Book Resources
  • Basta, Delong, Basta 2013, Mathematics for Information Technology, Int Ed., Delmar [ISBN: 978-1111307929]
  • Seymour Lipschitz 1982, Essential Computing Mathematics, McGraw-Hill [ISBN: 978-00703799909]
This module does not have any article/paper resources
Other Resources