Scribd
Upload
37 views

Toc Paper BTCS501

Uploaded by

sharmaayushman296
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
37 views

Toc Paper BTCS501

Uploaded by

sharmaayushman296
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

Total No. of Questions: 05 Total No.

of Printed Pages: 02
Roll No. ../..(. Cl
BTCS501
VI Semester Examination, May - June 2022

B. Tech. (CCE/CSE/CSE-AII/CSE-ES/CSE-ICS/CSE-BDAI/CSE-MAlCSE-CMClilT)
B.Tech.+ M.Tech. (CSE/CSE-CC/CSE-CF/CSE-BDAlIT)
B.Tech.+ M.B.A. (CSEIIT)

THEORY OF COMPUTATION
Choice Based Credit System (CBCS)
Time: 3 Hrs. Maximum Marks: 60
Minimum Pass Marks: 24
Note: All questions carry equal marks, out of which part' A ' and'B' carry 3 marks and part 'c' carries 6 marks.
From each question, part 'A' and 'B' are compulsory and part 'c' has internal choice.
Draw neat diagram, wherever necessary. .
Assume suitable data wherever necessary.

Q.1 (A) Explain the following with examples:


1. Automata 2. DFA 3. NFA 03
(8) Construct a Finite Automata accepting all string over {O,1} having even number of O's
and even number of 1'so 03
(C) State and prove Myhill - Nerode Theorem.
OR
(D) Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite
Automata (OFA) 0 0

06

.: Q.2(A) State and Define the closure properties of regular languages. 03


(B) What is Mealy Machine? How Finite Automates can be converted into Moore
Machine? Explain with the help of example. 03

(C) Explain pumping lemma for regular language. Prove following language is not regular.
L= {ani : nat)
OR
(D) ·Find out the Regular Expression from given DFA

06
Contd ...

1
Q;3(A) Explain Chomsky Normal Form with example. 03
(8) Give Context Free Grammar for Reg~'jar Expressi~n'(011+1)* (01)* 03
(C) Check whether the fO"~~i~g grammar is ambiguous or not. Remove the ambiguity
from. the grammar in case the grammar is ambiguous.
S ~abAB
A~bABI A
B~BAa IAI A
I

OR
(0) Convert the grammar into Greibach Normal Form.
S~ABbl a
A~aaAI B
, . . B~bAb

Q.4(A) Compare Pushdown Automata with context free grammar. 03


(8) Convert the following Context Free Grammar to Pushdown Automata.
S~aAA
A~As ,I bS la
.' (C) Construct pushdown automata for the following languages. Accept it either by empty
stack or by final state. {a"bma" : m, n E N}

OR
(0) Construct the PDA for the following example {amb"cm+" m,n ~1} 06

Q~5(A) What are decidable and undecidable problems? 03


(8) Give two properties of recursively enumerable language. 03
(C) What is meant by halting problem? Differentiate between P, NP hard and NP
complete problems.
OR
(0) Explain Turing machine model. Design a Turning Machine for the language
{ L(G)= a"b" : n~1}

*******

You might also like