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 10.5.224.0/20 is divided into equal subnets with prefix /26. How many subnets N are there?
A router has routes to these networks: 10.214.135.0/24, 10.214.136.0/24, 10.214.137.0/24, 10.214.138.0/24. What is the longest prefix length p of a single summary route that covers all of them?
Which protocol does the "ping" command use?
A remote-terminal application feels sluggish because small keystroke packets are held back. Which TCP mechanism is often responsible?
The 8-bit pattern 1001 1001 stores a signed integer in two's complement. What is its value N in decimal?
Set the bits to the 8-bit result of 0010 1011 << 2. What is the result's value R in decimal?
Answer: N = 64
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).
Each /26 subnet has 26 − 2 = 62 usable hosts.
Answer: p = 20
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.214.128.0/20 (it also covers 12 network(s) that are not in the list).
Answer: A · ICMP
Ping sends ICMP echo requests and measures the time until echo replies return.
Answer: D · Nagle's algorithm
Nagle's algorithm waits to bundle small segments while earlier data is unacknowledged. This saves bandwidth but adds delay for interactive traffic.
Answer: N = −103
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 = 172
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.
Shifting left by 2 moves every bit 2 places to the left; bits that fall off the left end are lost and zeros come in on the right.
ExamProblems · examproblems.com/courses/computer-networks