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
255.255.254.011111111111111111111111000000000network bitshost bits

A subnet uses the mask 255.255.254.0. How many usable host addresses H does it have?

255.255.254.0
H =
2.IPv4 subnettingHard
last octet = 95012816403211618141211networkhost

A host has the address 10.20.8.95/29. What is the fourth octet x of its network address?

10.20.8.95/29
x =
3.Computer networksMedium

Why does Wi-Fi use collision avoidance (CSMA/CA) instead of collision detection?

  1. AWi-Fi only allows one device per network
  2. BRadio signals never collide
  3. CCollision detection only works on fibre cables, not on shared wireless radio channels
  4. DA wireless station cannot reliably detect collisions while it is transmitting
4.Computer networksHard

What does the Diffie-Hellman key exchange achieve on its own, and what is its weakness?

  1. AIt authenticates both users with passwords, but needs a central server
  2. BIt encrypts bulk data directly over a public channel, but it is far too slow for large files and video
  3. CIt signs certificates for websites, but only works with short keys
  4. DIt agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle
5.Number systemsMedium
place values in two's complement1−12806403211618140211

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

1001 11018 bit
N =
6.Number systemsHard
16 bit1 px1280 px720 pxM = ? KiB

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

1280 × 720 px16 bit/px1 KiB = 1024 B
M = KiB

3Solutions

1.IPv4 subnetting

Answer: H = 510

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

Prefix length

255.255.254.0 = /23

Usable hosts

29 − 2 = 510

Answer

H = 510
2.IPv4 subnetting

Answer: x = 88

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

23 = 8

Subnet of this host

network: ⌊95/8⌋·8 = 88
broadcast: 88 + 8 − 1 = 95
usable hosts: 89 … 94

Answer

x = 88
3.Computer networks

Answer: D · A wireless station cannot reliably detect collisions while it is transmitting

Why this is the answer

A radio transmitter cannot hear other weak signals while sending, and some stations are hidden from each other. So 802.11 waits random backoff times and uses acknowledgements.

Answer

D · A wireless station cannot reliably detect collisions while it is transmitting
4.Computer networks

Answer: D · It agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle

Why this is the answer

Diffie-Hellman lets two parties derive the same secret that eavesdroppers cannot compute. An attacker in the middle can run separate exchanges with each side unless the values are signed or otherwise authenticated.

Answer

D · It agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle
5.Number systems

Answer: N = −99

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 + 16 + 8 + 4 + 1 = −99

Answer

N = −99
6.Number systems

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

1280·720·16 = 14745600 bit = 1843200 B

Convert to KiB

1843200/1024 = 1800 KiB

Answer

M = 1800 KiB

ExamProblems · examproblems.com/courses/computer-networks