Computer Networks: cram pack

Formula sheets, the key method steps for every topic and 6 practice problems, with full solutions at the back.

New problemsBack to the course

In the print window, choose “Save as PDF” to keep a copy on your device.

1Formulas and methods

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

Number systems

Place values
binary 2k, octal 8k, hex 16k
To decimal
Σ dk·bk
From decimal
divide by the base, read the remainders bottom-up
Hex ↔ binary
one hex digit = 4 bits
Two’s complement
invert the bits and add 1

2Practice problems

1.IPv4 subnettingMedium
/?11111111111111111111100000000000network bitshost bits

A department needs 1916 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?

1916 hosts
p =
2.IPv4 subnettingHard
third octet = 158112806403211618141201networkhost

A host has the address 172.20.158.185/23. What is the third octet x of its subnet's broadcast address?

172.20.158.185/23
x =
3.Computer networksMedium

A router has routes for 10.0.0.0/8 and 10.1.0.0/16. Which route does it use for a packet to 10.1.5.5?

  1. ABoth routes, splitting the traffic equally
  2. B10.0.0.0/8, because it was added first
  3. C10.0.0.0/8, because it covers more addresses than the /16
  4. D10.1.0.0/16, because it is the longest matching prefix
4.Computer networksHard

A firewall blocks all ICMP. Small web requests work, but large downloads over some paths hang. What is the likely cause?

  1. ATLS certificates are sent over ICMP
  2. BDNS needs ICMP to resolve names
  3. CTCP cannot open connections without ICMP
  4. DPath MTU discovery fails because "fragmentation needed" messages are blocked
5.Number systemsMedium
8-bit two's complement?−128?64?32?16?8?4?2?1

Write −23 as an 8-bit two's complement pattern. Read the pattern as an unsigned binary number: what is its value U in decimal?

N = −238 bit
U =
6.Number systemsHard
32 bit1 px256 px256 pxM = ? KiB

An uncompressed image is 256 × 256 pixels with 32 bits per pixel. How much memory M does it take, in KiB (1 KiB = 1024 bytes)?

256 × 256 px32 bit/px1 KiB = 1024 B
M = KiB

3Solutions

1.IPv4 subnetting

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).

Host bits needed

210 − 2 = 1022 < 1916
211 − 2 = 2046 ≥ 1916 → h = 11

Prefix length

p = 32 − 11 = 21

Answer

p = /21
2.IPv4 subnetting

Answer: x = 159

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).

Block size in the third octet

21 = 2

Subnet of this host

network: 172.20.158.0
broadcast: 172.20.159.255

Answer

x = 159
3.Computer networks

Answer: D · 10.1.0.0/16, because it is the longest matching prefix

Why this is the answer

IP forwarding uses longest prefix match: among all routes that match the destination, the one with the longest mask is chosen.

Answer

D · 10.1.0.0/16, because it is the longest matching prefix
4.Computer networks

Answer: D · Path MTU discovery fails because "fragmentation needed" messages are blocked

Why this is the answer

PMTUD relies on ICMP messages to learn the smaller MTU. If they are dropped, large packets vanish silently, creating a "black hole" connection.

Answer

D · Path MTU discovery fails because "fragmentation needed" messages are blocked
5.Number systems

Answer: U = 233

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.

Invert and add one

23 = 0001 0111
inverted: 1110 1000
+1 → 1110 1001

Read it as unsigned

1110 1001₂ = 256 − 23 = 233

Answer

U = 233
6.Number systems

Answer: M = 256 KiB

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.

Bits and bytes

256·256·32 = 2097152 bit = 262144 B

Convert to KiB

262144/1024 = 256 KiB

Answer

M = 256 KiB

ExamProblems · examproblems.com/courses/computer-networks