Module Details

Module Code: MATH6055
Title: Maths for Computer Science
Long Title: Maths for Computer Science
NFQ Level: Fundamental
Valid From: Semester 1 - 2018/19 ( September 2018 )
Duration: 1 Semester
Credits: 5
Field of Study: 4610 - Mathematics
Module Delivered in: 7 programme(s)
Module Description: Mathematics is an important component of Computer Science. This module offers a first introduction to some of the principles that computer scientists will use and apply to solving everyday tasks and introduces students to sets, relations, combinatorial graphs and functions.
 
Learning Outcomes
On successful completion of this module the learner will be able to:
# Learning Outcome Description
LO1 Manipulate a wide variety of algebraic expressions and equations.
LO2 Work with the abstract concepts of set and relation.
LO3 Model and solve problems using combinatorial graphs.
LO4 Evaluate real-valued functions and interpret the relationship between real-valued functions and their graphical representations.
Dependencies
Module Recommendations

This is prior learning (or a practical skill) that is strongly recommended before enrolment in this module. You may enrol in this module if you have not acquired the recommended learning but you will have considerable difficulty in passing (i.e. achieving the learning outcomes of) the module. While the prior learning is expressed as named MTU module(s) it also allows for learning (in another module or modules) which is equivalent to the learning specified in the named module(s).
Incompatible Modules
These are modules which have learning outcomes that are too similar to the learning outcomes of this module. You may not earn additional credit for the same learning and therefore you may not enrol in this module if you have successfully completed any modules in the incompatible list.
No incompatible modules listed
Co-requisite Modules
No Co-requisite modules listed
Requirements

This is prior learning (or a practical skill) that is mandatory before enrolment in this module is allowed. You may not enrol on this module if you have not acquired the learning specified in this section.
No requirements listed
 
Indicative Content
Algebra
Simplification and factorisation of expressions. Manipulation and solving of equations. Exponents: definition and properties. Logarithms: definition and properties.
Sets and Relations
Set notation and Venn diagrams. Set operations and the laws of set theory. The cardinality of sets. Generating subsets lexicographically with binary numbers. Cartesian products. Relations: definition, notation and graphical representation. Equivalence relations and equivalence classes.
Combinatorial Graphs
Edges, nodes, graphs, connectedness and valency. Trees, paths and cycles. Eulerian paths and Fleury's algorithm. Hamiltonian paths and Dirac's theorem.
Functions
Functions described as relations. Dependent and independent variables. The graph of a function. Composition and inverses. Examples of linear, quadratic, exponential and logarithmic functions.
Module Content & Assessment
Assessment Breakdown%
Coursework30.00%
End of Module Formal Examination70.00%

Assessments

Coursework
Assessment Type Short Answer Questions % of Total Mark 15
Timing Week 5 Learning Outcomes 1
Assessment Description
In class test.
Assessment Type Short Answer Questions % of Total Mark 15
Timing Week 9 Learning Outcomes 2,3
Assessment Description
In-class test.
End of Module Formal Examination
Assessment Type Formal Exam % of Total Mark 70
Timing End-of-Semester Learning Outcomes 1,2,3,4
Assessment Description
End of Semester Formal Examination
Reassessment Requirement
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.

The University reserves the right to alter the nature and timings of assessment

 

Module Workload

Workload: Full Time
Workload Type Contact Type Workload Description Frequency Average Weekly Learner Workload Hours
Lecture Contact Lecture underpinning learning outcomes Every Week 3.00 3
Tutorial Contact Tutorial supporting content given in lecture Every Week 1.00 1
Independent Learning Non Contact Independent study Every Week 3.00 3
Total Hours 7.00
Total Weekly Learner Workload 7.00
Total Weekly Contact Hours 4.00
Workload: Part Time
Workload Type Contact Type Workload Description Frequency Average Weekly Learner Workload Hours
Lecture Contact Lecture underpinning learning outcomes Every Week 3.00 3
Tutorial Contact Tutorial supporting content given in class Every Week 1.00 1
Independent Learning Non Contact Independent study Every Week 3.00 3
Total Hours 7.00
Total Weekly Learner Workload 7.00
Total Weekly Contact Hours 4.00
 
Module Resources
Recommended Book Resources
  • Taylor, J. and Garnier, R.. (2010), Discrete Mathematics, Proofs, Structures, and Applications, 3. CRC Press, [ISBN: 978143981280].
  • Stroud, K.A. and Booth, Dexter J.. (2009), Foundation Mathematics, Palgrave MacMillan, England, [ISBN: 9780230579071].
Supplementary Book Resources
  • Grossman, P.. (2009), Discrete Mathematics for Computing, 3. Palgrave Macmillan, [ISBN: 9780230216112].
This module does not have any article/paper resources
Other Resources
 
Module Delivered in
Programme Code Programme Semester Delivery
CR_KSDEV_8 Bachelor of Science (Honours) in Software Development 1 Mandatory
CR_KDNET_8 Bachelor of Science (Honours) in Computer Systems 1 Mandatory
CR_KITMN_8 Bachelor of Science (Honours) in IT Management 1 Mandatory
CR_KWEBD_8 Bachelor of Science (Honours) in Web Development 1 Mandatory
CR_KITSP_7 Bachelor of Science in Information Technology 1 Mandatory
CR_KCOMP_7 Bachelor of Science in Software Development 1 Mandatory
CR_KCOME_6 Higher Certificate in Science in Software Development 1 Mandatory