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 30 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?
A host has the address 172.20.196.177/20. What is the third octet x of its network address?
How does TLS typically use asymmetric and symmetric cryptography?
A TCP connection has a 64 KB window and a 100 ms round-trip time, and no window scaling. What is its approximate maximum throughput?
Set the bits so they store −64 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 1111 1010 OR 0111 0001. What is the result's value R in decimal?
Answer: H = 6
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: x = 192
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: C · Asymmetric methods agree keys and authenticate; symmetric ciphers encrypt the data
Public-key methods and certificates set up a shared secret and prove identity. Fast symmetric ciphers such as AES then protect the bulk data.
Answer: D · About 5 Mbit/s
Throughput ≤ window / RTT = 65,536 × 8 bits / 0.1 s ≈ 5.2 Mbit/s, however fast the link is.
Answer: U = 192
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 = 251
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