0% found this document useful (0 votes)
32 views5 pages

CN Tutorial Sheet

Uploaded by

chikayadav001
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
0% found this document useful (0 votes)
32 views5 pages

CN Tutorial Sheet

Uploaded by

chikayadav001
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/ 5

Tutorial Sheet

Topic: Miscellaneous (including GLAU PYQs + GATE PYQs)

Course and Sem: B.Tech (CS) – 3rd sem Subject Code: BCSC0008

Subject: Computer Networks Session: 2024-25

Q1. A block of addresses is granted to a small organization. We know that one of the addresses
is 205.16.37.39/28.
(i) What is the first address in the block?
(ii) What is the last address in the block?
(iii) How many addresses are in the block?

Q2. The following is part of a TCP header dump (contents) in hexadecimal format.

E293 0017 00000001 00000000 5002 07FF...


a. What is the source port number?
b. What is the destination port number?
c. What is the sequence number?
d. What is the acknowledgment number?
e. What is the length of the header?
f. What is the type of the segment?
g. What is the window size?

Q3. The following is a dump of a TCP header in hexadecimal format


053200217 000000001 00000000 500207FF 00000000..
a. What is the source port number?
b. What is the destination port number?
c. What is sequence number?
d. What is the acknowledgement number?
e. What is the length of the header?
f. What is the type of the segment?
g. What is the window size?

Q4. CSMA is based on the principle “sense before transmit”. Comment on it. Explain 1-
persistent, non-persistent and p-persistent method. A network has a data transmission
bandwidth of 20 × 106 bits per second. It uses CSMA/CD in the MAC layer. The maximum
signal propagation time from one node to another node is 40 microseconds. What is the
minimum size of a frame in the network in byte?
Q5. A 2 km long broadcast LAN has 107 bps bandwidth and uses CSMA / CD. The signal
travels along the wire at 2 x 108 m/sec. What is the minimum packet size that can be used on
this network?

Q6. Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs.
The round trip time of the connection is 100 msec and the maximum segment size used is 2
KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window
is .

Q7. Consider a LAN with four nodes S1, S2, S3, and S4. Time is divided into fixed-size slots,
and a node can begin its transmission only at the beginning of a slot. A collision is said to have
occurred if more than one node transmits in the same slot. The probabilities of generation of a
frame in a time slot by S1, S2, S3, and S4 are 0.1, 0.2, 0.3 and 0.4 respectively. The probability
of sending a frame in the first slot without any collision by any of these four stations
is .

Q8. An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses
available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to
Organization A, and a quarter to Organization B, while retaining the remaining with itself.
What are valid allocation of addresses to A and B?

Q9. The only entries in a certain route table are (128.59.28.0/22, port 0), (128.59.28.0/23, port
1) and (128.59.28.0/24, port 2). These entries indicate CIDR network number, the prefix
indication and the corresponding port to which a packet should be forwarded. If a packet
arrives with a destination IP address equal to 128.59.29.18, which port will this router will
this router forward the packet to?

Q10. An IPv4 packet has arrived with the first 8 bits as shown:
01000010
The receiver discards the packet. Why?
Q11. In an IPv4 packet, the value of HLEN is 1000 in binary. How many bytes of options are
being carried by this packet?
Q12. An IPv4 packet has arrived with the first few hexadecimal digits as shown.
0x45000028000100000102 . . .
How many hops can this packet travel before being dropped? The data belong to what upper-
layer protocol?
Q13. A packet has arrived with an M bit value of 0. Is this the first fragment, the last fragment,
or a middle fragment? Do we know if the packet was fragmented?
Q14. A packet has arrived with an M bit value of 1. Is this the first fragment, the last fragment,
or a middle fragment? Do we know if the packet was fragmented?
Q15. A packet has arrived with an M bit value of 1 and a fragmentation offset value of 0. Is
this the first fragment, the last fragment, or a middle fragment?
Q16. A packet has arrived in which the offset value is 100. What is the number of the first
byte? Do we know the number of the last byte?
Q17. A packet has arrived in which the offset value is 100, the value of HLEN is 5, and the
value of the total length field is 100. What are the numbers of the first byte and the last byte?
Q18. An IP datagram of size 1000 bytes arrives at a router. The router has to forward this packet
on a link whose MTU (maximum transmission unit) is 100 bytes. Assume that the size of the
IP header is 20 bytes.

The number of fragments that the IP datagram will be divided into for transmission is .

Q19. A datagram of 3000B (20B of IP header + 2980B data or payload) reached at Router and
must be forwarded to link with MTU of 500B. How many fragments will be generated and also
write MF (more fragment), offset, total length value for all.

Q20. Suppose you are browsing the world wide web using a web browser and trying to access
the web servers. What is the underlying protocol and port number that are being used?

