Registry

Module Specifications

Current Academic Year 2012 - 2013
Please note that this information is subject to change.

Module Title IT Mathematics
Module Code MS121
School School of Mathematics
Online Module Resources

Module Co-ordinatorSemester 1: Niamh O'Sullivan
Semester 2: Niamh O'Sullivan
Autumn: Niamh O'Sullivan
NFQ level 8 Credit Rating 10
Pre-requisite None
Co-requisite None
Compatibles None
Incompatibles None
Description
This course concentrates on developing the algebraic and logical skills of the student. The course develops skills in the techniques of logic, calculus, probability and statistics. Enhancing the student's ability to solve mathematical problems occuring in IT lies at the heart of this module.Students will participate in the following learning activities: Lectures: Students will attend three one-hour lectures per week. These lectures are designed to introduce learners to the mathematical principles and problem solving techniques that underpin this module. Tutorials: Each student will attend one one-hour tutorial per week. Problem sheets based on lecture content are distributed to the students and they are strongly advised to attempt all tutorial questions in advance of the tutorial.Reading: Students are expected to fully utilise the textbooks recommended.

Learning Outcomes
1. Apply the methods of discrete mathematics, including sets and relations.
2. Use logic to demonstrate the equivalence of statements and test the validity of arguments.
3. Work confidently with functions and in particular those covered in the course.
4. Demonstrate an understanding of the concepts that arise in differential and integral calculus and be able to apply the calculus to rational functions as well as to the log and the exponential functions
5. Present and draw conclusions from statistical data.



Workload Full-time hours per semester
Type Hours Description
Lecture723 Lectures per week
Tutorial201 tutorial per week
Examination3End of year exam
Directed learning40Solving tutorial questions
Independent learning115Study over 2 semesters including exam period
Total Workload: 250

All module information is indicative and subject to change. For further information,students are advised to refer to the University's Marks and Standards and Programme Specific Regulations at: http://www.dcu.ie/registry/examinations/index.shtml

Indicative Content and Learning Activities
Set Theory/Logic.
Sets, relations, equivalence relations and partitions, partial ordering, inverse relations, composition of relations, applications of relations to databases, predicate logic as a language, methods of proof, mathematical induction. Boolean algebra, equivalent boolean expressions..

Functions.
Functions as a special case of relations, Injective, surjective and bijective functions, one-sided inverses, inverse functions, polynomials and the remainder theorem..

Graph Theory.
Directed and undirected graphs, cycles, connectivity, shortest paths, examples in practice (network flows, internet pages as a graph)..

Calculus.
Differential calculus of rational functions, the Riemann integral, the fundamental theorem of calculus, log and exponential functions..

Statistics.
Descriptive statistics, mean and variance, the normal distribution, random samples, point estimation, confidence intervals, statistical calculations with Excel..

Assessment Breakdown
Continuous Assessment30% Examination Weight70%
Course Work Breakdown
TypeDescription% of totalAssessment Date
In Class TestShort Class Test7%Week 6
In Class TestShort Class Test8%Sem 1 End
In Class TestShort Class Test7%Week 25
In Class TestShort Class Test8%Sem 2 End
Reassessment Requirement
Resit arrangements are explained by the following categories;
1 = A resit is available for all components of the module
2 = No resit is available for 100% continuous assessment module
3 = No resit is available for the continuous assessment component
This module is category 3
Indicative Reading List
  • Haggarty, R: 2002, Discrete Mathematics for Computing., Addison Wesley,
  • George B. Thomas, Maurice D. Weir, Joel Hass, Frank Giordano: 2010, Thomas' Calculus, Single Variable, 12th Edition, Pearson, 9780321637420
Other Resources
None
Array
Programme or List of Programmes
CABSc in Computer Applications
ECBSc in Enterprise Computing
Timetable this semester: Timetable for MS121
Date of Last Revision11-OCT-10
Archives: