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 1935 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?

1935 hosts
p =
2.IPv4 subnettingHard
last octet = 24012806403211618040201networkhost

A host has the address 10.20.220.24/27. What is the last number (fourth octet) x of its subnet's broadcast address?

10.20.220.24/27
x =
3.Computer networksMedium

What is a cyclic redundancy check (CRC) used for in Ethernet frames?

  1. AChoosing the best route
  2. BDetecting transmission errors
  3. CEncrypting the frame
  4. DCorrecting every bit error automatically
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. ATCP cannot open connections without ICMP
  2. BPath MTU discovery fails because "fragmentation needed" messages are blocked
  3. CTLS certificates are sent over ICMP
  4. DDNS needs ICMP to resolve names
5.Number systemsMedium
place values in two's complement1−12806413211608141201

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

1011 01108 bit
N =
6.Number systemsHard
32 bit1 px1920 px1080 pxM = ? KiB

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

1920 × 1080 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 < 1935
211 − 2 = 2046 ≥ 1935 → h = 11

Prefix length

p = 32 − 11 = 21

Answer

p = /21
2.IPv4 subnetting

Answer: x = 31

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

25 = 32

Subnet of this host

network: ⌊24/32⌋·32 = 0
broadcast: 0 + 32 − 1 = 31
usable hosts: 1 … 30

Answer

x = 31
3.Computer networks

Answer: B · Detecting transmission errors

Why this is the answer

The sender computes a CRC over the frame; the receiver recomputes it and discards the frame if they differ. CRC detects errors but does not correct them.

Answer

B · Detecting transmission errors
4.Computer networks

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

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

Answer: N = −74

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 + 32 + 16 + 4 + 2 = −74

Answer

N = −74
6.Number systems

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

1920·1080·32 = 66355200 bit = 8294400 B

Convert to KiB

8294400/1024 = 8100 KiB

Answer

M = 8100 KiB

ExamProblems · examproblems.com/courses/computer-networks