2790

No of Pages : 3 Course Code : 15XT45

Roll No:
(To be filled in by the candidate)

PSG COLLEGE OF TECHNOLOGY, COIMBATORE - 641 004

SEMESTER EXAMINATIONS, APRIL 2018

MSc - THEORETICAL COMPUTER SCIENCE Semester : 4

15XT45 COMPUTER NETWORKS AND TCP/IP

Time : 3 Hours Maximum Marks : 100

INSTRUCTIONS:
1. Answer ALL questions. Each question carries 20 Marks.
2. Subdivision (a) carries 3 marks each, subdivision (b) carries 7 marks each and
subdivision (c) carries 10 marks each.
4. Course Outcome: Qn.1
CO.2 Qn.2 CO.1 Qn.3 CO.3 Qn.4 CO.4 Qn.5 CO.5
Table ....… .2... ....… ....… ....…
…. …… …. …. ….
1. a) Suppose Ethernet was the only existing
. LAN technology, so every host in the Internet
was part of a local Ethernet and therefore had a globally unique Ethernet address.
Would you now recommend to get rid of IP addresses by simply using Ethernet
addresses instead of IP addresses? What about the other way around, why do we
not simply assign network adapters IP addresses instead of Ethernet addresses so
we don’t have to deal with both, IP and Ethernet addresses?
b) i) Why is it that Ethernet frames from the destination address to checksum be atleast
64 bytes? (3)
ii) Consider the Go Back N protocol. Assume the size of sequence number space to
be N, and the window size to be N. Will the protocol work correctly in this case?
Give a timeline trace showing the sender, receiver and the messages that
exchange over time. (4)
c) (i) Write short notes on Random access protocols in LAN
(OR)
(ii) Write short notes on internetworking devices. Differentiate them based on the
collision domain and broadcast domain.
2. a) Encode the following bit stream 1101000000010 using NRZ and RZ techniques.
What is the major disadvantage in using NRZ encoding?
b) i) Let G(x) = x2+x+1. What is the reliability of error detection in CRC scheme that
makes use of this G(x) as the generator polynomial? For the message 1010110,
what is the transmitted frame? (4)
ii) An 8 bit data with binary value 10101111 is to be encoded using an even parity
hamming code. Construct the frame to be transmitted. (3)
c) Explain in general how data is transmitted from source to destination in a layered
approach.
3. a) If we can identify computers using hardware addresses, why use IP addresses?
Consider a host with IP address 200.100.100.4/16. If this host wants to send data to
another host at 200.100.150.8, will it use direct or indirect routing? How about
200.100.100.60 and 128.178.41.41? Why?

Page No: 1
 2790

No of Pages : 3 Course Code : 15XT45

b) i) Suppose we have a network with a 512 byte MTU (including headers). What is the
largest IP packet size that we can accept if we can only generate two fragments
for this packet? (4)
ii) Assume two routers are misconfigured to form a routing loop for a destination X.
Explain why an IP datagram destined for X will not go back and forth forever. (3)
c) Classless inter-domain routing (CIDR) has eased the problem of running out of IPv4
addresses. Why? Create an addressing scheme using variable length subnet
masking (VLSM) for the following topology. The network address is 192.168.10.0/24

4. a) Is it true that an ICMP message will be generated as and when the TTL in an IP
datagram becomes zero? Brief. A host receives an ICMP packet, type 4 which is a
source quench message from a router. What does it imply?
b) You fire up Wireshark and you see the following Ethernet frames interpreted to you.
What protocol is this? What is it used for? Why is the first packet sent to a broadcast
address, but the second isn't? Give a brief description on how it works.

Time Origin Destination Interpreted Contents

191.5 00:0e:0c:05:86:f7 00:00:00:00:00:00 Who has 128.148.34.7?

Tell 128.148.34.6"
191.6 00:0c:76:b2:84:08 00:03:0c:05:86:f7 128.148.34.7 is at
00:0c:76:b2:84:08"

c) Compare link state routing and distance vector routing algorithms in terms of:
 Speed of convergence
 Communication overhead

Page No: 2
 2790

No of Pages : 3 Course Code : 15XT45

The network above uses Link State Routing. Trace Dijkstra’s shortest path algorithm
to find the shortest path from A to all the other nodes. Explicitly show what happens
in each step. Show A-s routing table.
5. a) How is TCP able to provide Reliability for messages travelling in unreliable IP
datagrams.
b) i) What is resolution in DNS? What are the steps involved in resolving a domain
www.google.com. What are the intermediate servers involved and their role? (4)
ii) Suppose that Alice wants to send an email message to Bob. What are the entities
involved in the transfer from source to destination? Between which of these
entities does the SMTP protocol operate? What about the POP3 protocol? (3)
c) With the help of a state transition diagram explain how a TCP connection is
established and closed. A client C and a server S establish a connection. The initial
sequence number is 2000 from C to S and 9500 from S to C. Show the Sequence
Number and Acknowledgment Number in each segment sent below, and ignore
congestion control and flow control.
i. C sends SYN segment C1
ii. S sends SYN segment S1, including ACK of segment C1
iii. C sends three 1000-data-byte segments C2 through C4, including ACK of segment
S1
iv. S sends 0-data-byte segment S2, including ACK of segment C2
v. S sends a 1000-data-byte segment S3, including ACK of segment C3

/END/
FD/RL

Page No: 3