CN Questions & Solved Numericals

Communication Network Sem VI
IMPORTANT QUESTIONS
UNIT 1
Q.1: IDENTIFY THE FIVE COMPONENTS OF A DATA COMMUNICATION SYSTEM.

Q.2: EXPLAIN OSI REFERENCE MODEL IN DETAIL.
Q.3: DRAW AND EXPLAIN A HYBRID TOPOLOGY WITH A RING BACKBONE AND TWO BUS NETWORKS.
Q.4: DRAW AND EXPLAIN TCP/IP PROTOCOL SUIT.
Q.5: EXPLAIN THE WORKING OF ROUTER IN DETAIL.
Q.6: EXPLAIN THE WORKING OF SWITCHES IN DETAIL.
Q.7: EXPLAIN LAN MAN WAN IN DETAIL.
Q.8: EXPLAIN ADDRESSES IN TCP/IP.
UNIT 2
Q.1: EXPLAIN STOP AND WAIT FLOW CONTROL.

Q.2: EXPLAIN SLIDING WINDOW FLOW CONTROL.
Q.3: EXPLAIN STOP AND WAIT ARQ IN DETAIL.
Q.4: EXPLAIN GO-BACK-N ARQ MECHANISM.
Q.5: EXPLAIN SELECTIVE REPEAT ARQ IN DETAIL.
UNIT 3
Q.1: EXPLAIN CSMA/CD AND ITS USE. WHAT PART OF THE 802 PROJECT USES CSMA/CD?
Q.2: EXPLAIN ALOHA IN DETAIL.
Q.3: EXPLAIN TOKEN BUS (IEEE 802.4) IN DETAIL.
Q.4: EXPLAIN TOKEN RING (IEEE 802.5) IN DETAIL.
Q.5: EXPLAIN POLLING AND TOKEN PASSING IN DETAIL.
UNIT 4
Q.1: EXPLAIN LEAKY BUCKET ALGORITHM.

Q.2: EXPLAIN TCP HEADER FORMAT IN DETAIL.
Q.3: EXPLAIN IPV4 CLASSFUL ADDRESSING.
Q.4: EXPLAIN TOKEN BUCKET ALGORITHM.
Q.5: EXPLAIN DIFFERENCE BETWEEN VIRTUAL CIRCUIT AND DATAGRAM NETWORK.
UNIT 5
Q.1: EXPLAIN USER DATAGRAM PROTOCOL (UDP).

Q.2: EXPLAIN TRANSMISSION CONTROL PROTOCOL (TCP).
Q.3: EXPLAIN THE WORKING OF REMOTE PROCEDURE CALL IN DETAIL.
Q.4: WHAT ARE THE DIFFERENT ISSUES IN RESOURCE ALLOCATION?
Q.5: EXPLAIN QUEUING DISCIPLINES.
Q.6: EXPLAIN VARIOUS CONGESTION AVOIDANCE MECHANISM.
UNIT 6
Q.1: EXPLAIN DOMAIN NAME SYSTEM (DNS).

Q.2: EXPLAIN SIMPLE MAIL TRANSFER PROTOCOL (SMTP) IN DETAIL.
Q.3: EXPLAIN FILE TRANSFER PROTOCOL (FTP) IN DETAIL.
Q.4: EXPLAIN TELNET IN DETAIL.
PROBLEMS
Q.1: ASUUSME SIX DEVICES ARE ARRANGED IN A MESH TOPOLOGY. HOW MANY CABLES ARE
NEEDED? HOW MANY PORTS ARE NEEDED FOR EACH DEVICE?
Q.2: If the bandwidth of the line is 1.5 Mbps, RTT is 45 msec and packet size is 1 KB,
then find the link utilization in stop and wait.
Solution-
Given - Bandwidth = 1.5 Mbps, RTT = 45 msec, Packet size = 1 KB
Calculating Transmission Delay-

Transmission delay (Tt) = Packet size / Bandwidth
= 1 KB / 1.5 Mbps
= (210 x 8 bits) / (1.5 x 106 bits per sec)
= 5.461 msec
Calculating Propagation Delay-
Propagation delay (Tp) = Round Trip Time / 2

= 45 msec / 2
= 22.5 msec
Calculating Value of ‘a’-
a = Tp / Tt
a = 22.5 msec / 5.461 msec
a = 4.12
Calculating Link Utilization-

Link Utilization or Efficiency (η) = 1 / 1+2a
= 1 / (1 + 2 x 4.12)
= 1 / 9.24
= 0.108
= 10.8 %
Q.3: A channel has a bit rate of 4 Kbps and one way propagation delay of 20 msec. The channel
uses stop and wait protocol. The transmission time of the acknowledgement frame is negligible.
To get a channel efficiency of at least 50%, the minimum frame size should be-
1. 80 bytes
2. 80 bits
3. 160 bytes
4. 160 bits
Solution:
Given - Bandwidth = 4 Kbps, Propagation delay (Tp) = 20 msec, Efficiency >= 50%
Let the required frame size = L bits.
= L bits / 4 Kbps
a = Tp / Tt
a = 20 msec / ( L bits / 4 Kbps)
a = (20 msec x 4 Kbps) / L bits
Condition for Efficiency to Be At least 50%-
For efficiency to be at least 50%, we must have-

1 / 1+2a >= 1/2
a <= 1/2
Substituting the value of ‘a’, we get-
(20 msec x 4 Kbps) / L bits <= 1/2
L bits >= (20 msec x 4 Kbps) x 2
L bits >= (20 x 10-3 sec x 4 x 103 bits per sec) x 2
L bits >= 20 x 4 bits x 2
L >= 160
From here, frame size must be at least 160 bits.
Thus, Correct Option is (4).
---------------------------------------------------------------------------------------------------------------------
Q.4: Consider a MAN with average source and destination 20 Km apart and one way delay of
100 μsec. At what data rate does the round trip delay equals the transmission delay for a 1
KB packet?
Solution-
Given - Distance = 20 Km, Propagation delay (Tp) = 100 μsec, Packet size = 1 KB
We need to have-
Round Trip Time = Transmission delay

2 x Propagation delay = Transmission delay
Substituting the values in the above relation, we get-
2 x 100 μsec = 1 KB / Bandwidth
Bandwidth = 1 KB / 200 μsec
Bandwidth = (210 x 106 / 200 ) bytes per sec
Bandwidth = 5.12 MBps or 40.96 Mbps
-----------------------------------------------------------------------------------------------------------------------
Q.5: Using stop and wait protocol, sender wants to transmit 10 data packets to the receiver.
Out of these 10 data packets, every 4th data packet is lost. How many packets sender will
have to send in total?
Solution-
Draw a time line diagram and analyze.
The packets will be sent as-
1, 2, 3, 4, 4, 5, 6, 7, 7, 8, 9, 10, 10
The lost packets are- 4, 7 and 10.
Thus, sender will have to send 13 data packets in total.
--------------------------------------------------------------------------------------------------------------------------
Q.6: The values of parameters for the stop and wait ARQ protocol are as given below-
 Bit rate of the transmission channel = 1 Mbps
 Propagation delay from sender to receiver = 0.75 ms
 Time to process a frame = 0.25 ms
 Number of bytes in the information frame = 1980
 Number of bytes in the acknowledge frame = 20
 Number of overhead bytes in the information frame = 20
Assume that there are no transmission errors. Then the transmission efficiency (in %) of the
stop and wait ARQ protocol for the above parameters is . (correct to 2 decimal
places)
Solution-
Given-
 Bandwidth = 1 Mbps
 Propagation delay (Tp) = 0.75 ms
 Processing time (Tprocess) = 0.25 ms
 Data frame size = 1980 bytes
 Acknowledgement frame size = 20 bytes
 Overhead in data frame = 20 bytes
Calculating Useful Time-
Useful data sent = Transmission delay of useful data bytes sent
= Useful data bytes sent / Bandwidth
= (1980 bytes – 20 bytes) / 1 Mbps
= 1960 bytes / 1 Mbps
= (1960 x 8 bits) / (106 bits per sec)
= 15680 μsec
= 15.680 msec
Calculating Total Time-
Total time = Transmission delay of data frame + Propagation delay of data frame
+ Processing delay of data frame + Transmission delay of
acknowledgement + Propagation delay of acknowledgement
= (1980 bytes / 1 Mbps) + 0.75 msec + 0.25 msec + (20 bytes / 1
Mbps) + 0.75 msec
= 15.840 msec + 0.75 msec + 0.25 msec + 0.160 msec + 0.75 msec
= 17.75 msec
Calculating Efficiency-
Efficiency (η) = Useful time / Total time
= 15.680 msec / 17.75 msec
= 0.8833
= 88.33%
Q.7: A 3000 km long trunk operates at 1.536 Mbps and is used to transmit 64 byte frames
and uses sliding window protocol. If the propagation speed is 6 μsec / km, how many bits
should the sequence number field be?
Solution-
Given-
 Distance = 3000 km
 Bandwidth = 1.536 Mbps
 Packet size = 64 bytes
 Propagation speed = 6 μsec / km

= 64 bytes / 1.536 Mbps
= (64 x 8 bits) / (1.536 x 106 bits per sec)
= 333.33 μsec

For 1 km, propagation delay = 6 μsec
For 3000 km, propagation delay = 3000 x 6 μsec = 18000 μsec
Calculating Value Of ‘a’-
a = Tp / Tt
a = 18000 μsec / 333.33 μsec
a = 54
Calculating Bits Required in Sequence Number Field-
Bits required in sequence number field
= ⌈log2(1+2a)⌉
= ⌈log2(1 + 2 x 54)⌉
= ⌈log2(109)⌉
= ⌈6.76⌉
= 7 bits
Thus,
 Minimum number of bits required in sequence number field = 7
 With 7 bits, number of sequence numbers possible = 128
 We use only (1+2a) = 109 sequence numbers and rest remains unused.
Q. 8: Station A uses 32 byte packets to transmit messages to station B using a sliding
window protocol. The round trip delay between A and B is 80 msec and the bottleneck
bandwidth on the path between A and B is 128 Kbps. What is the optimal window size that
A should use?
1. 20
2. 40
3. 160
4. 320
Solution-
Given-
 Packet size = 32 bytes
 Round Trip Time = 80 msec
 Bandwidth = 128 Kbps
Transmission delay (Tt)

= Packet size / Bandwidth
= 32 bytes / 128 Kbps
= (32 x 8 bits) / (128 x 103 bits per sec)
= 2 msec
Propagation delay (Tp)

= Round Trip Time / 2
= 80 msec / 2
= 40 msec
a = Tp / Tt
a = 40 msec / 2 msec
a = 20
Calculating Optimal Window Size-
Optimal window size

= 1 + 2a
= 1 + 2 x 20
= 41 which is close to option (2)
Thus, Option (2) is correct.
--------------------------------------------------------------------------------------------------------------------------
Q.9: A 20 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs the
“go back n ARQ” scheme with n set to 10.
Assuming that each frame is 100 bytes long, what is the maximum data rate possible?
1. 5 Kbps
2. 10 Kbps
3. 15 Kbps
4. 20 Kbps
Solution-
Given-
 Bandwidth = 20 Kbps
 Propagation delay (Tp) = 400 ms
 Frame size = 100 bytes
 Go back N is used where N = 10
Transmission delay (Tt)

= Frame size / Bandwidth
= 100 bytes / 20 Kbps
= (100 x 8 bits) / (20 x 103 bits per sec)
= 0.04 sec
= 40 msec
Calculating Value Of ‘a’-
a = Tp / Tt
a = 400 msec / 40 msec
a = 10
Calculating Efficiency-
Efficiency (η)
= N / (1+2a)
= 10 / (1 + 2 x 10)
= 10 / 21
= 0.476
= 47.6 %
Calculating Maximum Data Rate Possible-
Maximum data rate possible or Throughput

= Efficiency x Bandwidth
= 0.476 x 20 Kbps
= 9.52 Kbps
≅ 10 Kbps
Thus, Correct Option is (2)
Q.10: Station A needs to send a message consisting of 9 packets to station B using a sliding
window (window size 3) and go back n error control strategy. All packets are ready and
immediately available for transmission.
If every 5th packet that A transmits gets lost (but no ACKs from B ever get lost), then what is
the number of packets that A will transmit for sending the message to B?
1. 12
2. 14
3. 16
4. 18
Solution-
Given-
 Total number of packets to be sent = 9
 Go back N is used where N = 3
 Every 5th packet gets lost
