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 1790 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?
The network 192.168.7.0/24 is split with VLSM for these LANs: A: 7 hosts, B: 86 hosts, C: 55 hosts, D: 3 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 C?
What characterises a distributed denial-of-service (DDoS) attack?
After repeated collisions, classic Ethernet stations choose their waiting time from a range that doubles each time. Why?
Write −96 as an 8-bit two's complement pattern. Read the pattern as an unsigned binary number: what is its value U in decimal?
Set the bits to the 8-bit result of 1100 0010 XOR 0001 1010. 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 = 128
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 C: 192.168.7.128/26.
Answer: C · Many compromised machines flood a target with traffic
In a DDoS attack many sources overwhelm a server or link so legitimate users cannot be served. The many sources make simple blocking hard.
Answer: D · To lower the chance of colliding again when many stations compete
Each further collision suggests more contention, so the random range grows and stations are more likely to pick different slots. It adapts to load without central control.
Answer: U = 160
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.
Answer: R = 216
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