Professional Documents
Culture Documents
Be Computer Engineering Semester 5 2023 December Theoretical Computer Sciencerev 2019 C Scheme
Be Computer Engineering Semester 5 2023 December Theoretical Computer Sciencerev 2019 C Scheme
Be Computer Engineering Semester 5 2023 December Theoretical Computer Sciencerev 2019 C Scheme
7
5
B5
71
3A
Paper / Subject Code: 31921 / Theoretical Computer Science
C1
05
5A
AE
D7
B9
56
71
3A
C1
AB
05
5E
AE
D7
B9
56
C4
5
3A
1
AB
5
5E
0F
C
0
7
B9
56
Duration: 3 hrs [Max Marks: 80]
C4
0F
A5
D
AB
05
E
56
73
5
0
B9
N.B. : (1) Question No 1 is Compulsory.
C4
08
5
5D
B5
3A
0
5E
17
6
(2) Attempt any three questions out of the remaining five.
0F
90
5A
5
D7
E7
C4
08
0F
(3) All questions carry equal marks.
EB
3A
05
1A
56
F
(4) Assume suitable data, if required and state it clearly.
71
45
0
D7
B9
8
0F
6C
C
1 [20]
70
05
E
A
0F
B5
71
45
5
1
9
08
0F
a Differentiate Finite Automata, Push Down Automata and Turing Machine.
5D
5A
EB
E
C
6
1A
56
0F
B5
90
1
3A
45
b Discuss different applications of Finite Automata
E7
08
F
6C
5A
EB
C
60
D7
17
0F
Design DFA that accepts Strings with at least 3 a’s. over ∑={a,b}.
B5
c
3A
45
85
1
05
E7
0F
6C
5A
FC
0
7
B9
1A
17
d Simplify the given grammar
6
D
B5
A
85
F0
05
5E
S ASB | є
E7
6C
3
FC
70
60
7
B9
C4
A aAS | a
A
A5
5D
71
85
F0
C1
AB
5E
B SbS | A | bb
0F
73
90
AE
60
56
C4
0F
17
5
5D
B
85
C1
AB
E
E7
56
Compare and Contrast Moore and Mealy Machines. Design Moore machine for ∑={0,1},
73
2 a 0 [10]
45
0
70
9
56
08
1A
A5
5D
EB
71
0
AB
17
56
0F
6C
Design Push Down Machine that accepts L = {am bn cn dm | m, n>0 }
3
b 90 [10]
AE
45
D7
E7
08
0F
5
B
B5
C
3A
C1
05
E
1A
17
5A
5
5
F0
D7
B9
56
E7
3 a i) [10]
FC
3A
60
AB
5
E
1A
90
1
45
85
F0
D7
7
Obtain parse tree for the following string “aababb” and check if the grammar is
6C
A5
5A
B
E
C
0
60
05
5E
1A
17
F
B5
ambiguous.
73
3A
85
B9
E7
C4
F
6C
5D
b Explain Pumping Lemma with the help of a diagram to prove that given language is not a
5A
[10]
70
0
D7
5E
A
56
0F
90
71
3A
1
05
C4
8
0F
6C
5A
EB
AE
70
D7
B9
0F
B5
i) Design DFA that accepts Strings that ends in either “110” or “101” over ∑={0,1}.
71
4 a
3A
45 [10]
85
C1
05
5E
F
5A
ii) Design NFA that accepts strings starting with “abb” or “bba”
E
FC
70
0
D7
B9
56
C4
56
71
3A
F0
1
AB
05
5E
0F
08
C
b Given NFA with epsilon, Find equivalent DFA. q1 is the initial state, q3 is final state [10]
E
60
D7
B9
6
C4
F
1A
17
5
B5
є
A
60
85
0 1 2
05
5E
E7
0F
6C
73
A
85
q1
70
{q1} - - {q2 }
B9
C4
0F
1A
5
5D
B5
71
3A
q2 - {q2} - { q3}
5E
56
0F
6C
0
5A
AE
D7
B9
*q3 - - { q3} -
C4
08
0F
B5
A
C1
5
5E
17
56
0F
3
0
A
7
B9
56
7
C4
08
0F
A5
D
AE
5 a Find Equivalent Greibach Normal Form (GNF) for given CFG. [10]
AB
05
E
17
56
0F
73
S AA | a
45
C1
9
E7
08
0F
A5
5D
EB
C
A SS | b
1A
17
56
73
0
5
b [10]
9
E7
C4
08
F
C
5D
EB
60
56
1A
17
0F
90
45
5
B
E7
08
0F
C
5A
EB
[20]
56
1A
6
71
3A
45
85
F0
B
FC
70
60
56
1A
1
A
F0
B
08
6C
73
5A
60
1A
17
5D
B5
85
E7
C
73
90
5A
70
56
1A
d TM-Halting Problem.
D
EB
71
3A
B
05
6C
5A
AE
________________________
D7
B9
B5
A
C1
05
E
73
5A
45
B9
56
D
FC
3A
AB
05
E
38529 Page 1 of 1
45
F0
D7
B9
A5
FC
60
05
E
73
45
F0
B9
5D
C
0
E
56
0F
8560F0FC45EB905D73A5AB56C1AE7170
90
45