Q21. Write a note on guided transmission media (i.e. Optical fibre, coaxial cable and twisted
pair with advantages and disadvantages). Draw neat and clean diagram wherever required.

Q22. Write short notes about:


 HTTP, FTP, SMTP, WWW, DNS
 Open and closed loop congestion control policies
 TCP SYN Flooding Attack

Q23. Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD)


algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold
at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth
transmission. Find the congestion window size at the end of the tenth transmission.

Q24. Consider the subnet given in the below diagram. Here, distance vector routing algorithm
is used.

The following vectors have just come in to router C:


fromB: (3,0,6,5,3,8,3);
from D: (1,5,3,0,8,6,3);
from E: (4,3,1,1,0,4,6); and
from F: (3,8,3,6,4,0,9).
The measured delays to B, D, E and F are 2,3,1 and 6, respectively.
What is C′S new routing table?

Q25. Consider a network with five nodes, N1 to N5, as shown as below.

The network uses a Distance Vector Routing protocol. Once the routes have been stabilized,
the distance vectors at different nodes are as follows:

N1: (0,1,7,8,4)
N2: (1,0,6,7,3)
N3: (7,6,0,2,6)
N4: (8,7,2,0,4)
N5: (4,3,6,4,0)

Each distance vector is the distance of the best known path at that instance to nodes, N1 to N5,
where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both
directions. In each round, all nodes exchange their distance vectors with their respective
neighbors. Then all nodes update their distance vectors. In between two rounds, any change in
cost of a link will cause the two incident nodes to change only that entry in their distance
vectors.

The cost of link N2−N3 reduces to 2 (in both directions). After the next round of updates, what
will be the new distance vector at node, N3?

Q26. In a RSA cryptosystem a particular A uses two prime numbers p = 13 and q =17 to
generate her public and private keys. If the public key of A is 35. Then the private key of A is
.

Q27. Explain the concept and applications of Public Key Cryptosystem and write the key
generation algorithm of RSA. Also generate the public key and secret key for the following
prime numbers using RSA Algorithm: p=7, q=11 and assume e=7.

Q28. Suppose that a message 1001 1100 1010 0011 is transmitted using Internet Checksum (4-
bit word). What is the value of the checksum?

Q29. A sender needs to send the four data items 0x3456, 0xABCC, 0x02BC, and 0xEEEE.
Answer the following:

a. Find the checksum at the sender site.


b. Find the checksum at the receiver site if there is no error.
c. Find the checksum at the receiver site if the second data item is changed to 0xABCE.
Q30. The message 11001001 is to be transmitted using the CRC polynomial x3 + 1 to protect
it from errors. What will be the message that should be transmitted?

Q31. Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to
send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link utilization
of 60%, the minimum number of bits required to represent the sequence number field is
.

Q32. Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per
second and 20 milliseconds propagation delay. Assume that the transmission time for the
acknowledgment and the processing time at nodes are negligible. Then the minimum frame
size in bytes to achieve a link utilization of at least 50% is .

Q33. What is the total delay (latency) for a frame of size 5 million bits that is being sent on a
link with 10 routers each having a queuing time of 2µs and a processing time of 1 µs. The
length of the link is 2000 Km. The speed of light inside the link is 2 × 108 m/s. The link has a
bandwidth of 5 Mbps. Which component of the total delay is dominant? Which one does
dominant the transmission time?

Q34. Suppose a 128kbps point to point link is setup between earth and Rover on Mars. The
distance from earth to Mars is approximately 55Gm data travel over the link at the speed of
light. What is the minimum RTT for the link?

Q35. How TCP is differing from UDP? Discuss connection establishment process of TCP.

Q36. Compare Go Back N protocol with Selective Repeat protocol in terms of efficiency,
number of retransmission and window size (both sender and receiver end).

Q37. Discuss the advantages of IPv6 addressing scheme over IPv4. Discuss the header format
of IPv4.

Q38. What is two node instability problem? Discuss the difference between distance vector and
Link state Routing Algorithms.

Q39. Consider the effect of using slow start on a line with a 10 msec RTT and no congestion.
The receiver window is 24 KB and the maximum segment size is 2 KB. How long does it take
before the first full window can be sent?

Q40. Consider the three-way handshake mechanism followed during TCP connection
establishment between hosts P and Q. Let X and Y be two random 32-bit starting sequence
numbers chosen by P and Q respectively. Suppose P sends a TCP connection request message
to Q with a TCP segment having SYN bit =1, SEQ number =X, and ACK bit =0. Suppose
Q accepts the connection request. Show how the information present in the TCP
segment header that is sent by Q to P.

Q41. Suppose an ISP owns the block of addresses of the form 131.210.16.0/21. Suppose it
wants to create four subnets from this block, with each block having the same number of IP
addresses. (i) What are the prefixes (of form a.b.c.d /x) for the four subnets? (ii) What is the
number of host address that can be supported per subnet?

You might also like