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.240.0. How many usable host addresses H does it have?
A host has the address 10.20.212.94/27. What is the last number (fourth octet) x of its subnet's broadcast address?
How long does it take to put a 1500-byte packet onto a 12 Mbit/s link (transmission delay)?
What does the Diffie-Hellman key exchange achieve on its own, and what is its weakness?
The 8-bit pattern 0110 0011 stores a signed integer in two's complement. What is its value N in decimal?
A system must give every one of 2660 items its own binary code of the same length. What is the smallest number of bits b needed?
Answer: H = 4094
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 = 95
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: D · 1 ms
1500 bytes = 12,000 bits. 12,000 / 12,000,000 bit/s = 0.001 s = 1 ms. Transmission delay depends on packet size and link rate, not distance.
Answer: D · It agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle
Diffie-Hellman lets two parties derive the same secret that eavesdroppers cannot compute. An attacker in the middle can run separate exchanges with each side unless the values are signed or otherwise authenticated.
Answer: N = 99
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: b = 12 bit
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