UNIT-III

Bloom’s Course
Q
QUESTIONS Taxonomy Outcome
No.
Level
Find the context free grammar for the following language- 3(Apply)
(with n>=0, m>=0, k>=0) CO3
1.
L = { aⁿ bmck | n=m or m<=k }
L= { a2nbc | n>=1}
Consider the following productions-
S aAS / a CO3
2. A SbA / SS / ba 3(Apply)
Find out LMD, RMD & construct a Parse Tree for the string aabbaa

Transform the grammar with productions-

3. A  BAB / B / ε 3(Apply)
B 00 / ε CO3
into Chomsky Normal form.
Convert the CFG into GNF-
4. A BC 3(Apply) CO3
B CA / b
C AB / a
Simplify the given CFG
SaSB/aA/bB
5. 3(Apply) CO3
AaA/ ε
BbB/ ε

Convert the following CFG into CNF.

SbA/aB CO3
6. 3(Apply)
AbAA/aS/a
BaBB/bS/b

Construct a regular grammar G generating the regular set represented by CO3

7. 3(Apply)
P = 0*1(0+1)*

8. Define Context Free Grammar Formally. 1(Remember) CO3

Consider the following grammar.

S (L)/a
9. 3(Apply) CO3
LL,S/S
((a,a),(a,a)) Construct LMD & RMD

Write Regular grammar for the following Regular Expression:

10. i) ab*b 2(Understand) CO3
ii) a(a+b)*b
 UNIT-V

Bloom’s Course
Q
Taxonomy Outcome
No.
QUESTIONS Level
All natural numbers are either even or odd. Construct a Turing machine that computes
the parity function for natural numbers, i.e. that computes:

0, if n is even 3(Apply)
1. CO5
F(n) =

1, if n is odd
Design a Turing machine to recognize all strings consisting of even number of 1’s. 3(Apply) CO5
2.
Design a Turing machine to accept the language. CO5
3. 3(Apply)
L={WWR | W ≡ (0+1)*}

Design a Turing machine to accept the language. CO5

4. 3(Apply)
L={WcWR | W ≡ (0+1)*}

Write a brief note on:

5. i. Universal Turing machine. 1(Remember)
ii. Church –Turing hypothesis CO5
iii. P & NP Class problems

Design a Turing machine to recognize all strings consisting of equal number of 1’s and 3(Apply) CO5
6.
0’s.
CO5
7. Define Turing machine and its parameters. 1(Remember)
CO5
8. Explain multi-tape and multi-head Turing machine. 2(Understand)
Design a Turing machine to recognize all strings consisting of equal number of 1’s and 3(Apply) CO5
9.
0’s.
Prove that
i. The union of two recursive languages is recursive.
4(Analyze) CO5
10. ii. If a language L and its complement Ā are both recursively enumerable
then Ā
is recursive.

