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.10.192.0/20 is divided into equal subnets with prefix /26. How many subnets N are there?
A router has routes to these networks: 10.140.232.0/24, 10.140.233.0/24, 10.140.234.0/24, 10.140.235.0/24. What is the longest prefix length p of a single summary route that covers all of them?
Which of these is a private IPv4 address range?
By Shannon's theorem, what is the capacity of a 1 MHz channel with a signal-to-noise ratio of 255?
The 8-bit pattern 1011 1100 stores a signed integer in two's complement. What is its value N in decimal?
An uncompressed image is 1280 × 720 pixels with 24 bits per pixel. How much memory M does it take, in KiB (1 KiB = 1024 bytes)?
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 = 22
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.140.232.0/22
Answer: A · 192.168.0.0/16
Private ranges are 10.0.0.0/8, 172.16.0.0/12 and 192.168.0.0/16; they are not routed on the public internet.
Answer: B · 8 Mbit/s
C = 10⁶ × log₂(256) = 10⁶ × 8 = 8 Mbit/s. This is the upper limit for error-free data rate on a noisy channel.
Answer: N = −68
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: M = 2700 KiB
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