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.248.0. How many usable host addresses H does it have?
A router has routes to these networks: 10.91.32.0/24, 10.91.33.0/24, 10.91.34.0/24, 10.91.35.0/24, 10.91.36.0/24, 10.91.37.0/24, 10.91.38.0/24. What is the longest prefix length p of a single summary route that covers all of them?
Using even parity, which parity bit is added to the data bits 1011001?
A TCP connection has a 64 KB window and a 100 ms round-trip time, and no window scaling. What is its approximate maximum throughput?
The 8-bit pattern 0100 0101 stores a signed integer in two's complement. What is its value N in decimal?
Set the bits to the 8-bit result of 0001 0100 XOR 1001 0101. What is the result's value R in decimal?
Answer: H = 2046
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 = 21
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.91.32.0/21 (it also covers 1 network(s) that are not in the list).
Answer: C · 0
1011001 contains four 1-bits, already an even number, so the parity bit is 0. With odd parity it would be 1.
Answer: B · About 5 Mbit/s
Throughput ≤ window / RTT = 65,536 × 8 bits / 0.1 s ≈ 5.2 Mbit/s, however fast the link is.
Answer: N = 69
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: R = 129
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