Scribd
Upload
21 views3 pages

MODEL QP Set-4

1. The document is a model examination for the subject Theory of Computation. It contains 15 questions divided into 2 parts - Part A contains 10 short answer questions and Part B contains 5 long answer questions. 2. The questions assess various course outcomes related to topics like inductive proofs, regular expressions, context-free grammars, pushdown automata, Turing machines, and decidability. 3. The document provides the expected answer length for each question and maps the course outcomes to program outcomes.

Uploaded by

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

MODEL QP Set-4

1. The document is a model examination for the subject Theory of Computation. It contains 15 questions divided into 2 parts - Part A contains 10 short answer questions and Part B contains 5 long answer questions. 2. The questions assess various course outcomes related to topics like inductive proofs, regular expressions, context-free grammars, pushdown automata, Turing machines, and decidability. 3. The document provides the expected answer length for each question and maps the course outcomes to program outcomes.

Uploaded by

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

Reg. No.

:
SET
4

IFET COLLEGE OF ENGINEERING


(An Autonomous Institution)
MODEL EXAMINATION
DEPARTMENT OF CSE & AIML
SUB CODE: 19UCSPC502 MAX MARKS: 100
SUB NAME: THEORY OF DURATION: 180Min
COMPUTATION
YEAR/
DATE: .10.2023/AN III/V
SEMESTER:
TIME MANAGEMENT CHART
Part Question No.’s Time allotted
A 1-10 1.15 pm-1.45 pm
11 1.45 pm-2.15 pm
12 2.15 pm-2.45 pm
B 13 2.45 pm-3.15 pm
14 3.15 pm-3.45 pm
15 3.45 pm-4.15 pm
PART-A (10¿ 2=20)
Answer All Questions
(Each answer should have minimum 7 lines)
1. Define Inductive proof. R CO1
2. Draw the NFA to accept the strings containing the substrings 0101. A CO1
3. What is regular expression? List down the operators of regular expression R CO2

4. List the closure properties of Regular language? R CO2


5. Write down the CFG for the language L= { an bn | n≥ 1}. A CO3
6. Optimize the CFG given below by reducing the grammar. S is a start symbol. S CO3
S → A | 0C1
A → B | 01 | 10
C → ε | CD
7. What are the different types of language acceptances by PDA and define them? U CO4

8. What are the techniques for Turing machine construction? R CO4


9. Define universal language. R CO5
10. Define polynomial time reduction. R CO5

PART-B (5¿ 16=80)


Answer All Questions
(Each answer should be written for minimum 6 pages with minimum 25 lines
per page)
11. A(i) Prove the following by the induction for all n>0 U (8) CO1
n n( n+1)( 2 n+1)
12 +2 2 +32 +. . ..+n 2=∑i =1 i 2=
6
A(ii) Prove by induction that n3 + (n+1)3 +(n+2)3 is divisible by 3 and n>0. U (8) CO1
(OR)
11. B(i) Convert the given NFA to DFA A (8) CO1
δ 0 1
→q0 { q0, q1} q0
q1 q2 q1
q2 q3 q3
*q3 Ø q2
11. B(ii) Convert the NFA with ε into its equivalent DFA. A (8) CO1

12. A(i) Design a FA from given regular expression 10 + (0 + 11)0* 1. A (8) CO2
A(ii) Show that the set L={bi2| i>1} is not regular. U (8) CO2
(OR)
12. B Using the algorithm for minimization of the DFA, minimize the following U (16) CO2
DFA

13. A Consider the following grammar for list structures: A (16) CO3
S → a | ^ | (T), T → T, S | S.
Find left most derivation, rightmost derivation and Parse tree for
(((a,a), (^,a)), a)
(OR)
13. B(i) Convert the grammar with productions into CNF A (8) CO3
A→bAB | λ, B→BAa | λ.
B(ii) Show that the language L={anbncndn |n>=0)} is not a context free language. S (8) CO3

14. A Construct a PDA accepting {an bm an |m,n≥1} by empty stack. Also A (16) CO4
construct the corresponding CFG accepting the same set.
(OR)
14. B(i) Construct a CFG accepting L= {am bn | n<m} and construct a PDA A (8) CO4
accepting L by empty stack.
B(ii) Construct a TM for subroutine f(a,b)=a*b, where a and b are unary S (8) CO4
numbers.

15. A(i) Briefly discuss about the decidable, undecidable, recursive and RE R (8) CO5
languages with examples.
15. A(ii)Prove that the non-empty language “Lne” is recursively Enumerable and U (8) CO5
“Lne “ is not recursive
(OR)
15. B Convert the TM M= ({ q1,q2,q3}, {0,1} ,{0,1,B} ,δ,q1,B,{q3}) where δ A (16) CO5
is given by
qi δ ( qi,0) δ ( qi,1) δ ( qi,B)
q1 (q2,1,R) (q2,0,L) (q2,1,L)
q2 (q3,0,L) (q1,0,R) (q2,0,R)
q3 ---- --- ---
and input string w =01 to an instance of MPCP
Mapping of Course Outcomes (CO) to Programme Outcomes (PO)
Course/Course Mapping with Programme outcomes
Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
C303.1 1 3 - - - - - - - - - -
C303.2 2 3 - - - - - - - - - -
C303.3 - 3 2 - - - - - - - - -
C303.4 - 3 2 - - - - - - - - -
C303.5 - 3 - - - - - - - - - -
TOC 2 3 2 - 3 - - - - 3 - -
3- Strong Correlation, 2 – Medium Correlation, 1- Weak Correlation

------All the Best-----

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy