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.
A subnet uses the mask 255.255.255.252. How many usable host addresses H does it have?
The network 192.168.21.0/24 is split with VLSM for these LANs: A: 24 hosts, B: 126 hosts, C: 3 hosts, D: 28 hosts. Subnets are allocated from .0 upwards, the LAN with the most hosts first, each with the smallest subnet that fits. What is the fourth octet x of the network address of LAN D?
A signal travels 2000 km through fibre at about 2 × 10⁸ m/s. What is the propagation delay?
What is the main benefit of persistent connections (keep-alive) in HTTP/1.1?
Set the bits so they store −49 in 8-bit two's complement. Read as an unsigned number, what is the pattern's value U?
Set the bits to the 8-bit result of 1001 0110 XOR 0010 1001. What is the result's value R in decimal?
Answer: H = 2
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: x = 128
VLSM: each LAN gets the smallest subnet with 2ʰ − 2 ≥ its host count, i.e. prefix 32 − h. Allocating the largest subnets first keeps every block aligned on a multiple of its own size, so the network addresses follow by adding up the block sizes.
LAN D: 192.168.21.128/27.
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: D · Several requests reuse one TCP connection, avoiding repeated handshakes
Reusing a connection avoids a new handshake and slow start for each object, so pages with many resources load faster.
Answer: U = 207
Setting bits: each bit is worth a power of two (128, 64, …, 1). One hex digit is exactly four bits, and in 8-bit two's complement the leftmost bit is worth −128. Bitwise operations work on each bit position separately.
Answer: R = 191
Setting bits: each bit is worth a power of two (128, 64, …, 1). One hex digit is exactly four bits, and in 8-bit two's complement the leftmost bit is worth −128. Bitwise operations work on each bit position separately.
XOR gives 1 where the two bits differ.
ExamProblems · examproblems.com/courses/computer-networks