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.166.0/24 is divided into /27 subnets, numbered 1, 2, 3, … from the lowest address (subnet 1 starts at .0). What is the fourth octet x of the network address of subnet 8?
A router has routes to these networks: 10.252.137.0/24, 10.252.138.0/24, 10.252.139.0/24, 10.252.140.0/24, 10.252.141.0/24, 10.252.142.0/24, 10.252.143.0/24, 10.252.144.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?
Why was the TCP window scale option introduced?
Set the bits so they store −95 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 4571 items its own binary code of the same length. What is the smallest number of bits b needed?
Answer: x = 224
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.252.128.0/19 (it also covers 24 network(s) that are not in the list).
Answer: A · 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 · The 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths
The original header allows at most 65,535 bytes of unacknowledged data. Window scaling multiplies this by a power of two so high bandwidth-delay paths can be filled.
Answer: U = 161
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