Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Class notes

Computer network important questions

Rating
-
Sold
-
Pages
2
Uploaded on
04-12-2025
Written in
2025/2026

Important questions for mid semester

Institution
Course

Content preview

Assignment 2
1. Sketch the header format of IPv4 datagram with detailed explanation of each field. Highlight
the importance of fragmentation offset and TTL field.

2. What is the difference between Segmentation and fragmentation. An IP packet of size 1600
bytes passes through network segment before it reaches its destination.The header size of
this packet is 30 bytes. The maximum size of an IP packet in intermediate network (MTU) is
1400 bytes. How the IP packet would be fragmented in a router. Find all the information for
each fragment.

3. Consider the effect of using slow start on a line with a 10-msec round-trip time and no
congestion. The receive 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?

4. Suppose a router has built up the routing table shown in Routing Table. The router can
deliver packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3,
or R4. Assume the router does the longest prefix match. Describe what the router does with
a packet addressed to each of the following destinations:
i. 128.96.171.92
ii. 128.96.167.151
iii. 128.96.163.151
iv. 128.96.169.192
v. 128.96.165.121

Routing Table
Subnet Number Subnet Mask Next Hop
128.96.170.0 255.255.254.0 Interface 0
128.96.168.0 255.255.254.0 Interface 1
128.96.166.0 255.255.254.0 R2
128.96.164.0 255.255.252.0 R3
Default R4



5. An ISP is granted the block 80.70.56.0/21. The ISP needs to allocate addresses for two
organizations each with 500 addresses, two organizations each with 250 addresses, and three
organizations each with 50 addresses.
• Find the number and range of addresses in the ISP block.
• Find the range of addresses for each organization and the range of un-allocated
addresses.
• Show the outline of the address distribution and the forwarding table.


6. Use Dijkstra’s algorithm to find the shortest path tree and the forwarding table for node A in
the following Figure.

Written for

Institution
Course

Document information

Uploaded on
December 4, 2025
Number of pages
2
Written in
2025/2026
Type
Class notes
Professor(s)
Unknown
Contains
All classes

Subjects

$8.39
Get access to the full document:

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Get to know the seller
Seller avatar
mitaliyadav

Get to know the seller

Seller avatar
mitaliyadav Kalinga institute of industrial technology
Follow You need to be logged in order to follow users or courses
Sold
-
Member since
5 months
Number of followers
0
Documents
1
Last sold
-

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Recently viewed by you

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions