Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword
Like this
18Activity
0 of .
Results for:
No results containing your search query
P. 1
rr320503-computer-networks

rr320503-computer-networks

Ratings:
(0)
|Views: 1,134|Likes:
Published by SRINIVASA RAO GANTA

More info:

Published by: SRINIVASA RAO GANTA on Sep 18, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/09/2014

pdf

text

original

 
Code No: RR320503
Set No. 1
III B.Tech II Semester Supplimentary Examinations, Aug/Sep 2008COMPUTER NETWORKS( Common to Computer Science & Engineering, Information Technology,Electronics & Control Engineering, Computer Science & SystemsEngineering and Electronics & Computer Engineering)Time: 3 hours Max Marks: 80Answer any FIVE QuestionsAll Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) List two advantages and two disadvantages of having international standardsfor network, Protocols?(b) Write short notes on interfaces and services of ISO layers. [8+8]2. (a) The following data fragment occurs in the middle of a data stream for whichthe character-stuffing algorithm described in the text is used: DLE, STX, A,DLE, B, DLE, ETX. What is the output after stuffing?(b) When bit stuffing is used, is it possible for the loss, insertion, or modificationof a single bit to cause an error not detected by the checksum? If not, whynot? If so, how? Does the checksum length play a role here?(c) Data link protocols almost always put the CRC in a trailer, rather than in aheader. Why? [6+6+4]3. (a) What is collision free protocols? Explain Binary count down protocol.(b) Explain in detail, Adaptive free walk protocol. [8+8]4. What is congestion? How does it differ from flow control? Discuss about the generalprinciples of congestion? Briefly discuss about policies that affect congestion. [16]5. (a) Briefly explain the concepts of Flow Control and Buffering.(b) Imagine that a two-way handshake rather than a three-way handshake wereused to set up connections. In other words, the third message was not required.Are deadlocks now possible? Give an example or show that none exist. [8+8]6. (a) Briefly discuss ICMP.(b) With an example, explain Address resolution protocol. [8+8]7. (a) Draw and explain in detail the TCP Header.(b) Briey discuss TCP connection Management. [8+8]8. (a) PGP does not support canonicalization as does PEM. Why not?(b) Assuming that everyone on the Internet used PGP, could a PGP message besent to an arbitrary Internet address and be decoded correctly by all con-cerned? Discuss your answer. [8+8]
⋆ ⋆ ⋆ ⋆ ⋆
1 of 1
 
Code No: RR320503
Set No. 2
III B.Tech II Semester Supplimentary Examinations, Aug/Sep 2008COMPUTER NETWORKS( Common to Computer Science & Engineering, Information Technology,Electronics & Control Engineering, Computer Science & SystemsEngineering and Electronics & Computer Engineering)Time: 3 hours Max Marks: 80Answer any FIVE QuestionsAll Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) Explain in detail ISO-OSI reference model.(b) Write short notes on interface, service and protocol. [8+8]2. (a) The following data fragment occurs in the middle of a data stream for whichthe character-stuffing algorithm described in the text is used: DLE, STX, A,DLE, B, DLE, ETX. What is the output after stuffing?(b) When bit stuffing is used, is it possible for the loss, insertion, or modificationof a single bit to cause an error not detected by the checksum? If not, whynot? If so, how? Does the checksum length play a role here?(c) Data link protocols almost always put the CRC in a trailer, rather than in aheader. Why? [6+6+4]3. (a) Explain the operation of source Routing Bridges.(b) Compare and contrast Transparent and Source routing bridges. [8+8]4. (a) What is Broadcasting? With an example, explain about Reverse path for-warding(b) With an example, explain multicast Routing Algorithm. [8+8]5. (a) Imagine that a two-way handshake rather than a three-way handshake wereused to set up connections. In other words, the third message was not required.Are deadlocks now possible? Give an example or show that none exist.(b) Datagram fragmentation and reassembly are handled by IP and are invisibleto TCP. Does this mean that TCP does not have to worry about data arrivingin the wrong order? [8+8]6. (a) Briefly discuss about connection less Internetworking.(b) Explain rewalls, packet lter and a proxy in detail. [8+8]7. (a) What is Nagle’s algorithm? Explain the problem of silly window syndrome:suggest a solution to this problem.(b) Briey discuss about TCP timer management. [8+8]8. (a) What is the difference between message confidentiality and message integrity?Can you have one without the other? Justify your answer.1 of 2
 
Code No: RR320503
Set No. 2
(b) What is a key distribution centre? What is a certificate authority?(c) In what way does a public key encrypted message digest provide a “better”digital signature than using public key encrypted message? [6+6+4]
⋆ ⋆ ⋆ ⋆ ⋆
2 of 2

Activity (18)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Ajeena Paul liked this
Dan Danut liked this
Jeya Prakash liked this
Malini Sreenivas liked this
Alexandra Monica liked this
Kasturi Kas liked this
bestoon82 liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->