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 153 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?
The network 192.168.130.0/24 is split with VLSM for these LANs: A: 16 hosts, B: 11 hosts, C: 59 hosts, D: 39 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 B?
A signal travels 2000 km through fibre at about 2 × 10⁸ m/s. What is the propagation delay?
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 1010 0111 stores a signed integer in two's complement. What is its value N in decimal?
An uncompressed image is 512 × 512 pixels with 16 bits per pixel. How much memory M does it take, in KiB (1 KiB = 1024 bytes)?
Answer: p = 24
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 = 160
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 B: 192.168.130.160/28.
Answer: B · 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: A · 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 = −89
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 = 512 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