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 10.122.175.0/24 is divided into equal subnets with prefix /27. How many subnets N are there?
A router has routes to these networks: 10.107.113.0/24, 10.107.114.0/24, 10.107.115.0/24, 10.107.116.0/24, 10.107.117.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 does TCP choose an unpredictable initial sequence number for each connection?
Set the bits so they store −32 in 8-bit two's complement. Read as an unsigned number, what is the pattern's value U?
A system must give every one of 1499 items its own binary code of the same length. What is the smallest number of bits b needed?
Answer: N = 8
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).
Each /27 subnet has 25 − 2 = 30 usable hosts.
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.107.112.0/21 (it also covers 3 network(s) that are not in the list).
Answer: B · Confidentiality, integrity and server authentication
TLS encrypts traffic, detects tampering and authenticates the server with certificates (optionally the client too).
Answer: B · To avoid confusion with old segments and make spoofed segments harder to inject
Random initial sequence numbers stop delayed segments from old connections being accepted and make it hard for off-path attackers to forge valid segments.
Answer: U = 224
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: b = 11 bit
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