M

Roll No.ne vos vma ssn

Total No. of Pages B.Tech.(Co)

Nov-2018
V-SEMESTER
END SEMESTER EXAMINATION

COMPUTATION
THEORY OF Max. Marks: 50
CO-303
Assume sultable
Time: 3:00 Hours each questlon.
parts from
Note: Answer all questtons
by selecting any two
mlssing data,Ifany 2X5=10

QNo. 1 decimal o
check that the
finite.state machine which
can

A) Design a
is divislble by 5 and also
write a regular
given binary string + m) is even}
L={a"b"|(n
expression for the language
expression(RE
theorem? Construct
a regular
B) What is Arden's theorem
the following FA using Arden's
corresponding to

a,b
b

made up of letter
machine that will read sequence
except when an
moore
C) Design characters
a,e,i,o,u and will give
as output same also design meal
'e', it will be changed to 'u'.
is followed by
machine for the same.
ZX5=1
QNo. 2

Machine which convert'11' to'10':

AJ Designa Turing
First constru
+010)'1 +0°1)'.
B) Given a regular expression(0(110
m o v e s fromn the
same.

with null moves, then eliminate null

NFA
is a str
accepting L= {w ¬ {a, b}* |w
C) Construct a regular grammar
u u b e r of b's is 3 mod 4).
over {a,b} such that the

PTo
 24 5-
2X5=10
Q.No. 3 expression? Show thet s

regular
lemma for
is pumping not regular.
A) What nsm) Is
LF {0"1"|
anghage
lemma for
Context Free Language (CI
Pumping
B) Stateand
prove

grammar(CFG)
which accepts the lanou guage L=
Contert free
Write a
C)
(o'1/2| k slor k S]}
2X5=10
Q.No. 4
A) to CNF
Convert the following grammar
Sabsbja JaAb,-A> bS[aAAb
to GNF
Convert following CFG
ASbA|SS, Aba
SaASI a,

the ambiguity of context free grammar with example and

B) Explain
show that Language L= {am bm c| ms nz 2m} Is not a contextfree

language(CFL).
C) Design push down automata(PDA) for the following Language
. L ( a bm a| m, nz 1}.
2X5-10
Q.No. 5

A) Deslgn a Turlng machine(TM) that will recognlze the language

(O1n20}.
B Explain recursive and recursive enumerable languages and Deg
push down automata(PDA) for the
following grammar
S aSalbsb, S>c
c) Explaln follówtng
terms with example-
1. Myhill-Nerode Theorem.
Past correspondence problem(PCP)
11 Church's thesls and
Halting problem
Total No. of Pages 02 Roll No...
B.Tech. (COE)
THIRD SEMESTER

END SEMESTER EXAMINATION NOVIDEC-2018

THEORY & CODING

CO-305 1NFORMATION
Max. Marks: 50
Time: 3:00 Hours
All questions carry equal marks-
Note: Answer Any FIVE questions.
Assume suitable missing data, if any.
channel
transmits binary digits over a noisy
1[aj A digital communication system in
the probability of a binary digit being
in blocks of 16 digits. Assume that within a block are
errors in various digits positions
error is 0.01 and that
statistically independent.
errors per block.
Find the expected number of than or
1) the number of errors per block is greater
Find the probability that
i)
equal to 3. random variable X has the
variables? a
What is discrete random
Suppuse
b]
following probability function. 8
2 4
0.3 0.4
0.1 0.2
f( o of x.
mean
u and standard deviation
1) Compute the standardized random variable
distribution of the
ii) Find the probability
0 and o=1.
z (x-u)/o and show that =
are
maximum when all the messages
that entropy is
2[al What is Entropy? Show
equiprobale. with their
föllowing message
b]Deterimine the Huffiman code for the
probabilities given
3 0.3 0.1
0.05 0.15
0.15 0.2
0.05
005 of the code.
Find the average length and the efficiency
=
=

P(X,) 1/2, P(X)

is given below for which
For a channel whose matrix Y), I(X,Y)
3[a] find H(X), H(Y), H(Y/X), HX,
P(X) =1/4 and r,= 10000/sec,
and the capacity.

PTO
 M7

0.8 0.2 0
0.10.8 0.1
PY/X]= 0 0.2 0.3

Derive an expression for the channel canacis, .

[b] Define channel capacity.
binary symmetric channel.

for specified varience is

4 [a] Prove that the maximun differential entropy
bX)=4log2(2 r e o). width "B"Hz, with additive
Prove that the channel capacity of a channel
[b] density No/B and limited in bound limited
Gaussian noise of power spectral
to B is CBlog2(1+P/NoB).
code with generator
5 [a] What arecyclic codes? Assume the (7,4) cyclicFind the corresponding
data d- (1110).
polynomial g(x)=x3+x1+1. Let
systematic code word
Define BCH code. The (15,11) single error correacting binary
BCH code has
[b] roots of g(X) but a' is not
a root,
g(x)}=x*+x+1. Show that a, a, a are
Find the fourth root of g(x)
where a is primitive field element of GF(24).

block codes? How would you generatea

6[a] What are the properties of linear
linesr code?
minimum
linear code. What is
Show that {0000, 1100, 0011, 1111} is a

distance of this code.

The parity check matrix of a particular (7,4) linear block
code is given by,
[b]
H1 1 0 1 0 0
1 1 0 1 0 10
10 1 10 0 1
o f(7,4) hanmingcode. ofthe
matrice>
Determine systematic forns for parity check and generator
(8,4) extended hamming code

7 Write short notcs:

a] Uncertainty and Information
[b] Ideal System for channel capacity theorem.
[c] Non-Systematic code
d Convolution Code
 tcd Roll No.
Total No. of Pages 2

V-SEMESTER B.Tech.(CO0) Old Scheme

END SEMESTER EXAMINATION Nov-20118

co 303 THEORY OF COMPUTATION

Time: 3:00 Hours Max. Marks: 70
Note: Answer all questions byselectinganytwoparts from eachquestion.Assumesultablemissing daza,ifany

Q.No. 1 2X7=14
A) Construct a DFSA for strings over (0, 1) which accepts strings those have exactly
two zero's anywhere.

B) Construct a regular expression(RE) corresponding to the following FA using

Arden's theorem

1 0,1
g2

C) Design a Mealy machine which reads the input from (a + b) and produces
following outputs:
If input ends at "aba", output is A
ii. If input ends at "aab", output is B
iii. Otherwise output is C
Q.No. 2
A) Construct a Moore Machine equivalent to 2X7=14
given Mealy Machine as below
Present Next 0/P Next
State state
0/P
state
Input=a Input=b
g0 g3 a q1
q1 q1 q2
q2 g2 a
q3 a
g3 g3 g3
B) Given a
regular expression
moves, then eliminate null ((00+01)* (11+10) (+1))*. construct NFA with null
moves from the
same.
C) Explain Pumping lemma for context free
grammar is ambiguous Language and show that
followings
SA B|b , A aAB|ab B abB|¬
Q.No. 3 2X7=14

A) What is pumping lemma for regular expression? Show that the language L={a* ba c*
n21} is not regular.

B) Design a Turing Machine(TM) to recognize strings having equal number of a's and
b's.

C) What is context free grammar? Write CFG which accepts the language L =
(0'1/oty >i+k}.
Q.No.4 2X7=14

A) Construct a reduced grammar equivalent to the grammar

SaAa A> Sb|DaA|bcc
,
C abb|DD
EaC, D aDA

B) What is Arden's theorem? Prove (b +

aa"b)+ (b +
aa"b)(a +
ba*b)" (a ba'b)
=a*b(a+ba*b)*.
C)What is PDA? Design a Push Down Automata (PDA) which
Language L= {ancb~n where n21} over E={a,b.c). recognize the

Q.No.5
2X7=14
A) Explain Chomsky's Hierarchy of
grammars with suitable examples
production rules of following CFG to find an and consider
Normal Form(GNF). equivalent grammar in Greibach
SS+S/S*S
Sb
Sa

B) Designa Turing Machine which

convert '111' to '011' in a
binary input string.
C) Construct a push down
automata for the
following
L= {0
1a2| n=1,2,3,-. Language