Computer Science (Semester 5)
Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6,Q7 or Q8,Q9 or Q10.
(2) Neat diagrams must be drawn wherever necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data if necessary.
Module-1
1.a.
What are the different types of transport services provided by the internet?
(8 marks)
00
1.b.
Compose logical note on proxy-server with suitable diagram.
(8 marks)
00
OR
2.a.
Discuss how files are distributed in peer-to-peer application.
(8 marks)
00
2.b.
Design network application using socket programming with UDP.
(8 marks)
00
Module-2
3.a.
Describe the various fields of UDP segment. Explain how checksum is calculated.
(8 marks)
00
3.b.
Design rdt 2.0 protocol.
(8 marks)
00
OR
4.a.
With a neat sketch, explain the TCP segment and its services.
(8 marks)
00
4.b.
Explain how connection is established and tear down in TCP.
(8 marks)
00
Module-3
5.a.
Draw IPv6 datagram format, mention the significance of each fields.f
(8 marks)
00
5.b.
Apply distance-vector algorithm for the following Fig.

(8 marks)
00
OR
6.a.
Illustrate Routing Information Protocol (RIP) with suitable diagram.
(8 marks)
00
6.b.
Explain the spanning tree algorithm.
(8 marks)
00
Module-4
7.a.
Define cellular network. Give the overview of GSM cellular network architecture.
(8 marks)
00
7.b.
Explain the two different types of routing approaches to mobile node.
(8 marks)
00
OR
8.a.
Illustrate the steps involved when a base station does decide to hand-off a mobile user.
(8 marks)
00
Module-5
9.a.
Brief out three broad categories of multimedia network applications.
(8 marks)
00
9.b.
Discuss the followings :
- Adaptive streaming
- DASH.
(8 marks)
00
OR
10.a
With general format, explain the various fields of RTP.
(8 marks)
00
10.b.
Explain the working procedure of leaky bucket algorithm.
(5 marks)
00