COMP10070 Formal Foundations

Academic Year 2020/2021

In addition to becoming skilled in Programming and Problem Solving, Computer Scientists need to be aware of the limitations of particular techniques and be able to test for correctness of programs they produce. This course introduces students to the logical fundamentals underlying proof of correctness (propositional and predicate logic, proof techniques) and to the concept of a finite state machine, a restricted computational model used in many application domains. This course is very practical in nature and students will be required to apply the techniques they have learned to a particular set of problems.

Show/hide contentOpenClose All

Curricular information is subject to change

Learning Outcomes:

On completion of this module students should be able to:
1. apply the rules of logic;
2. understand the basis of propositional logic and predicate logic;
3. carry out transformational proofs;
4. carry out deductive proofs, using conditional proof and indirect proof techniques;
5. understand the basis of mathematical induction;
6. carry out proofs using mathematical induction;
7. understand the basis and theory of finite state automata; and
8. develop simple finite state models.

Student Effort Hours: 
Student Effort Type Hours
Lectures

24
Tutorial

24
Autonomous Student Learning

82
Total

130
Approaches to Teaching and Learning:
Lectures presenting theoretical material and problems with worked solutions;
Tutorials with reinforcement of theoretical material and problems;
Assessment Exercises based on theory and practical problems. 
Requirements, Exclusions and Recommendations

Not applicable to this module.


Module Requisites and Incompatibles
Not applicable to this module.
 
Assessment Strategy  
Description Timing Open Book Exam Component Scale Must Pass Component % of Final Grade
Continuous Assessment: Tutorial Sheets; Engagement with and contribution to Tutorial Sessions; Assessment Exercises 1, 2, 3, 4 and 5 Varies over the Trimester n/a Graded No

100

Carry forward of passed components
No
 
Resit In Terminal Exam
Spring No
Please see Student Jargon Buster for more information about remediation types and timing. 
Feedback Strategy/Strategies

• Feedback individually to students, on an activity or draft prior to summative assessment

How will my Feedback be Delivered?

Students will receive feedback on completed Tutorial Sheets.