[go: up one dir, main page]

0% found this document useful (0 votes)
20 views2 pages

Assignment CN

questions

Uploaded by

anitha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views2 pages

Assignment CN

questions

Uploaded by

anitha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment :: Questions

1. Discuss in detail about the Socket Interface Programming and write the program for

any application in Client and Server communication.

2. Explain how TCP, which uses the services provided by the unreliable IP,can provide

reliable communication.

3. Explain how DHCP can be used when the size of the block assigned to an organization is

less than the number of hosts in the Organization.

4. Assume that the shortest distance between nodes a,b,c and d to node y and the costs

from node x to node a,b,c ,and d are as follows:


Day= 5 Dby=6 Dcy=4 Ddy=3
Cxa=2 Cxb =1 Cxc =3 Cxd=1
What is the shortest distance between node x and node y. Dxy, according to the

Bellman-ford quation?

5. What is the Hamming distance for each of the following codewords:


a. d(10000,00000)
b. d(00000,11111)
c. d(10101,10000)
d. d(00000,00000)
S.No Assignment Questions CO BT Level
1. Discuss in detail about the Socket
Interface Programming
and write the program for any
application in Client and Server
communication.

2. Explain how TCP, which uses the


services provided by the unreliable IP,
can provide reliable communication.

3. Explain how DHCP can be used when


the size of the block assigned to an
organization is
less than the number of hosts in the
Organization.

4. Assume that the shortest distance


between nodes a,b,c and d to node y
and the costs
from node x to node a,b,c ,and d are as
follows:
Day= 5 Dby=6 Dcy=4
Ddy=3
Cxa=2 Cxb =1 Cxc =3
Cxd=1
What is the shortest distance between
node x and node y. Dxy, according to
the Bellman-ford quation?

5. What is the Hamming distance for


each of the following codewords:
1. d(10000,00000)
2. d(00000,11111)
3. d(10101,10000)
4. d(00000,00000)

You might also like