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 3 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.158.44/25. What is the fourth octet x of the last usable host address in its subnet?
What does ARP do?
A remote-terminal application feels sluggish because small keystroke packets are held back. Which TCP mechanism is often responsible?
Set the bits so they store −63 in 8-bit two's complement. Read as an unsigned number, what is the pattern's value U?
What is the largest unsigned integer N that fits in 32 bits?
Answer: H = 62
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 = 126
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 · Finds the MAC address that belongs to an IP address on the local network
ARP broadcasts "who has this IP?" and the owner replies with its MAC address, so frames can be delivered locally.
Answer: C · Nagle's algorithm
Nagle's algorithm waits to bundle small segments while earlier data is unacknowledged. This saves bandwidth but adds delay for interactive traffic.
Answer: U = 193
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: N = 4.295 × 10⁹
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