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

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

192.168.10.0/246 subnets
H =
2.IPv4 subnettingHard
third octet 31 … 38012806403211618141211commonvaries

A router has routes to these networks: 10.112.31.0/24, 10.112.32.0/24, 10.112.33.0/24, 10.112.34.0/24, 10.112.35.0/24, 10.112.36.0/24, 10.112.37.0/24, 10.112.38.0/24. What is the longest prefix length p of a single summary route that covers all of them?

10.112.31.0/24 … 10.112.38.0/24
p =
3.Computer networksMedium

What does an MX record in DNS specify?

  1. AThe IPv4 address of a web server
  2. BThe mail servers that accept email for a domain
  3. CAn alias name for another host
  4. DThe name servers for a zone
4.Computer networksHard

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

  1. AForward secrecy from ephemeral Diffie-Hellman key exchange
  2. BCompressing the data before encryption
  3. CSending the certificate twice
  4. DUsing a longer domain name
5.Number systemsMedium
place values in two's complement1−12816403201608141201

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

1100 01108 bit
N =
6.Number systemsHard
click the bits to set them012806403201608040201

Set the bits to the 8-bit result of 1101 0010 AND 0111 1010. What is the result's value R in decimal?

1101 0010AND0111 1010
R =

3Solutions

1.IPv4 subnetting

Answer: H = 30

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

23 = 8 ≥ 6 → b = 3, /27

Hosts per subnet

25 − 2 = 30

Answer

H = 30
2.IPv4 subnetting

Answer: p = 18

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

31 = 00011111
38 = 00100110
common leading bits: 2

Prefix length

p = 16 + 2 = 18

Answer

p = /18

Summary route: 10.112.0.0/18 (it also covers 56 network(s) that are not in the list).

3.Computer networks

Answer: B · The mail servers that accept email for a domain

Why this is the answer

MX (mail exchange) records list mail servers with priorities, so sending servers know where to deliver mail for that domain.

Answer

B · The mail servers that accept email for a domain
4.Computer networks

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

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

Answer: N = −58

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 + 64 + 4 + 2 = −58

Answer

N = −58
6.Number systems

Answer: R = 82

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.

Bit by bit

AND gives 1 only where both bits are 1.

1101 0010
AND 0111 1010
= 0101 0010

Value of the result

0101 0010₂ = 82

Answer

R = 82

ExamProblems · examproblems.com/courses/computer-networks