VL2024250103369 Da

Download as pdf or txt
Download as pdf or txt
You are on page 1of 7

SLOT – B1+TB1

School of Computer Science Engineering and Information Systems


Fall Semester 2024-2025
Digital Assignment - I
Programme Name & Branch : BTech (IT)
Course Name & code: Computer Networks / BITE305L
Faculty Name(s): Dr C NAVANEETHAN

S. No. Question
1. Suppose there are 170 devices connected together in the hybrid network below.

i. Determine the type of topology used by each network.


ii. Identify the total number of I/O ports required per device in each network.
iii. Identify the total number dedicated links required per device in each network.
iv. Calculate how many I/O ports are required to connect to each network.
v. Calculate how many dedicated links are required to connect to each network.
vi. Calculate how many dedicated links are required to connect to this hybrid
network.
vii. For each of the four networks, discuss the consequences if a connection fails.
For the star topology (don’t take the hub).

2. If a CSMA/CD network that transmits data at a rate of 200-Gbps over a 300-


km(kilometer) cable with no repeaters and the minimum frame size required for this
network is 1000-bits, what is the signal speed (km/sec) in the cable?
3. A 100 km long broadcast LAN has 200-Gbps 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?
4. Consider a system generating 40-bit frames and connected through a shared 80- Gbps
channel. Find throughput in percent if slotted ALOHA is used and frame rate is
2000fps.
5. In CDMA/CD network with a data rate of 100 Mbps, the minimum frame size is found
to be 1024-bits for the correct operation of the collision detection process. What should
be the minimum frame size if we increase the data rate to 100 Kbps? To 100 Mbps? To
100 Gbps?

6. Consider User A wants to communicate the 18-bit dataword “110101010111100101”


to User B. So, User A computes the check bits for the given message and appends the
same to the dataword. Then user A transmits the resulting codeword to User B. During
the transmission, 11th codeword bit has been flipped because of the noise in the
communication channel. Illustrate the procedure that should be followed by user B how
correct the inverted bit by using the check bits.
7. Find the checksum for the following 16-bit segment and suggest is there any error in
this bit sequence.
1111 0011 1001 0011 1001 1000 0100 1111
8. Show how the CRC is computed given the following parameters. Give the bit pattern
for the final transmitted frame including the CRC.
G(x) = x5+x2+x+1
Frame = 1001 1110 0110 1001 1111 0000 1111
Determine whether the received bit string either has or has not been corrupted during
transmission (show basic workings).
9. Figure shows a switch (router) in a datagram network.
Find the output port for packets with the following destination addresses:.
a. Packet 1: 1456
b. Packet 2: 4470
c. Packet 3: 3255
d. Packet 4: 9144

10. Figure shows a switch in a virtual-circuit network.

Find the output port and the output VCI for packets with the following input
port and input VCI addresses:
a. Packet 1: 3, 58
b. Packet 2: 2, 71
c. Packet 3: 4, 56
d. Packet 4: 1, 14
11. A path in a digital circuit-switched network has a data rate of 100 Mbps. The exchange
of 5000-bits is required for the setup and teardown phases. The distance between two
parties is 10000 km. Answer the following questions if the propagation speed is 2 × 108
m/s. What is the total delay if 200000-bits of data are exchanged during the data-
transfer phase?

12. For the following IP Addresses-


a. 100.155.200.60
b. 223.100.100.100
c. 10000001 10000000 00000011 11111111
d. 11110111 11011011 10001011 01101111
Identify the following:
i. Class
ii. Total number of hosts
iii. Network IP Address
iv. Default Subnet mask
v. First Host ID
vi. Last Host ID
vii. Direct broadcast address
viii. Limited broadcast address
13. Given the CIDR representation 200.30.35.1 / 27. Find the following:
i. Total number of hosts
ii. Network IP Address
iii. Default Subnet mask
iv. First Host ID
v. Last Host ID
vi. Range of IP Addresses in the CIDR block

14. Consider a block of IP Addresses ranging from 100.200.20.32 to 100.200.20.47.


i. Is it a CIDR block?
ii. If yes, give the CIDR representation.

15. Assume an organization has the classless address 155.205.36.8/17, then find the
following:
i. The first address
ii. The last address
iii. The total number of addresses
iv. The network address
v. Subnet Mask
vi. Does the address 155.205.15.127 belongs to this address space?

16. Consider the given two address, which have been assigned to two devices. Your task is
to determine if these devices are on the same subnet or different subnets. You can use
the address and mask of each device in order to determine to which subnet each address
belongs.
DeviceA: 222.36.37.30/22
DeviceB: 222.36.28.15/22

17. Suppose a network with IP Address 122.0.0.0 is divided into 4 subnets. Find the
following for each subnet:
i. Total number of hosts per subnet
ii. Subnet Address
iii. First Host ID
iv. Last Host ID
v. Direct Broadcast Address
vi. Limited broadcast address
vii. Subnet mask

18. Cambridge University is about to open a new School with three new departments A, B
and C. The IPv4 address prefix of the new School is 228.132.1.0/27 and it is expecting
each department to have the following number of hosts:
Department A: 50 hosts
Department B: 110 hosts
Department C: 25 hosts
i. The university wishes to allocate a subnet for each department. Give possible
IPv4 subnet masks for each new department.
ii. Later, the School opens a fourth department D with 28 hosts. Provide possible
IPv4 subnet masks to accommodate all four departments.
iii. Finally, the School opens a fifth department E of similar size to B. Provide
possible IPv4 subnet masks to accommodate all five departments.

19. Consider the following network with the indicated link cost. Use Dijkstra's shortest
path algorithm to compute the shortest path from the source node 0 to the destination
node 4.
20. In the following topology, assume all the links are bidirectional and the cost is the same
for both directions.

Use the Bellman Ford algorithm to find the lowest cost paths. For the network given in
figure, give global distance-vector tables when
i. Each node knows only the distance to its immediate neighbours.
ii. Each node has reported the information it had in the preceding step to its
immediate neighbours.
iii. Step (ii) happens a second time.

21. For the given sequence, using sliding window flow control draw the sliding windows
of size 7 between the sender A and receiver B,
a. Frames 0, 1 and 2 are sent; frames 0 through 2 are acknowledged.
b. Frame 3 is sent; frame 3 is acknowledged.
c. Frames 4 and 5 are sent; frames 4 and 5 are acknowledged.
d. Frames 6, 7, 0 and 1 are sent; frames 6 through 1 are acknowledged.
e. Frames 2, 3, 4 and 5 are sent; frames 2 through 5 are acknowledged.

You might also like