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

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

192.168.10.0/244 subnets
H =
2.IPv4 subnettingHard
third octet = 218112816403211618041201networkhost

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

172.20.218.16/20
x =
3.Computer networksMedium

TLS provides which security properties for HTTPS?

  1. AProtection against all malware and phishing on the visited site
  2. BOnly faster loading
  3. CAnonymity of the user
  4. DConfidentiality, integrity and server authentication
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. CUsing a longer domain name
  4. DSending the certificate twice
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

N = −1028 bit
U =
6.Number systemsHard
4946 codes, b = ? bits?2ᵇ⁻¹…?4?2?1

A system must give every one of 4946 items its own binary code of the same length. What is the smallest number of bits b needed?

4946
b = bit

3Solutions

1.IPv4 subnetting

Answer: H = 62

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

22 = 4 ≥ 4 → b = 2, /26

Hosts per subnet

26 − 2 = 62

Answer

H = 62
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

24 = 16

Subnet of this host

network: 172.20.208.0
broadcast: 172.20.223.255

Answer

x = 223
3.Computer networks

Answer: D · Confidentiality, integrity and server authentication

Why this is the answer

TLS encrypts traffic, detects tampering and authenticates the server with certificates (optionally the client too).

Answer

D · Confidentiality, integrity and server authentication
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: U = 154

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

102 = 0110 0110
inverted: 1001 1001
+1 → 1001 1010

Read it as unsigned

1001 1010₂ = 256 − 102 = 154

Answer

U = 154
6.Number systems

Answer: b = 13 bit

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.

Powers of two

212 = 4096 < 4946
213 = 8192 ≥ 4946

Answer

b = 13

ExamProblems · examproblems.com/courses/computer-networks