8 exam sessions, from December 2021 to June 2026. Download one paper, or tick several for a ZIP or one merged PDF. Free, no sign-up.
CST301 previous year question papers
CST301 syllabus
This is a core course in theoretical computer science. It covers automata and grammar representations for languages in Chomsky Hierarchy. For regular languages, it also covers representations using regular expression and Myhill-Nerode Relation. The topics covered in this course have applications in various domains including compiler design, decidability and complexity theory, software testing, formal modelling and verification of hardware and software.
Prerequisite: Basic knowledge about the following topic is assumed: sets, relations - equivalence relations, functions, proof by Principle of Mathematical Induction.
Course outcomes
| CO | Outcome |
|---|---|
| CO1 | Classify a given formal language into Regular, Context-Free, Context Sensitive, Recursive or Recursively Enumerable. [Cognitive knowledge level: Understand] |
| CO2 | Explain a formal representation of a given regular language as a finite state automaton, regular grammar, regular expression and Myhill-Nerode relation. [Cognitive knowledge level: Understand] |
| CO3 | Design a Pushdown Automaton and a Context-Free Grammar for a given context-free language. [Cognitive knowledge level : Apply] |
| CO4 | Design Turing machines as language acceptors or transducers. [Cognitive knowledge level: Apply] |
| CO5 | Explain the notion of decidability. [Cognitive knowledge level: Understand] |
Departments that study CST301
- COMPUTER SCIENCE AND DESIGN (S5)
- Computer Science Engineering (S4)
- Computer Science – AI/ML (S4)
- Computer Science and Engineering (Artificial Intelligence) (S4)
- Computer Science and Engineering (Cyber Security) (S4)
- Computer Science – Data Science (S4)
Frequently asked questions
Which KTU scheme is CST301 in?
Formal Languages and Automata Theory (CST301) is in the KTU 2019 scheme and is a PCC course.
How many credits is Formal Languages and Automata Theory?
Formal Languages and Automata Theory (CST301) carries 4 credits.
Which semester is CST301 taught in?
CST301 is taught in S4, S5. The semester differs between departments.
Where can I download CST301 previous year question papers?
This page lists 8 CST301 question papers. Select them and download as a ZIP or one merged PDF. It is free and needs no sign-up.
Can't find a paper?
Tell us which CST301 paper you need and we'll try to add it.