Quiz 2

BSCS3021 · workspace

Theory of Computation

Syllabus, study tools, lectures, and curriculum map.

← Back to hub
Weekly outline

Syllabus

Week topics from the course map

00W00

Topic

Incomplete
01W01

Introduction to Theory of Computation with Finite Automata.

Incomplete
02W02

Regular Languages and Regular Expressions.

Incomplete
03W03

Regular Languages, DFA Minimization, and Pumping Lemma.

Incomplete
04W04

Context-Free Languages (CFLs) and Parse Trees.

Incomplete
05W05

Pushdown Automata and Recognizers of CFLs.

Incomplete
06W06

Non-CFLs and Introduction to Turing Machines.

Incomplete
07W07

Variants of Turing Machines and the Church–Turing Thesis.

Incomplete
08W08

Decidability and Undecidable Problems.

Incomplete
09W09

Reductions and Proving Undecidability.

Incomplete
010W10

Time and Space Complexity.

Incomplete
011W11

Polynomial-Time Reductions and Hard Problems.

Incomplete
012W12

NP-Completeness and Course Summary.

Incomplete

Secure Comm-Link Terminal

Secure Comm-Link // @IITMadrasBSDegreeProgramme
Uplink 12ms
Syllabus Synchronization: Active

Syllabus Matrix Registry

Global Course Index

Open Full Frame

Master Registry

v6.4 Directory

Foundational

Diploma

BSc Degree

BS Degree

PG / MTech

BSCS3021
BSc Degree
4 Credits

Theory of Computation

Theory of computation deals with the encapsulation and abstraction of diverse computational processes, whether hardware or software, which enables ...

Execution Protocol

Module 0

Topic

Module 1

Introduction to Theory of Computation with Finite Automata.

Module 2

Regular Languages and Regular Expressions.

Module 3

Regular Languages, DFA Minimization, and Pumping Lemma.

Module 4

Context-Free Languages (CFLs) and Parse Trees.

Module 5

Pushdown Automata and Recognizers of CFLs.

Module 6

Non-CFLs and Introduction to Turing Machines.

Module 7

Variants of Turing Machines and the Church–Turing Thesis.

Module 8

Decidability and Undecidable Problems.

Module 9

Reductions and Proving Undecidability.

Module 10

Time and Space Complexity.

Module 11

Polynomial-Time Reductions and Hard Problems.

Module 12

NP-Completeness and Course Summary.

Document outline

Keep your place and jump directly to a heading.

Table of Contents
System Normal // Awaiting Context

Intelligence Hub

Navigate the knowledge graph to generate context. The Hub adapts dynamically to surface backlinks, related notes, and metadata insights.