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.255.192. How many usable host addresses H does it have?
A router has routes to these networks: 10.172.138.0/24, 10.172.139.0/24, 10.172.140.0/24, 10.172.141.0/24, 10.172.142.0/24, 10.172.143.0/24, 10.172.144.0/24, 10.172.145.0/24. What is the longest prefix length p of a single summary route that covers all of them?
What is the usual order of messages when a client obtains an address from DHCP?
By the Nyquist formula, what is the maximum bit rate of a noiseless 3 kHz channel using 4 signal levels?
The 8-bit pattern 0000 0011 stores a signed integer in two's complement. What is its value N in decimal?
What is the most negative integer N that can be stored in 12-bit two's complement?
Answer: H = 62
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 = 19
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.172.128.0/19 (it also covers 24 network(s) that are not in the list).
Answer: B · Discover, Offer, Request, Acknowledge
The client broadcasts Discover, servers reply with Offers, the client Requests one offer and the chosen server confirms with an Acknowledge.
Answer: B · 12 kbit/s
2 × 3000 × log₂ 4 = 2 × 3000 × 2 = 12,000 bit/s. More levels raise the rate, but noise limits how many can be told apart.
Answer: N = 3
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.
The other bits keep their normal positive values.
Answer: N = −2048
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