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 800 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.154.190.0/24, 10.154.191.0/24. What is the longest prefix length p of a single summary route that covers all of them?
Using even parity, which parity bit is added to the data bits 1011001?
Stations A and C both reach access point B but cannot hear each other, so their frames collide at B. How does 802.11 help?
Set the bits so they store −68 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 1001 0001 OR 0100 1110. What is the result's value R in decimal?
Answer: p = 22
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 = 23
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.154.190.0/23
Answer: D · 0
1011001 contains four 1-bits, already an even number, so the parity bit is 0. With odd parity it would be 1.
Answer: C · Optional RTS/CTS exchanges: the AP's CTS tells all nearby stations to wait
A station sends Request to Send; the AP answers Clear to Send, which every station in its range hears, so hidden stations defer for the reserved time.
Answer: U = 188
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