To develop the language of computational structures and to outline a range of algorithms.
Learning Outcomes
On successful completion of this module the learner will be able to:
#
Learning Outcome Description
LO1
outline a range of algorithms for the basic data structures in the areas of graph theory and analyse computer networks using the mathematics of discrete graphs;
LO2
formulate problems using propositional logic and give examples of standard techniques of proof;
Dependencies
Module Recommendations
This is prior learning (or a practical skill) that is recommended before enrolment in this module.
No recommendations listed
Co-requisite Modules
No Co-requisite modules listed
Additional Requisite Information
No Co Requisites listed
Indicative Content
Basic Graph Theory
Understand and use definitions and examples of walks, paths, cycles, circuits etc..,
Understanding and working with simple graphs.
graphical representation graphs and spanning trees,
Identifying bi-partite graphs
Applying graph theory algorithms to un-directed weighted graphs.
Using Kruscal's algorithm.
Mathematical Logic
Reviewing truth tables,propositional logic,valid Inferences.
Understanding and using methods of proof.
Using CNF and the resolution principle for valid statements
Understanding formal proofs and proving compound statements.
Module Content & Assessment
Assessment Breakdown
%
Continuous Assessment
50.00%
End of Module Formal Examination
50.00%
Assessments
Full Time
Continuous Assessment
Assessment Type
Examination
% of Total Mark
50
Timing
n/a
Learning Outcomes
1
Non-marked
No
Assessment Description CA marks will be based on the results of in class written test
No Project
No Practical
End of Module Formal Examination
Assessment Type
Formal Exam
% of Total Mark
50
Timing
End-of-Semester
Learning Outcomes
2
Non-marked
No
Assessment Description Final Exam written paper
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.
Reassessment Description one exam
SETU Carlow Campus reserves the right to alter the nature and timings of assessment
Module Workload
Workload: Full Time
Workload Type
Workload Category
Contact Type
Workload Description
Frequency
Average Weekly Learner Workload
Hours
Lecture
Contact
Lecture
12 Weeks per Stage
4.00
48
Estimated Learner Hours
Non Contact
Weekly study
15 Weeks per Stage
6.00
90
Tutorial
Contact
No Description
12 Weeks per Stage
1.00
12
Total Weekly Contact Hours
5.00
Module Resources
Recommended Book Resources
Richard Johnsonbaugh. Discrete Mathematics, Prentice Hall, p.672, [ISBN: 0-13-127767-7].
John J. Kelly. (1997), The Essence of Logic, Pearson P T R, p.258, [ISBN: 0-13-396375-6].
This module does not have any article/paper resources