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 8 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?
The network 192.168.180.0/24 is split with VLSM for these LANs: A: 22 hosts, B: 6 hosts, C: 16 hosts, D: 40 hosts, E: 14 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?
A signal travels 2000 km through fibre at about 2 × 10⁸ m/s. What is the propagation delay?
Which routing protocol is a link-state protocol?
Set the bits so they store −54 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 699 items its own binary code of the same length. What is the smallest number of bits b needed?
Answer: H = 30
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 = 96
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.180.96/27.
Answer: C · 10 ms
2 × 10⁶ m / 2 × 10⁸ m/s = 0.01 s = 10 ms. Propagation delay depends on distance and medium, not packet size.
Answer: A · OSPF
OSPF routers build a full map of the area and compute shortest paths with Dijkstra's algorithm. RIP is distance-vector; BGP is path-vector.
Answer: U = 202
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 = 10 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