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
/?11111111111111111111111000000000network bitshost bits

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

280 hosts
p =
2.IPv4 subnettingHard
third octet = 178112806413211608041201networkhost

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

172.20.178.84/22
x =
3.Computer networksMedium

Which IPv4 header field stops packets from circulating forever in a routing loop?

  1. AHeader checksum
  2. BTime to live (TTL)
  3. CIdentification
  4. DType of service
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. ADNS needs ICMP to resolve names
  2. BTCP cannot open connections without ICMP
  3. CTLS certificates are sent over ICMP
  4. DPath MTU discovery fails because "fragmentation needed" messages are blocked
5.Number systemsMedium
place values in two's complement1−12816413201608141211

The 8-bit pattern 1110 0111 stores a signed integer in two's complement. What is its value N in decimal?

1110 01118 bit
N =
6.Number systemsHard
8 bit1 px800 px600 pxM = ? KiB

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

800 × 600 px8 bit/px1 KiB = 1024 B
M = KiB

3Solutions

1.IPv4 subnetting

Answer: p = 23

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

28 − 2 = 254 < 280
29 − 2 = 510 ≥ 280 → h = 9

Prefix length

p = 32 − 9 = 23

Answer

p = /23
2.IPv4 subnetting

Answer: x = 179

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

22 = 4

Subnet of this host

network: 172.20.176.0
broadcast: 172.20.179.255

Answer

x = 179
3.Computer networks

Answer: B · Time to live (TTL)

Why this is the answer

Every router decrements the TTL; at zero the packet is discarded and an ICMP Time Exceeded message is usually sent. IPv6 calls it hop limit.

Answer

B · Time to live (TTL)
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: N = −25

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.

Add the place values

The other bits keep their normal positive values.

−128 + 64 + 32 + 4 + 2 + 1 = −25

Answer

N = −25
6.Number systems

Answer: M = 468.8 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

800·600·8 = 3840000 bit = 480000 B

Convert to KiB

480000/1024 = 468.75 KiB

Answer

M = 468.75 KiB

ExamProblems · examproblems.com/courses/computer-networks