IPv4 subnetting
- Hosts per subnet
- 2(32 − prefix) − 2 (/31: 2, /32: 1)
- Block size
- 256 − (mask octet)
- Network address
- IP AND mask
- Broadcast address
- IP OR (NOT mask): all host bits set to 1
- Subnets from n borrowed bits
- 2n
Formula sheets, the key method steps for every topic and 6 practice problems, with full solutions at the back.
The network 192.168.10.0/24 must be divided into at least 20 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?
A router has routes to these networks: 10.246.124.0/24, 10.246.125.0/24, 10.246.126.0/24, 10.246.127.0/24, 10.246.128.0/24, 10.246.129.0/24. What is the longest prefix length p of a single summary route that covers all of them?
A signal travels 2000 km through fibre at about 2 × 10⁸ m/s. What is the propagation delay?
Why does the side that closes a TCP connection first stay in the TIME_WAIT state for twice the maximum segment lifetime?
The 8-bit pattern 1000 0010 stores a signed integer in two's complement. What is its value N in decimal?
What is the largest unsigned integer N that fits in 12 bits?
Answer: H = 6
IPv4 subnetting: an address has 32 bits. The prefix /p says how many leading bits identify the network; the remaining 32 − p bits number the hosts. A subnet has 2³²⁻ᵖ addresses, but the first (network address) and last (broadcast address) cannot be given to hosts, so 2³²⁻ᵖ − 2 hosts fit. Exceptions: a /31 (point-to-point link, RFC 3021) uses both of its 2 addresses for hosts, and a /32 is one single address (a single host or a loopback).
Answer: p = 16
Route summarisation: a summary route a.b.c.0/p covers all networks whose first p bits match. Write the differing octet of the first and last network in binary; the number of common leading bits, plus the bits of the octets before it, is the longest summary prefix.
Summary route: 10.246.0.0/16 (it also covers 250 network(s) that are not in the list).
Answer: A · 10 ms
2 × 10⁶ m / 2 × 10⁸ m/s = 0.01 s = 10 ms. Propagation delay depends on distance and medium, not packet size.
Answer: A · So delayed segments die out and the final ACK can be resent if it was lost
TIME_WAIT ensures a lost final ACK can be repeated and old duplicate segments expire before the same address and port pair is reused.
Answer: N = −126
Positional number systems: each digit is worth its value times a power of the base. In binary the places are worth 1, 2, 4, 8, 16, …; in hexadecimal 1, 16, 256, …, with A–F standing for 10–15. In 8-bit two's complement the leftmost bit is worth −128 instead of +128, which is how negative numbers are stored.
The other bits keep their normal positive values.
Answer: N = 4095
Positional number systems: each digit is worth its value times a power of the base. In binary the places are worth 1, 2, 4, 8, 16, …; in hexadecimal 1, 16, 256, …, with A–F standing for 10–15. In 8-bit two's complement the leftmost bit is worth −128 instead of +128, which is how negative numbers are stored.
ExamProblems · examproblems.com/courses/computer-networks