Step-01:
Since sender window size is 3, so sender sends 3 packets (1, 2, 3)-
Total packets sent till now from sender side = 3
Step-02:
After receiving the acknowledgement for packet-1, sender slides its window and sends
packet-4.
Step-03:
packet-5.
Step-04:
packet-6.
Step-05:
packet-7.
Step-06:
 According to question, every 5th packet gets lost.

 So, packet-5 gets lost and when time out occurs, sender retransmits packet-5.
 In Go back N, all the following packets are also discarded by the receiver.
 So, packet-6 and packet-7 are discarded by the receiver and they are also retransmitted.
 Thus, the entire window is retransmitted.
So, we have-
Now, the next 5th packet that will be lost will be packet-7. (6, 7, 5, 6, 7)
Step-07:
packet-8.
Step-08:
packet-9.

Step-09:

 So, packet-7 gets lost and when time out occurs, sender retransmits packet-7 and the
following packets.
 Thus, the entire window is retransmitted.
So, we have-
Now, the next 5th packet that will be lost will be packet-9. (8, 9, 7, 8, 9)
Step-10:
After receiving the acknowledgement for packet-7, sender slides its window.
Step-11:
After receiving the acknowledgement for packet-8, sender slides its window.
Step-12:

 So, packet-9 gets lost and when time out occurs, sender retransmits packet-9.
So, we have-
Finally, all the 9 packets got transmitted which took total 16 number of transmissions.
Thus, Correct Option is (3).
--------------------------------------------------------------------------------------------------------------------------
Q.11: In SR protocol, suppose frames through 0 to 4 have been transmitted. Now, imagine
that 0 times out, 5 (a new frame) is transmitted, 1 times out, 2 times out and 6 (another
new frame) is transmitted.
At this point, what will be the outstanding packets in sender’s window?
1. 341526
2. 3405126
3. 0123456
4. 654321
Solution-
In SR Protocol, only the required frame is retransmitted and not the entire window.
Step-01:
Frames through 0 to 4 have been transmitted-

4,3,2,1,0
Step-02:
0 times out. So, sender retransmits it-

0,4,3,2,1
Step-03:
5 (a new frame) is transmitted-

5,0,4,3,2,1
Step-04:

1,5,0,4,3,2
Step-05:

2,1,5,0,4,3
Step-06:
6 (another new frame) is transmitted-

6,2,1,5,0,4,3
-
Q.12: A group of N stations share 100 Kbps slotted ALOHA channel. Each station output a
500 bits frame on an average of 5000 ms even if previous one has not been sent. What is
the required value of N?
Solution-
Throughput Of One Station-
Throughput of each station

= Number of bits sent per second
= 500 bits / 5000 ms
= 500 bits / (5000 x 10-3 sec)
= 100 bits/sec
Throughput Of Slotted Aloha-
Throughput of slotted aloha

= Efficiency x Bandwidth
= 0.368 x 100 Kbps
= 36.8 Kbps
Total Number Of Stations-
Throughput of slotted aloha = Total number of stations x Throughput of each station

Substituting the values, we get-
36.8 Kbps = N x 100 bits/sec
∴ N = 368
Thus, required value of N = 368.
Q.13: For the following IP Addresses-

1. 1.2.3.4
2. 10.15.20.60
3. 130.1.2.3
4. 150.0.150.150
5. 200.1.10.100
6. 220.15.1.10
7. 250.0.1.2
8. 300.1.2.3
Identify the Class, Network IP Address, Direct broadcast address and Limited broadcast
address of each IP Address.
Solution-
Part-A:
Given IP Address is-

1.2.3.4
 IP Address belongs to class A
 Network IP Address = 1.0.0.0
 Direct Broadcast Address = 1.255.255.255
 Limited Broadcast Address = 255.255.255.255
Part-B:

10.15.20.60
 IP Address belongs to class A

Part-C:

130.1.2.3
 IP Address belongs to class B

Part-D:

150.0.150.150
 IP Address belongs to class B

Part-E:

200.1.10.100
 IP Address belongs to class C

Part-F:

220.15.1.10
 IP Address belongs to class C
Part-G:

250.0.1.2
 IP Address belongs to class E

 Network IP Address = Not available
 Direct Broadcast Address = Not available
 Limited Broadcast Address = Not available
Part-H:

300.1.2.3
 This is not a valid IP Address.

 This is because for any given IP Address, the range of its first octet is always [1, 254].
 First and Last IP Addresses are reserved.
Q.14: If the value available in “fragment offset” field of IP header is 100, then the number
of bytes ahead of this fragment is ?
1. 100 B
2. 400 B
3. 800 B
4. 200 B
Solution-
 Fragment offset field use a scaling factor of 8.

 If Fragment offset field value = 100, then fragment offset = 8 x 100 = 800.
 It suggests 800 bytes of data is ahead of this fragment.
 Thus, Option (3) is correct.
---------------------------------------------------------------------------------------------------------------------------
Q.15: Suppose a router receives an IP packet containing 600 data bytes and has to forward
the packet to a network with maximum transmission unit of 200 bytes. Assume that IP
header is 20 bytes long. What are fragment offset values for divided packets?
1. 22, 44, 66, 88
2. 0, 22, 44
3. 0, 22, 44, 66
4. 22, 44, 66
Solution-
Given-
 MTU size of the destination network = 200 bytes
 IP header length = 20
Now,
 Maximum amount of data that can be sent in one fragment = 200 – 20 = 180 bytes.
 Amount of data sent in a fragment must be a multiple of 8.
 So, maximum data sent that can be in one fragment = 176 bytes.
Thus, 4 fragments are created-

 1st fragment contains 176 bytes of data.
 2nd fragment contains 176 bytes of data.
 3rd fragment contains 176 bytes of data.
 4th fragment contains 72 bytes of data
So,
 Fragment offset value for 1st fragment = 0
 Fragment offset value for 2nd fragment = 176 / 8 = 22
 Fragment offset value for 3rd fragment = (176+176) / 8 = 44
 Fragment offset value for 4th fragment = (176 + 176 + 176) / 8 = 66

------------------------------------------------------------------------------------------------------------------------
Q.16: Using Dijkstra’s Algorithm, find the shortest distance from source vertex ‘S’ to
remaining vertices in the following graph-
Also, write the order in which the vertices are visited.
Solution-
Step-01:
The following two sets are created-

 Unvisited set : {S , a , b , c , d , e}
 Visited set : { }
Step-02:
The two variables Π and d are created for each vertex and initialized as-
 Π*S+ = Π*a+ = Π*b+ = Π*c+ = Π*d+ = Π*e+ = NIL
 d[S] = 0
 d[a] = d[b] = d[c] = d[d] = d[e] = ∞
Step-03:
 Vertex ‘S’ is chosen.

 This is because shortest path estimate for vertex ‘S’ is least.
 The outgoing edges of vertex ‘S’ are relaxed.
Before Edge Relaxation-
Now,
 d[S] + 1 = 0 + 1 = 1 < ∞
∴ d[a] = 1 and Π*a+ = S
 d[S] + 5 = 0 + 5 = 5 < ∞
∴ d[b] = 5 and Π*b+ = S
After edge relaxation, our shortest path tree is-

Now, the sets are updated as-
 Unvisited set : {a , b , c , d , e}
 Visited set : {S}
Step-04:
 Vertex ‘a’ is chosen.

 This is because shortest path estimate for vertex ‘a’ is least.
 The outgoing edges of vertex ‘a’ are relaxed.
Now,
 d[a] + 2 = 1 + 2 = 3 < ∞
∴ d[c] = 3 and Π*c+ = a
 d[a] + 1 = 1 + 1 = 2 < ∞
∴ d[d] = 2 and Π*d+ = a
 d[b] + 2 = 1 + 2 = 3 < 5
∴ d[b] = 3 and Π*b+ = a

 Unvisited set : {b , c , d , e}
 Visited set : {S , a}
Step-05:
 Vertex ‘d’ is chosen.

 This is because shortest path estimate for vertex ‘d’ is least.
 The outgoing edges of vertex ‘d’ are relaxed.
Now,
 d[d] + 2 = 2 + 2 = 4 < ∞
∴ d[e] = 4 and Π*e+ = d

 Unvisited set : {b , c , e}
 Visited set : {S , a , d}
Step-06:
 Vertex ‘b’ is chosen.

 This is because shortest path estimate for vertex ‘b’ is least.
 Vertex ‘c’ may also be chosen since for both the vertices, shortest path estimate is least.
 The outgoing edges of vertex ‘b’ are relaxed.