TOC Assignment
S. Assignment-3 Assignment-5
Roll No. Student Name
No. Question No. Question No.
1 0187CS221001 AAKASH TIWARI 1,2,3,4 1,2,3,4
2 0187CS221002 AARYAN CHANDEL 4,5,6,7 4,5,6,7
3 0187CS221003 AAVI AGRAWAL 7,8,9,10 7,8,9,10
4 0187CS221004 AAYUSH TIWARI 1,2,3,4 1,2,3,4
5 0187CS221005 ABDUL TOUFIK 4,5,6,7 4,5,6,7
6 0187CS221006 ABDULLAH USAMA KHAN 7,8,9,10 7,8,9,10
7 0187CS221007 ABHAY MISHRA 1,2,3,4 1,2,3,4
8 0187CS221008 ABHIMANYU PATEL 4,5,6,7 4,5,6,7
9 0187CS221009 ABHISHEK RAGHUWANSHI 7,8,9,10 7,8,9,10
10 0187CS221010 ABHISHEK AHIRWAR 1,2,3,4 1,2,3,4
11 0187CS221011 ABHISHEK AHIRWAR 4,5,6,7 4,5,6,7
12 0187CS221012 ABHISHEK KUMAR 7,8,9,10 7,8,9,10
13 0187CS221013 ABHISHEK KUMAR 1,2,3,4 1,2,3,4
14 0187CS221014 ABHISHEK KUMAR 4,5,6,7 4,5,6,7
15 0187CS221015 ABHISHEK KUMAR GUPTA 7,8,9,10 7,8,9,10
16 0187CS221016 ABHISHEK KUMAR SINGH 1,2,3,4 1,2,3,4
17 0187CS221017 ABHISHEK OJHA 4,5,6,7 4,5,6,7
18 0187CS221018 ADARSH SINGH 7,8,9,10 7,8,9,10
19 0187CS221019 ADARSH VERMA 1,2,3,4 1,2,3,4
20 0187CS221020 ADITYA KHARE 4,5,6,7 4,5,6,7
21 0187CS221021 ADITYA KUMAR 7,8,9,10 7,8,9,10
22 0187CS221022 ADNAN BAIG 1,2,3,4 1,2,3,4
23 0187CS221024 AFNAAN KHALID KHAN 4,5,6,7 4,5,6,7
24 0187CS221025 AJAY AHIRWAR 7,8,9,10 7,8,9,10
25 0187CS221027 AKASH PRAJAPATI 1,2,3,4 1,2,3,4
26 0187CS221028 AKRITI KUMARI 4,5,6,7 4,5,6,7
27 0187CS221030 AKSHAT PATNE 7,8,9,10 7,8,9,10
28 0187CS221031 AKSHAY GUPTA 1,2,3,4 1,2,3,4
29 0187CS221032 AKSHAY RATHORE 4,5,6,7 4,5,6,7
30 0187CS221033 ALOK KUMAR 7,8,9,10 7,8,9,10
31 0187CS221034 ALOK SINGH 1,2,3,4 1,2,3,4
32 0187CS221035 AMAN CHANDRAVANSHI 4,5,6,7 4,5,6,7
33 0187CS221036 AMAN KUMAR 7,8,9,10 7,8,9,10
34 0187CS221037 AMAN RAI 1,2,3,4 1,2,3,4
35 0187CS221038 AMIT KUMAR 4,5,6,7 4,5,6,7
36 0187CS221039 AMIT RAI 7,8,9,10 7,8,9,10
37 0187CS221040 ANAND KUMAR 1,2,3,4 1,2,3,4
38 0187CS221041 ANI BHATIYA 4,5,6,7 4,5,6,7
39 0187CS221043 ANIKET KUMAR 7,8,9,10 7,8,9,10
40 0187CS221044 ANIL KELKAR 1,2,3,4 1,2,3,4
41 0187CS221046 ANJALI MALVIYA 4,5,6,7 4,5,6,7
42 0187CS221047 ANKIT MISHRA 7,8,9,10 7,8,9,10
43 0187CS221049 ANMOL BANKAR 1,2,3,4 1,2,3,4
44 0187CS221050 ANUJ RAGHUWANSHI 4,5,6,7 4,5,6,7
45 0187CS221051 ANURAG MISHRA 7,8,9,10 7,8,9,10
46 0187CS221052 ANUSHKA BAIS 1,2,3,4 1,2,3,4
47 0187CS221053 ANUSHKA SHRIVASTAVA 4,5,6,7 4,5,6,7
48 0187CS221054 ARHAMA KHAN 7,8,9,10 7,8,9,10
49 0187CS221056 ARSH KHAN 1,2,3,4 1,2,3,4
50 0187CS221057 ARSHLAN KHAN 4,5,6,7 4,5,6,7
51 0187CS221059 ARYAN VERMA 7,8,9,10 7,8,9,10
52 0187CS221061 ASHISH MEHRA 1,2,3,4 1,2,3,4
53 0187CS221062 ASHUTOSH SHARMA 4,5,6,7 4,5,6,7
54 0187CS221063 ASMA WAHID 7,8,9,10 7,8,9,10
55 0187CS221064 ATHARV REGE 1,2,3,4 1,2,3,4
56 0187CS221065 ATISH KUMAR 4,5,6,7 4,5,6,7
57 0187CS221066 ATUL CHANDRAVANSHI 7,8,9,10 7,8,9,10
58 0187CS221067 ATUL LODHI 1,2,3,4 1,2,3,4
6 0187CS221068 AYUSH KUMAR 4,5,6,7 4,5,6,7
60 0187CS221069 AYUSH KUMAR MISHRA 7,8,9,10 7,8,9,10
61 0187CS221070 BASUKI NATH PANDEY 1,2,3,4 1,2,3,4
62 0187CS221071 CHETAN PAL 4,5,6,7 4,5,6,7
63 0187CS221073 DEEPAK KURMI 7,8,9,10 7,8,9,10
64 0187CS221075 DEEPAK SARU 1,2,3,4 1,2,3,4
65 0187CS221076 DEEPSINGH JHALAWA 4,5,6,7 4,5,6,7
66 0187CS221077 DEV KUMAR MEENA 7,8,9,10 7,8,9,10
67 0187CS221078 DEV SHRIVASTAVA 1,2,3,4 1,2,3,4