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 1983 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?
The network 192.168.162.0/24 is split with VLSM for these LANs: A: 96 hosts, B: 23 hosts, C: 60 hosts, D: 11 hosts. Subnets are allocated from .0 upwards, the LAN with the most hosts first, each with the smallest subnet that fits. What is the fourth octet x of the network address of LAN B?
What does ARP do?
By Shannon's theorem, what is the capacity of a 1 MHz channel with a signal-to-noise ratio of 255?
Set the bits so they store −89 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 0100 0010 XOR 0010 1101. What is the result's value R in decimal?
Answer: p = 21
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
VLSM: each LAN gets the smallest subnet with 2ʰ − 2 ≥ its host count, i.e. prefix 32 − h. Allocating the largest subnets first keeps every block aligned on a multiple of its own size, so the network addresses follow by adding up the block sizes.
LAN B: 192.168.162.192/27.
Answer: D · Finds the MAC address that belongs to an IP address on the local network
ARP broadcasts "who has this IP?" and the owner replies with its MAC address, so frames can be delivered locally.
Answer: A · 8 Mbit/s
C = 10⁶ × log₂(256) = 10⁶ × 8 = 8 Mbit/s. This is the upper limit for error-free data rate on a noisy channel.
Answer: U = 167
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 = 111
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.
XOR gives 1 where the two bits differ.
ExamProblems · examproblems.com/courses/computer-networks