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 6 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?
A router has routes to these networks: 10.235.195.0/24, 10.235.196.0/24. What is the longest prefix length p of a single summary route that covers all of them?
Why does Wi-Fi use collision avoidance (CSMA/CA) instead of collision detection?
What does TCP fast retransmit do?
The 8-bit pattern 1001 1110 stores a signed integer in two's complement. What is its value N in decimal?
An uncompressed image is 800 × 600 pixels with 16 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: p = 21
Route summarisation: a summary route a.b.c.0/p covers all networks whose first p bits match. Write the differing octet of the first and last network in binary; the number of common leading bits, plus the bits of the octets before it, is the longest summary prefix.
Summary route: 10.235.192.0/21 (it also covers 6 network(s) that are not in the list).
Answer: C · A wireless station cannot reliably detect collisions while it is transmitting
A radio transmitter cannot hear other weak signals while sending, and some stations are hidden from each other. So 802.11 waits random backoff times and uses acknowledgements.
Answer: C · Resends a segment after three duplicate ACKs, without waiting for the timeout
Three duplicate ACKs strongly suggest a single lost segment, so TCP retransmits it at once. This recovers much faster than waiting for the retransmission timer.
Answer: N = −98
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: M = 937.5 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