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

1509 hosts
p =
2.IPv4 subnettingHard
third octet = 27012806403211618041211networkhost

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

172.20.27.40/21
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

After repeated collisions, classic Ethernet stations choose their waiting time from a range that doubles each time. Why?

  1. ATo give the station with the highest MAC address priority on the shared cable
  2. BTo make the cable carry signals further
  3. CTo lower the chance of colliding again when many stations compete
  4. DTo synchronise all stations to one clock
5.Number systemsMedium
place values in two's complement0−12806413201618140201

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

0010 11008 bit
N =
6.Number systemsHard
16 bit1 px640 px480 pxM = ? KiB

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

640 × 480 px16 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 < 1509
211 − 2 = 2046 ≥ 1509 → 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 in the third octet

23 = 8

Subnet of this host

network: 172.20.24.0
broadcast: 172.20.31.255

Answer

x = 31
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: C · To lower the chance of colliding again when many stations compete

Why this is the answer

Each further collision suggests more contention, so the random range grows and stations are more likely to pick different slots. It adapts to load without central control.

Answer

C · To lower the chance of colliding again when many stations compete
5.Number systems

Answer: N = 44

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.

32 + 8 + 4 = 44

Answer

N = 44
6.Number systems

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

640·480·16 = 4915200 bit = 614400 B

Convert to KiB

614400/1024 = 600 KiB

Answer

M = 600 KiB

ExamProblems · examproblems.com/courses/computer-networks