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 12 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.227.226.0/24, 10.227.227.0/24, 10.227.228.0/24, 10.227.229.0/24, 10.227.230.0/24, 10.227.231.0/24, 10.227.232.0/24. What is the longest prefix length p of a single summary route that covers all of them?
What is the purpose of the TCP three-way handshake?
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 −92 in 8-bit two's complement. Read as an unsigned number, what is the pattern's value U?
Set the bits to the 8-bit result of 1000 1100 OR 1101 1011. What is the result's value R in decimal?
Answer: H = 14
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 = 20
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.227.224.0/20 (it also covers 9 network(s) that are not in the list).
Answer: D · To establish a connection and synchronise sequence numbers
The handshake sets up a connection and agrees initial sequence numbers on both sides before data is sent.
Answer: D · 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 = 164
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: R = 223
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.
OR gives 1 where at least one bit is 1.
ExamProblems · examproblems.com/courses/computer-networks