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 1444 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?
A router has routes to these networks: 10.130.158.0/24, 10.130.159.0/24, 10.130.160.0/24, 10.130.161.0/24. What is the longest prefix length p of a single summary route that covers all of them?
TLS provides which security properties for HTTPS?
Why was the TCP window scale option introduced?
Set the bits so they store −50 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 1010 0000 >> 1. 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: p = 18
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.130.128.0/18 (it also covers 60 network(s) that are not in the list).
Answer: C · Confidentiality, integrity and server authentication
TLS encrypts traffic, detects tampering and authenticates the server with certificates (optionally the client too).
Answer: A · The 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths
The original header allows at most 65,535 bytes of unacknowledged data. Window scaling multiplies this by a power of two so high bandwidth-delay paths can be filled.
Answer: U = 206
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 = 80
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 1 moves every bit 1 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