Module: IT Mathematics I

Module Specifications..

Current Academic Year 2023 - 2024

Please note that this information is subject to change.

Module Title	IT Mathematics I
Module Code	MS134
School	School of Mathematical Sciences
Module Co-ordinator	Semester 1: Nazem Khan Semester 2: Nazem Khan Autumn: Nazem Khan
Module Teachers	Thomas Brady Gurpreet Singh Thorsten Neuschel Nazem Khan
NFQ level	8	Credit Rating	5
Pre-requisite	None
Co-requisite	None
Compatibles	None
Incompatibles	None

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; 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

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

Programme or List of Programmes

COMSCI

BSc in Computer Science

Archives: