0% found this document useful (0 votes)
114 views

Computer Networks 1 Jan 2014

This document contains a computer networks exam from December 2013/January 2014. It includes 8 questions covering topics like data communication systems, OSI layers, transmission modes, multiplexing, error detection/correction, protocols, network architectures, addressing, grammars and formal languages. Students are asked to answer 5 of the 8 questions in detail, selecting at least 2 questions from each part (A and B). The questions require explanations, derivations and short notes on key computer networks and formal languages concepts.

Uploaded by

Prasad C M
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
114 views

Computer Networks 1 Jan 2014

This document contains a computer networks exam from December 2013/January 2014. It includes 8 questions covering topics like data communication systems, OSI layers, transmission modes, multiplexing, error detection/correction, protocols, network architectures, addressing, grammars and formal languages. Students are asked to answer 5 of the 8 questions in detail, selecting at least 2 questions from each part (A and B). The questions require explanations, derivations and short notes on key computer networks and formal languages concepts.

Uploaded by

Prasad C M
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

USN

10csss
Fifth Semester B.E. Degree Examination, Dec. 2OL3lJan.2Ol4
Gomputer Networks
-
I
Time: 3 hrs. Max. Marks:100
Note: Answer FIVE
full
questions, selecting
atleast Tl4/O questions
from
each part.
PART
_
A
1 a. What is data communication? List and explain the five components of data communication
system, (06 Marks)
Discuss the ISO-OSI layered model, bringing out the functionalities of each layer. (10 Marks)
Differentiatg between :
i) ARP and RARP
ii) UDP and TeP-. (04 Marks)
(08 Marks)
(06 Marks)
(06 Marks)
3 a. What is FDM? Briefly explain its multiplexing and demultiplexing process. (06 Marks)
b. Four sources create 250 characters per second. The frame contain one character from each
d
o
o
(s
4)
(.)
Ey
dU
oll
I
EOO
go
OE:
-o
=!
C) Y,:
a:
oO
o0i
-6
'ia
or=
sa
o'i
aZ
A,i
!o
o.r
>':
ao-
co0
6=
*o
tr>
Xo
v!
o-
\J<
-i
6i
o
o
Z
P
o
b.
c.
2 a. Write a descriptive note on three causes of transmission impairment.
b. Explain the transmission modes?
c. Explain delta modulation?
c.
4a.
b.
c.
source and one extra bit for synchroaiZation. Find :
il The data rate oIeach source
ii) Duration of each character in each souice
iv) Duration of output frame
v) Frame size in bits
vi) Data rate of link.
What is time division multiplexing? Explain how
disadvantages of synchronous TDM.
Describe different types of enors.
Explain errot detection and error correction with respect to block coding.
Find the codeword, using CRC given data word "1001" and generator "1011"
PART
_
B
a. Explain briefly, with neat figure stop and wait ARQ and Go Back N ARQ.
b. Explain the liame format and transitional phases of point to point protocol.
a. Explain:
i) csMA
ii) csMA/cD.
b. Describe 802.3 Mac frame
a. ExplainIEEE 802.11 architecture.
b. Bring out the differences between repeaters, bridges, routers and gateways.
a. Explain with respect to IPV4, classful addressing and classless addressing.
b. Explain in detail IPV6 packet format.
(08 Marks)
(03 Marks)
(08 Marks)
(09 Marks)
(12 Marks)
(08 Marks)
l
(12 Marks)
(08 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
(t0 Marks)
.
-.
I Co;i"',,,:.*i I"
\'.uk
Tou"'"tt"'j,"''1
\,p\
_/.:?,'
.r
" )____-/-d,)
'\dP
ruqc4--'
(06 Marks)
statistical T-DM- overcomes the
For More Question Papers Visit - www.pediawikiblog.com
For More Question Papers Visit - www.pediawikiblog.com
w
w
w
.
p
e
d
i
a
w
i
k
i
b
l
o
g
.
c
o
m
06css6
4 a. Define CFG. Obtain CFG for the following :
i) ;:1anb2nln>0)
lll::{unbn'I,,>3}
*
:::
,
iii) For regular expression (a + b) . (07 Marks)
,, b. ConsiderthegrammarGwithfollowingproductionsE -++EE
l*EE l-EE lx ly
Find LMD, RMD and write parse tree for the string + *
-
xyxy. (06 Marks)
c. What is ambiguous grammar? Show that the following grammar is ambiguous on the string
ittibtaea.
S;iCtSliCtSeSla
C -+ brr
(07 Marks)
.,::ttt...
,'t'.'....,.
PART-B
l
5 a. Describe the languages accepted by PDA. (04 Marks)
b.
Construct aPDAthatacceptsthefollowing: L:
{wlw
eia+b)* andNu(w):N6(w)},write
the instantaneous description for the string abba. (10 Marks)
c' Convert the following CFG to PDA that accept the same language by empty stack.
S -+ aABC, A -+ aBla, B -+ bAlb, C -+ a. (06 Marks)
6 a. What are useless symbols? Eliminate useless symbols from the following grammar :
S -+ AB
I
CA, A -) a, B -+ BC
I
AB, C + aBlb. (07 Marks)
b. What are unit production? Eliminate unit productions from the following grammar :
S -+ AalB, B -+ Albb, A -+ al bcfB.
(05 Marks)
c.
What is CNF? Convert the lollowing grammai into CNF
S -+ aAD, A -+ aBlbAB, B -+ b, D + d.
(08 Marks)
:::'
.
7 a. Explain with diagram, the working of a Turing machine and multitape Turing machine.
b.
Design a Turing machine that accepts the language. L:
{anbl I
n > 1}. Also write the
transition diagram and instantaneous description for the string aab6.
,,
(12 Marks)
8 Write short notes on the following :
'
,
a. Multi tape Turing M/C
b. l-latting probtem of mA
c. Recursive language
d. Post's correspondence problem.
(20 Marks)
For More Question Papers Visit - www.pediawikiblog.com
For More Question Papers Visit - www.pediawikiblog.com
w
w
w
.
p
e
d
i
a
w
i
k
i
b
l
o
g
.
c
o
m

You might also like