Scribd
Upload
5 views2 pages

MCS/M-21 Theory of Computation: Paper-MS-15-23

This document outlines the structure of a Theory of Computation exam, including instructions for answering questions from various units. It contains a compulsory question and a selection of topics covering finite automata, grammars, Turing machines, and complexity classes. The exam is designed to assess understanding of key concepts in computation theory.

Uploaded by

aashurana9628
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

MCS/M-21 Theory of Computation: Paper-MS-15-23

This document outlines the structure of a Theory of Computation exam, including instructions for answering questions from various units. It contains a compulsory question and a selection of topics covering finite automata, grammars, Turing machines, and complexity classes. The exam is designed to assess understanding of key concepts in computation theory.

Uploaded by

aashurana9628
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Roll No. .........................

Total Pages : 2

MCS/M-21 24561
THEORY OF COMPUTATION
Paper–MS-15-23
Time Allowed : 3 Hours] [Maximum Marks : 80

Note : Attempt five questions in all, selecting one question from each Unit.
Question No. 1 is compulsory. All questions carry equal marks.
Compulsory Question
1. Answer the following questions in brief :
(a) What do you mean by Russel’s paradox ?
(b) Design a Finite automata for a language L = {w : w ε (0, 1)* &&
decimal representation of w is divisible by 5}.
(c) What are Left Most Derivation and Right Most Derivations of a
grammar ?
(d) What is Restricted Turing machine ?
(e) Explain the theory of Optimization.
UNIT–I
2. (a) What do you mean by a NDFA ? Explain the conversion of NDFA
to DFA using suitable example.
(b) Draw a FSA for the language L = {w : w ε (a, b)* && |w| mod
3 = = 1 OR |w| mode 3 = = 2}.
3. (a) What is a Regular expression ? Explain different operators of Regular
expressions using suitable examples.
(b) Minimize the following DFA :

24561/K/401 P. T. O.
UNIT–II
4. (a) What is a Grammar ? Explain the CSG with suitable examples.
(b) What do you mean by Pumping Lemma ? How is it used in context
of CFG ? Explain.
5. (a) What do you mean by a PDA ? Design a PDA for the Langauge
L = {anbm+ncm : w ε (a, b)* & n, m >= 0}.
(b) Explain the following :
(i) Parsing of a grammar (ii) Removal of ambiguity.
UNIT–III
6. (a) What is a Turing machine ? Design a Turing machine for
L = {ambncp : 1 <= m < n < p}.
(b) Explain the Halting problem of Turing machine using suitable
examples.
7. Explain the following :
(a) TM variants
(b) Post’s Correspondence problem.
UNIT–IV
8. (a) What do you mean by NP-Complete problem ? Explain their
importance w.r.t. Complexity classes.
(b) Differentiate between Solution and Verification of a Problem using
suitable examples.
9. Explain the following :
(a) Primitive recursive functions.
(b) Intractable problems.

24561/K/401 2

You might also like