Skip to content
Theory of Computation (5002CEM)
Video Lectures
Initializing search
Theory of Computation (5002CEM)
Home
✅ Essentials
✅ Essentials
Module Guide
Teaching and Learning
Digital skills
Accessibility
📊 Assesment
📊 Assesment
Information
Courswork
Exam/TCA
📚 Weekly materials
📚 Weekly materials
❓ How to use these materials
➊ Problems!
➊ Problems!
Lecture 1
Lab 1
Hints: Discrete Maths
Hints: Brainteasers
Solutions & Reflection
➋ DFAs & NFAs
➋ DFAs & NFAs
Lecture 2
Lab 2
Hints
Solutions & Reflection
➌ Regular Languages
➌ Regular Languages
Lecture 3
Lab 3
Hints
Solutions & Reflection
➍ Pumping Lemma
➍ Pumping Lemma
Lecture 4
Lab 4
Hints
Solutions & Reflection
➎ CFLs
➎ CFLs
Lecture 5
Lab 5
Hints
Solutions & Reflection
➏ TMs
➏ TMs
Lecture 6
Lab 6
Solutions & Reflection
➐ Meta-heuristics
➐ Meta-heuristics
Lecture 7
Lab 7
➑ Decidability
➑ Decidability
Lecture 8
Lab 8
Solutions & Reflection
➒ Complexity
➒ Complexity
Lecture 9
Lab 9
Hints
Solutions & Reflection
➓ NP Completeness
➓ NP Completeness
Lecture 10
Lab 10
Hints
Solutions & Reflection
(11) Space Complexity
(11) Space Complexity
Lecture 11
Lab 11
Hints
Solutions & Reflection
Revision Material
💎 TCA Support
Guest Lecture
Reference
Reference
Notation
Weekly Schedule
Video Lectures
Tags
Video Lectures
¶
Back to top