MATH06092 2018 Mathematics 4

General Details

Full Title

Mathematics 4

Transcript Title

Mathematics 4

Code

MATH06092

Attendance

N/A %

Subject Area

MATH - Mathematics

Department

COEL - Computing & Electronic Eng

Level

06 - NFQ Level 6

Credit

05 - 05 Credits

Duration

Semester

Fee

€

Start Term

2018 - Full Academic Year 2018-19

End Term

9999 - The End of Time

Author(s)

John Weir, Donny Hurley, Fran O'Regan

Programme Membership

SG_KSMAR_H08 201800 Bachelor of Science (Honours) in Computing in Smart Technologies SG_KSODV_H08 201800 Bachelor of Science (Honours) in Computing in Software Development SG_KNCLD_H08 201800 Bachelor of Science (Honours) in Computing in Computer Networks and Cloud Infrastructure SG_KNCLD_B07 201800 Bachelor of Science in Computing in Computer Networks and Cloud Infrastructure SG_KCMPU_H08 201800 Bachelor of Science (Honours) in Computing SG_KSMAR_C06 201800 Higher Certificate in Science in Computing in Smart Technologies SG_KSMAR_B07 201800 Bachelor of Science in Computing in Smart Technologies SG_KGAME_C06 201800 Higher Certificate in Science in Games Development SG_KGADV_B07 201800 Bachelor of Science in Computing in Games Development SG_KSODV_B07 201800 Bachelor of Science in Computing in Software Development SG_KNETW_C06 201800 Higher Certificate in Science in Computing in Computer Networks SG_KSODV_C06 201800 Higher Certificate in Science in Software Development SG_KCMPU_C06 201800 Higher Certificate in Science in Computing in Computing SG_KCMPU_B07 201800 Bachelor of Science in Computing in Computing SG_KSOFT_B07 201800 Bachelor of Science in Computing in Software Development SG_KSMAR_H08 201900 Bachelor of Science (Honours) in Computing in Smart Technologies SG_KSODV_H08 201900 Bachelor of Science (Honours) in Computing in Software Development SG_KCMPU_H08 201900 Bachelor of Science (Honours) in Computing SG_KSMAR_C06 201900 Higher Certificate in Science in Computing in Smart Technologies SG_KCMPU_C06 201900 Higher Certificate in Science in Computing in Computing SG_KCMPU_B07 201900 Bachelor of Science in Computing in Computing SG_KNCLD_B07 201900 Bachelor of Science in Computing in Computer Networks and Cloud Infrastructure SG_KNCLD_H08 201900 Bachelor of Science (Honours) in Computing in Computer Networks and Cloud Infrastructure SG_KSODV_B07 201900 Bachelor of Science in Computing in Software Development SG_KNCLD_H08 202000 Bachelor of Science (Honours) in Computing in Computer Networks and Cloud Infrastructure SG_KCMPU_H08 202000 Bachelor of Science (Honours) in Computing SG_KSODV_H08 202000 Bachelor of Science (Honours) in Computing in Software Development SG_KSMAR_H08 202000 Bachelor of Science (Honours) in Computing in Smart Technologies SG_KNCLD_B07 202100 Bachelor of Science in Computing in Computer Networks and Cloud Infrastructure SG_KNCLD_B07 202100 Bachelor of Science in Computing in Computer Networks and Cloud Infrastructure SG_KCNCS_H08 202100 Bachelor of Science (Honours) in Computing in Computer Networks and Cyber Security SG_KCNCS_B07 202100 Bachelor of Science in Computing in Computer Networks and Cyber Security SG_KGADV_B07 202100 Bachelor of Science in Computing in Games Development SG_KSODV_B07 202100 Bachelor of Science in Computing in Software Development SG_KSODV_H08 202100 Bachelor of Science (Honours) in Computing in Software Development SG_KCMPU_H08 202100 Bachelor of Science (Honours) in Computing SG_KCMPU_C06 202100 Higher Certificate in Science in Computing SG_KCMPU_B07 202100 Bachelor of Science in Computing SG_KSMAR_H08 202100 Bachelor of Science (Honours) in Computing in Smart Technologies SG_KSODV_H08 202200 Bachelor of Science (Honours) in Computing in Software Development SG_KCMPU_H08 202200 Bachelor of Science (Honours) in Computing

Description

This subject develops further Mathematical skills and applies some of the Mathematical skill set already developed. The module begins with a look at various integration techniques. This is followed by an application of matrices in Gaussian and Gauss Jordan elimination. There is a significant section on number theory and it's application in areas such as encryption. The concept of a group and the identification of group examples used in the current and earlier modules is then looked at. Finally the module covers coding theory, again using skills already developed previously in areas such as probability and matrices.

Learning Outcomes

On completion of this module the learner will/should be able to;

Demonstrate competence in integral calculus.

Solve problems using Gaussian and Gauss Jordon techniques.

Apply number theory.

Explain the concept of a group and identify examples.

Demonstrate competence in error deection and error correction codes

Teaching and Learning Strategies

The student will engage with the content of the module through lectures and tutorials.

The student will work on practical examples and exercise sheets to develop and apply their learning.

Module Assessment Strategies

Written examination at end of semester and also a written examination around mid-semester.

Repeat Assessments

The repeat assessment will involve a repeat examination.

Indicative Syllabus

1. Integration: Integration of polynomial, trignometric and exponential functions. Integration techniques. Approximation using Simpson's rule.

2. Gaussian elimination and Gauss Jordan elimination.

3. Number Theory: Prime Numbers, Euclidean algorithm, congruences, pseudo random number generation, encryption and decryption.

4. Group theory: Group properties, examples of groups.

5. Coding Theory: Coding schemes, block codes, Hamming distance, linear codes, parity check matrix.

Coursework & Assessment Breakdown

Coursework & Continuous Assessment

30 %

End of Semester / Year Formal Exam

70 %

Coursework Assessment

	Title	Type	Form	Percent	Week	Learning Outcomes Assessed
1	Continuous assessment breakdown	Coursework Assessment	Closed Book Exam	30 %	Week 6	1,2

End of Semester / Year Assessment

	Title	Type	Form	Percent	Week	Learning Outcomes Assessed
1	End of term exam	Final Exam	Closed Book Exam	70 %	End of Term	1,2,3,4,5

Full Time Mode Workload

Type	Location	Description	Hours	Frequency	Avg Workload
Lecture	Lecture Theatre	Lecture	3	Weekly	3.00
Tutorial	Flat Classroom	Tutorial	1	Weekly	1.00
Independent Learning	Not Specified	Independent Learning	3	Weekly	3.00

Total Full Time Average Weekly Learner Contact Time 4.00 Hours

Required & Recommended Book List

Recommended Reading
2017 Discrete Maths for Computing Palgrave MacMillan

Recommended Reading
2017 Maths for Computing and Information Technology Prentice Hall