Scribd
Upload
16 views

CN 3

Uploaded by

u2203162
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

CN 3

Uploaded by

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

211782

Reg No:___________________________ Name:_____________________________


RAJAGIRI SCHOOL OF ENGINEERING & TECHNOLOGY
(Autonomous)

B.Tech Degree Fifth Semester Supplementary Examination (2020 Scheme)

September 2023

Course Code : 100003/CS500B


Course Name : COMPUTER NETWORKS

Programme: Computer Science and Engineering


Max.Mark:100 Duration: 3 hours
Part A

Answer All Questions


1 Differentiate between Manchester and Differential Manchester encoding. (3)
2 What are the different types of transmission technologies widely used in
(3)
computer networks?
3 Demonstrate the significance of sequence numbers in Stop and wait ARQ. (3)
4 Explain the phases in a PPP connection with the help of a transition diagram. (3)
5 How does a choke packet control congestion? (3)
6 What is flooding? Describe any two situations where flooding is advantageous. (3)
7 In an IPv4 packet, the value of HLEN is 0110 in binary. How many bytes of
(3)
options are being carried by this packet?
8 Compare the datagram network with the virtual-circuit network. (3)
9 If an application needs to protect the boundaries of its message, which protocol
(3)
should be used, TCP or UDP? Justify the answer.
10 Explain the procedure for calculating the UDP checksum. (3)
Part B

Each question carries 14 Marks


11 Explain in detail the different physical topologies. (14)
OR

12 a) What are the advantages and disadvantages of computer networks?


(14)
b) Explain different applications of computer networks.

13 a) Explain in detail the Stop and Wait protocol. (9 marks)


b) A sender sends a series of packets to the same destination using 7-bit (14)
sequence numbers. If the sequence number starts with 0, what is the sequence
number after sending 2500 packets? (5 marks)
Page 1 of 2
OR

14 a) Explain the Go back-N Strategy with suitable diagrams.


(14)
b) Station A needs to send a message consisting of 17 packets to station B using
a sliding window (window size=3) and go back N strategy. All packets are ready
and immediately available for transmission. If every 4th packet that A transmits
gets lost (but no ACKs from B ever gets lost), then what is the number of
packets that A transmit to B?
15 a) With the help of an example, explain Dijikstra's algorithm to find the shortest
path in a network. (10 marks) (14)

b) Define the optimality principle. How is it useful in routing algorithms?


(4 marks)
OR

16 a) Explain in detail the traffic throttling approach to control congestion.


(14)
(10 marks)

b) With an example, explain each field in the link state packet. (4 marks)

17 a) With a neat sketch, explain the fields in IPV4 header format. (10 marks)
(14)
b) What is the need for fragmentation? Explain how it is done in the network
layer. (4 marks)
OR

18 a) Show the unabbreviated colon hex notation for an address with 64 0s


followed by 32 two-bit (01)s. ( 3 marks)
(14)
b) Using CIDR notation, show the IPv6 address compatible to the IPv4 address
129.6.12.34. (3 marks)

c) Make a table to compare and contrast informational messages in ICMPv6


with informational messages in ICMPv4. (8 marks)

19 a) Explain SNMP's basic components and their functions. Describe the basic
(14)
commands used in SNMP. (8 marks)

b) Mention the roles of managers and agents in SNMP. (6 marks)


OR

20 a) With a neat sketch, explain the various fields in the UDP header. (8 marks) (14)

b) Explain the TCP retransmission policy in detail. (6 marks)


꧁__________________________________________________________________꧂

Page 2 of 2

You might also like