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.255.12811111111111111111111111110000000network bitshost bits

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

255.255.255.128
H =
2.IPv4 subnettingHard
third octet = 215112816403211608141211networkhost

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

172.20.215.121/19
x =
3.Computer networksMedium

HTTP is stateless. How do websites usually keep a user logged in across requests?

  1. AWith cookies holding a session identifier or token
  2. BBy keeping the TCP connection open for days
  3. CBy giving each user a fixed IP address
  4. DBy storing the password in the URL
4.Computer networksHard

A server's private key is stolen a year from now. Which TLS property keeps today's recorded sessions safe?

  1. AUsing a longer domain name
  2. BCompressing the data before encryption
  3. CForward secrecy from ephemeral Diffie-Hellman key exchange
  4. DSending the certificate twice
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

N = −938 bit
U =
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: H = 126

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.255.128 = /25

Usable hosts

27 − 2 = 126

Answer

H = 126
2.IPv4 subnetting

Answer: x = 223

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

25 = 32

Subnet of this host

network: 172.20.192.0
broadcast: 172.20.223.255

Answer

x = 223
3.Computer networks

Answer: A · With cookies holding a session identifier or token

Why this is the answer

The server sets a cookie containing a session ID or token, and the browser returns it with each request so the server can recognise the user.

Answer

A · With cookies holding a session identifier or token
4.Computer networks

Answer: C · Forward secrecy from ephemeral Diffie-Hellman key exchange

Why this is the answer

With ephemeral (EC)DHE, each session key is derived from temporary values that are discarded. The long-term key only signs the exchange, so stealing it later does not decrypt old traffic.

Answer

C · Forward secrecy from ephemeral Diffie-Hellman key exchange
5.Number systems

Answer: U = 163

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

93 = 0101 1101
inverted: 1010 0010
+1 → 1010 0011

Read it as unsigned

1010 0011₂ = 256 − 93 = 163

Answer

U = 163
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