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 8 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.97.56.0/24, 10.97.57.0/24, 10.97.58.0/24, 10.97.59.0/24, 10.97.60.0/24, 10.97.61.0/24, 10.97.62.0/24, 10.97.63.0/24. What is the longest prefix length p of a single summary route that covers all of them?
How many usable host addresses does a /24 IPv4 network have?
What does the Diffie-Hellman key exchange achieve on its own, and what is its weakness?
Set the bits so they store −91 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 4678 items its own binary code of the same length. What is the smallest number of bits b needed?
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.97.56.0/21
Answer: A · 254
A /24 has 8 host bits, so 2⁸ = 256 addresses. The network and broadcast addresses are reserved, leaving 254 for hosts.
Answer: B · It agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle
Diffie-Hellman lets two parties derive the same secret that eavesdroppers cannot compute. An attacker in the middle can run separate exchanges with each side unless the values are signed or otherwise authenticated.
Answer: U = 165
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 = 13 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