COMP20360

Learning Outcomes:

On completion of this module, students should be able to:
- determine strategies and execute transformational proofs in predicate calculus and basic number theory including: Calculational Logic, Proof by Indirect Equality/Order, introduction to the Eindhoven Quantified Notation;
- manipulate quantified expressions as methods to validate syllogisms and perform mathematical induction;
- understand and use various forms of finite automata, and understand their relationship to regular expressions.

Indicative Module Content:

Topics covered in this module include:
- predicate calculus: proof techniques and strategies;
- proof by induction;
- finite automata and regular expressions.

Student Effort Hours:

Approaches to Teaching and Learning:

Requirements, Exclusions and Recommendations

It is STRONGLY RECOMMENDED that students take and pass all first stage theory modules in CS before taking this module. In particular, to succeed in COMP20360 students should normally have passed COMP10070 (Formal Foundations 1). If a student has not successfully completed these modules, they must consult the Module Coordinator BEFORE registering for COMP20360.

Module Requisites and Incompatibles

Assessment Strategy

As part of UCD's student support, under the Additional Consideration policy, extensions may be available for the following assessments in the module: Assignment (including essay/poster), Portfolio, Reflective Assignment, Report(s), and Individual Project.

Feedback Strategy/Strategies

• Feedback individually to students, post-assessment
• Group/class feedback, post-assessment

How will my Feedback be Delivered?

Not yet recorded.