PB-1079-V 2

Roll No. ........................ C

SECTION-A
(Objective Type Questions) 7×1=7

1. Choose the correct option :

(a) Grammar of Type-I is often called :

(i) Regular grammars

PB-1079-V
(ii) Context-sensitive grammars
M. Sc. Second Semester
(iii) Context-free grammars

Regular / ATKT / Ex. Blended (iv) None of these

Mode (Online + Offline) (b) If  = a b a2 b3 and  = a b b3 then || = :

Examination, 2021 (i) 7

(ii) 14
MATHEMATICS
(iii) 12
Paper - V
(iv) 11
(Advanced Discrete Mathematics - II)
(c) What is full form of DFA :
Time : Three Hours ] [ Maximum Marks : 42
(i) Double Finite State Automata

Note:– Attempt all questions. (ii) Digital Finite State Automata

[ P. T. O.
 3 PB-1079-V PB-1079-V 4

(iii) Deterministic Finite State Automata (iii) Turing machine

(iv) None of these (iv) None

(d) In any graph G, there are even numbers of (g) Automaton is defined as a system where
vertices of : which is transformed :

(i) Even degree (i) Energy

(ii) Odd dgree (ii) Materials

(iii) Zero degree (iii) Information
(iv) None of these (iv) All of these

(e) A turing machine M is a .......... type machine : SECTION-B

(Short Answer Type Questions) 5×2=10
(i) 5

(ii) 10 Note :– Attempt all questions.

(iii) 12
2. Show that the sum of degree of all the vertices in a
(iv) 7 graph G is even and is twice the number of edges
in the graph.
(f) Mealy and Moore machine can be categorized
OR
as :
Explain direct graph with example.
(i) Inducers

(ii) Transducers 3. Explain equivalence of finite state machines.

[ P. T. O.
 5 PB-1079-V PB-1079-V 6

OR SECTION-C
(Long Answer Type Questions) 5×5=25
Design a fintie state machine M which can add two
binary numbers. Note :– Attempt all questions.

4. Explain difference between NFA and DFA. 7. State and prove Warshall's algorithm.

OR OR

Find an NFA with four states for : Explain Dijkrtra's algorithm.

L = {an : n > 0} U {bn a : n > 1} 8. Explain finite state machine with transition table.

OR
5. Explain contex free grammar with example.
Show that the language L = {ak | k = i2, i > 1} is not a
OR
fintie state language.
Explain regular grammar with example.
9. Explain Moore machine with example.
6. Find the language L (G) generated by the grammar OR
with T = {0, 1, 2}, N = {S, A} and P = {S  0 S A 2,
Explain Mealy machine with example.
S  0 1 2, 2 A  A 2, 1 A  11}.
10. Explain turing machine with example.
Test whether string  = 00112 and  = 001122
are in L (G). OR

OR Construct a grammar for the language :

Explain sentential forms. L = {ax by | x > y > 0}

[ P. T. O.
 7 PB-1079-V

11. Explain nations of syntax analysis.

OR

Explain polish notations.