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 1757 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?
The network 192.168.67.0/24 is split with VLSM for these LANs: A: 13 hosts, B: 29 hosts, C: 3 hosts, D: 26 hosts, E: 62 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?
How many usable host addresses does a /26 IPv4 subnet have?
Which routing protocol is a link-state protocol?
Write −11 as an 8-bit two's complement pattern. Read the pattern as an unsigned binary number: what is its value U in decimal?
Set the bits to the 8-bit result of 1100 0110 << 2. What is the result's value R in decimal?
Answer: p = 21
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 = 64
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.67.64/27.
Answer: A · 62
A /26 has 6 host bits: 2⁶ = 64 addresses, minus the network and broadcast addresses, gives 62 usable hosts.
Answer: A · 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: U = 245
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.
Answer: R = 24
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.
Shifting left by 2 moves every bit 2 places to the left; bits that fall off the left end are lost and zeros come in on the right.
ExamProblems · examproblems.com/courses/computer-networks