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 192.168.10.0/24 must be divided into at least 8 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?
A host has the address 10.20.131.143/25. What is the fourth octet x of its network address?
Using even parity, which parity bit is added to the data bits 1011001?
A server's private key is stolen a year from now. Which TLS property keeps today's recorded sessions safe?
Set the bits so they store −13 in 8-bit two's complement. Read as an unsigned number, what is the pattern's value U?
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: H = 30
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 = 128
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: C · 0
1011001 contains four 1-bits, already an even number, so the parity bit is 0. With odd parity it would be 1.
Answer: A · Forward secrecy from ephemeral Diffie-Hellman key exchange
With ephemeral (EC)DHE, each session key is derived from temporary values that are discarded. The long-term key only signs the exchange, so stealing it later does not decrypt old traffic.
Answer: U = 243
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.
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