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 606 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?
The network 192.168.24.0/24 is split with VLSM for these LANs: A: 84 hosts, B: 5 hosts, C: 11 hosts, D: 36 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 C?
A router has routes for 10.0.0.0/8 and 10.1.0.0/16. Which route does it use for a packet to 10.1.5.5?
Which routing protocol is a link-state protocol?
The 8-bit pattern 1010 0001 stores a signed integer in two's complement. What is its value N in decimal?
What is the most negative integer N that can be stored in 12-bit two's complement?
Answer: p = 22
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 = 192
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 C: 192.168.24.192/28.
Answer: B · 10.1.0.0/16, because it is the longest matching prefix
IP forwarding uses longest prefix match: among all routes that match the destination, the one with the longest mask is chosen.
Answer: C · OSPF
OSPF routers build a full map of the area and compute shortest paths with Dijkstra's algorithm. RIP is distance-vector; BGP is path-vector.
Answer: N = −95
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: N = −2048
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