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 subnet uses the mask 255.255.240.0. How many usable host addresses H does it have?
The network 192.168.24.0/24 is split with VLSM for these LANs: A: 27 hosts, B: 5 hosts, C: 26 hosts, D: 11 hosts, E: 51 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?
Why does Wi-Fi use collision avoidance (CSMA/CA) instead of collision detection?
A remote-terminal application feels sluggish because small keystroke packets are held back. Which TCP mechanism is often responsible?
Write −8 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 1000 1101 >> 2. What is the result's value R in decimal?
Answer: H = 4094
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 = 144
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.24.144/29.
Answer: A · 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: B · 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 = 248
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 = 35
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 right by 2 moves every bit 2 places to the right; bits that fall off the right end are lost and zeros come in on the left.
ExamProblems · examproblems.com/courses/computer-networks