Previous year question paper for TOC (B-TECH computer science engineering 7-8th)

Theory of computation

Previous year question paper with solutions for Theory of computation from 2014 to 2022

Our website provides solved previous year question paper for Theory of computation from 2014 to 2022. Doing preparation from the previous year question paper helps you to get good marks in exams. From our TOC question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

 Module 1:

 Basics of Strings and Alphabets

Module2: 

Finite Automata – DFA, transition graphs, regular languages, non-deterministic FA, equivalence of

DFA and NDFA

Module3:

 Regular grammars, regular expressions, equivalence between regular languages, properties of

regular languages, pumping lemma.

Module4:

 Context Free Languages – Leftmost and rightmost derivation, parsing and ambiguity, ambiguity in

grammar and languages, normal forms

Module5:

 Pushdown Automata – NDPDA, DPDA, context free languages and PDA, comparison of

deterministic and non-deterministic versions, closure properties, pumping lemma for CFL

Module6: Turing Machines, variations, halting problem, PCP

Module7:

 Chomsky Hierarchy, LR(k) Grammars, properties of LR(k) grammars, Decidability and Recursively

Enumerable Languages

2022
Download
2021
Download
2020
Download
Download
2019
Download
Download
2018
Download
Download
2017
Download
2016
Download
Download
2015
Download
Download
2014
Download