MAHATMA GHANDHI UNIVERSITY (MG)
B.TECH.
DEGREE EXAMINATION, OCTOBER/NOVEMBER 2003
Computer Science and Engineering
COMPUTER NETWORKS (R, I)
COMPUTER NETWORKS (R, I)
Maximum : 100 Marks
Part A
Ans-wer
all questions.
1. What is Network Architecture? What does its
specification contain ?
2. In which lay..:..bridge ? Why ?
3. What is the name given,to the division of
routers in hierarchical routing `)What are its functions
5. How both TDIVI and F DM are used in AM radio
broadcastin_g?
6. How can errors be handled ? What is Hamming
distance ?
7. Briefl l a one y expain bit sliding' window protocol.
8. Draw a diagram to explain Diffe-Hellman key
exchange and mention the application of this protocol.
9. What are the places in which file transfer
protocol is used ?
10. Explain source coding. (10 x 4
Part B
11. Explain in detail about gateways.
Or
12. What is a transparent bridge ? how it is
different from n H tree_ bridge. With suitable diagrams, explain. Monte-Carlo
connectivity analysis done
14. Discuss the function of Queue.
15. Compare the timing of events in i) PaCket
switching' and (ii) Message switching.
16. Explain the geosynchronous satellite in detail.
16. What is the basis for MIT algorithm ? Explain
the algorithm
18. Discuss the principles of congestion control.
19. Explain the application of I-I u coding.
Or
20. What are the issues arising out of a crash? How
are these issues handled? (5 x
12 --- 60 marks)
FOR COMPLETE PRINTED QUESTION PAPER SET
CONTACT: 9745451920 Rs:50/-
No comments:
Post a Comment