Explore UCD

UCD Home >

COMP30010

Academic Year 2024/2025

Foundations of Computing (COMP30010)

Subject:
Computer Science
College:
Science
School:
Computer Science
Level:
3 (Degree)
Credits:
5
Module Coordinator:
Professor Liam Murphy
Trimester:
Autumn
Mode of Delivery:
Blended
Internship Module:
No
How will I be graded?
Letter grades

Curricular information is subject to change.

This module introduces a branch of computer science named language and automata theory, and covers concepts from computing theory and complexity theory. In particular, it discusses computation models (finite automata, regular expressions, pushdown automata, Turing machines), undecidability (what can be computed at all?) and intractability (how fast can it be computed?).

The student will come to understand how these theories relate to, and are used in, everyday practice. Students learn concepts, tools, and techniques individually through a series of written exercises. There are weekly tutorial sessions with demonstrator support.

About this Module

Learning Outcomes:

On completion of this module students should be able to:
- Define and use general concepts like computation, algorithm, and language;
- Work with several models of computing including finite state machines, Turing machines, and automata;
- Use appropriate computation models for real applications;
- Understand and use notions of computability and decidability, and their limits;
- Understand and explain the relationships between mathematical proof and computation.

Indicative Module Content:

The topics covered in this module are:
1. Regular Languages (Finite Automata, Regular Expressions)
2. Context-free Languages (Pushdown Automata, Context-free Grammars)
3. Recursively Enumerable Languages (Turing Machines)
4. Undecidability (Does a computer solution/algorithm exist?)
5. Intractability (Can it be solved fast?)

Student Effort Hours:
Student Effort Type Hours
Lectures

24
Tutorial

22
Autonomous Student Learning

76
Total

122

Approaches to Teaching and Learning:
Lectures; tutorial sessions; written exercises; one or more in-class test(s).

Requirements, Exclusions and Recommendations
Learning Requirements:

Students should have basic knowledge of mathematics (including set theory, functions and relations, logic, and basic proof techniques) to attend this module.

Learning Recommendations:

It is strongly recommended that students take and pass all first and
second stage theory modules in CS before taking this module.


Module Requisites and Incompatibles
Incompatibles:
IS10060 - Digital Technology


 

Assessment Strategy
Description Timing Component Scale Must Pass Component % of Final Grade In Module Component Repeat Offered
Quizzes/Short Exercises: In-class in-person written test Week 5, Week 9 Alternative linear conversion grade scale 40% No
50
 No
Exam (In-person): In-person written test End of trimester
Duration:
2 hr(s)
 Alternative linear conversion grade scale 40% No
50
 No

Carry forward of passed components
Yes
 

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, post-assessment
• Group/class feedback, post-assessment

How will my Feedback be Delivered?

Not yet recorded.

Name Role
Mr Jim Quinn Tutor

Timetabling information is displayed only for guidance purposes, relates to the current Academic Year only and is subject to change.
Autumn Practical Offering 1 Week(s) - Autumn: All Weeks Thurs 14:00 - 15:50
Autumn Lecture Offering 1 Week(s) - Autumn: All Weeks Tues 13:00 - 13:50
Autumn Lecture Offering 1 Week(s) - Autumn: All Weeks Wed 11:00 - 11:50
Print this page
Fill in the following details:
Enter the body of your query here.

From time to time UCD would like to send you further information that we feel, based on your enquiry, would be of interest to you.