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 department needs 108 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?
A router has routes to these networks: 10.15.89.0/24, 10.15.90.0/24, 10.15.91.0/24, 10.15.92.0/24, 10.15.93.0/24, 10.15.94.0/24. What is the longest prefix length p of a single summary route that covers all of them?
At which OSI layer does a switch normally operate?
Why was the TCP window scale option introduced?
Write −87 as an 8-bit two's complement pattern. Read the pattern as an unsigned binary number: what is its value U in decimal?
Set the bits to the 8-bit result of 0101 0000 >> 3. What is the result's value R in decimal?
Answer: p = 25
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.15.88.0/21 (it also covers 2 network(s) that are not in the list).
Answer: A · Data link (layer 2)
A standard switch learns MAC addresses and forwards frames at layer 2. Layer 3 switches also route.
Answer: C · The 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths
The original header allows at most 65,535 bytes of unacknowledged data. Window scaling multiplies this by a power of two so high bandwidth-delay paths can be filled.
Answer: U = 169
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.
Answer: R = 10
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 right by 3 moves every bit 3 places to the right; bits that fall off the right end are lost and zeros come in on the left.
ExamProblems · examproblems.com/courses/computer-networks