Module: IT Mathematics I

Module Specifications.

Current Academic Year 2024 - 2025

All Module information is indicative, and this portal is an interim interface pending the full upgrade of Coursebuilder and subsequent integration to the new DCU Student Information System (DCU Key).

As such, this is a point in time view of data which will be refreshed periodically. Some fields/data may not yet be available pending the completion of the full Coursebuilder upgrade and integration project. We will post status updates as they become available. Thank you for your patience and understanding.

Date posted: September 2024

Module Title	IT Mathematics I
Module Code	MS134 (ITS) / MTH1025 (Banner)
Faculty	Science & Health	School	Mathematical Sciences
Module Co-ordinator	Turlough Downes
Module Teachers	-
NFQ level	6	Credit Rating	5
Pre-requisite	Not Available
Co-requisite	Not Available
Compatibles	Not Available
Incompatibles	Not Available

None

Description

This course concentrates on developing the algebraic and logical skills of the student. The course develops skills in the techniques of logic, probability, differential and integral calculus. 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 basic probability.

*Type*	*Hours*	*Description*
Workload	Full-time hours per semester
Lecture	36	3 lectures per week
Tutorial	10	One Tutorial per week
Directed learning	2	End of year exam
Directed learning	20	Solving tutorial problems
Independent Study	57	Independent study over semester including exam period
Total Workload: 125

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.

Probability
Basic probability to include axioms, independent events, conditional probability and some probabiilty distributions.

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

Assessment Breakdown
Continuous Assessment	20%	Examination Weight	80%

Type	Description	% of total	Assessment Date
Course Work Breakdown
In Class Test	In Class test	5%	Week 3
In Class Test	In Class Test	5%	Week 6
In Class Test	In Class Test	5%	Week 9
In Class Test	In Class Test	5%	Week 12

Reassessment Requirement Type
Resit arrangements are explained by the following categories: Resit category 1: A resit is available for both* components of the module. Resit category 2: No resit is available for a 100% continuous assessment module. Resit category 3: No resit is available for the continuous assessment component where there is a continuous assessment and examination element.
* ‘Both’ is used in the context of the module having a Continuous Assessment/Examination split; where the module is 100% continuous assessment, there will also be a resit of the assessment
This module is category 3

Indicative Reading List

Rod Haggarty: 2002, Discrete Mathematics for Computing, 1, Addison-Wesley, 978-02017304
Susanna S. Epp: 2019, Discrete Mathematics with Applications, 5, Cengage Learning, 978-133769419

Other Resources

None