Now,
 d[b] + 2 = 3 + 2 = 5 > 2
∴ No change
After edge relaxation, our shortest path tree remains the same as in Step-05.
 Unvisited set : {c , e}
 Visited set : {S , a , d , b}
Step-07:
 Vertex ‘c’ is chosen.

 This is because shortest path estimate for vertex ‘c’ is least.
 The outgoing edges of vertex ‘c’ are relaxed.
Now,
 d[c] + 1 = 3 + 1 = 4 = 4
∴ No change
After edge relaxation, our shortest path tree remains the same as in Step-05.
 Unvisited set : {e}
 Visited set : {S , a , d , b , c}
Step-08:
 Vertex ‘e’ is chosen.

 This is because shortest path estimate for vertex ‘e’ is least.
 The outgoing edges of vertex ‘e’ are relaxed.
 There are no outgoing edges for vertex ‘e’.
 So, our shortest path tree remains the same as in Step-05.

 Unvisited set : { }
 Visited set : {S , a , d , b , c , e}
Now,
 All vertices of the graph are processed.
 Our final shortest path tree is as shown below.
 It represents the shortest path from source vertex ‘S’ to all other remaining vertices.
The order in which all the vertices are processed is :

S , a , d , b , c , e.
Note: Solve Dijekstra Algorithm and Bellmon Ford Algorithm Problems as Explained in Class
Theory Lectures.
------------------------------------------------ All the Best ---------------------------------------------------------

CN Questions &amp; Solved Numericals

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CN Questions &amp; Solved Numericals

Uploaded by

Copyright:

Available Formats

Communication Network Sem VI

Q.1: IDENTIFY THE FIVE COMPONENTS OF A DATA COMMUNICATION SYSTEM.

Q.1: EXPLAIN STOP AND WAIT FLOW CONTROL.

Q.1: EXPLAIN LEAKY BUCKET ALGORITHM.

Q.1: EXPLAIN USER DATAGRAM PROTOCOL (UDP).

Q.1: EXPLAIN DOMAIN NAME SYSTEM (DNS).

Calculating Transmission Delay-

Propagation delay (Tp) = Round Trip Time / 2

Calculating Link Utilization-

For efficiency to be at least 50%, we must have-

Round Trip Time = Transmission delay

Calculating Transmission Delay-

Calculating Propagation Delay-

Calculating Transmission Delay-

Transmission delay (Tt)

Calculating Propagation Delay-

Propagation delay (Tp)

Calculating Value of ‘a’-

Calculating Optimal Window Size-

Optimal window size

Calculating Transmission Delay-

Transmission delay (Tt)

Calculating Value Of ‘a’-

Calculating Maximum Data Rate Possible-

Maximum data rate possible or Throughput

Since sender window size is 3, so sender sends 3 packets (1, 2, 3)-

Total packets sent till now from sender side = 3

Total packets sent till now from sender side = 4

Total packets sent till now from sender side = 5

Total packets sent till now from sender side = 7

 According to question, every 5th packet gets lost.

Total packets sent till now from sender side = 10

Total packets sent till now from sender side = 11

Total packets sent till now from sender side = 12

 According to question, every 5th packet gets lost.

Total packets sent till now from sender side = 15

Total packets sent till now from sender side = 15

Total packets sent till now from sender side = 15

 According to question, every 5th packet gets lost.

Total packets sent till now from sender side = 16

Frames through 0 to 4 have been transmitted-

0 times out. So, sender retransmits it-

5 (a new frame) is transmitted-

1 times out. So, sender retransmits it-

2 times out. So, sender retransmits it-

6 (another new frame) is transmitted-

Thus, Option (2) is correct.

Throughput Of One Station-

Throughput of each station

Throughput Of Slotted Aloha-

Throughput of slotted aloha

Total Number Of Stations-

Throughput of slotted aloha = Total number of stations x Throughput of each station

Q.13: For the following IP Addresses-

Given IP Address is-

Given IP Address is-

 IP Address belongs to class A

Given IP Address is-

 IP Address belongs to class B

Given IP Address is-

 IP Address belongs to class B

Given IP Address is-

 IP Address belongs to class C

Given IP Address is-

CN Questions & Solved Numericals

CN Questions & Solved Numericals