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
/24 → /2611111111111111111111111111000000network bitshost bits

The network 192.168.10.0/24 must be divided into at least 3 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?

192.168.10.0/243 subnets
H =
2.IPv4 subnettingHard
third octet 198 … 202112816403201608141201commonvaries

A router has routes to these networks: 10.31.198.0/24, 10.31.199.0/24, 10.31.200.0/24, 10.31.201.0/24, 10.31.202.0/24. What is the longest prefix length p of a single summary route that covers all of them?

10.31.198.0/24 … 10.31.202.0/24
p =
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. A10.1.0.0/16, because it is the longest matching prefix
  2. B10.0.0.0/8, because it covers more addresses than the /16
  3. C10.0.0.0/8, because it was added first
  4. DBoth routes, splitting the traffic equally
4.Computer networksHard

A TCP connection has a 64 KB window and a 100 ms round-trip time, and no window scaling. What is its approximate maximum throughput?

  1. AAbout 0.5 Mbit/s
  2. BAbout 50 Mbit/s
  3. CAbout 5 Mbit/s
  4. DAbout 640 Mbit/s
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

Set the bits so they store −21 in 8-bit two's complement. Read as an unsigned number, what is the pattern's value U?

N = −218 bit
U =
6.Number systemsHard
24 bit1 px1024 px768 pxM = ? KiB

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

1024 × 768 px24 bit/px1 KiB = 1024 B
M = KiB

3Solutions

1.IPv4 subnetting

Answer: H = 62

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

Bits to borrow

22 = 4 ≥ 3 → b = 2, /26

Hosts per subnet

26 − 2 = 62

Answer

H = 62
2.IPv4 subnetting

Answer: p = 20

Route summarisation: a summary route a.b.c.0/p covers all networks whose first p bits match. Write the differing octet of the first and last network in binary; the number of common leading bits, plus the bits of the octets before it, is the longest summary prefix.

Compare the bits

198 = 11000110
202 = 11001010
common leading bits: 4

Prefix length

p = 16 + 4 = 20

Answer

p = /20

Summary route: 10.31.192.0/20 (it also covers 11 network(s) that are not in the list).

3.Computer networks

Answer: A · 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

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

Answer: C · About 5 Mbit/s

Why this is the answer

Throughput ≤ window / RTT = 65,536 × 8 bits / 0.1 s ≈ 5.2 Mbit/s, however fast the link is.

Answer

C · About 5 Mbit/s
5.Number systems

Answer: U = 235

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.

Invert and add one

21 = 0001 0101
inverted: 1110 1010
+1 → 1110 1011

Read it as unsigned

1110 1011₂ = 256 − 21 = 235

Answer

U = 235
6.Number systems

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

1024·768·24 = 18874368 bit = 2359296 B

Convert to KiB

2359296/1024 = 2304 KiB

Answer

M = 2304 KiB

ExamProblems · examproblems.com/courses/computer-networks