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

1444 hosts
p =
2.IPv4 subnettingHard
third octet 158 … 161112806403211618141201commonvaries

A router has routes to these networks: 10.130.158.0/24, 10.130.159.0/24, 10.130.160.0/24, 10.130.161.0/24. What is the longest prefix length p of a single summary route that covers all of them?

10.130.158.0/24 … 10.130.161.0/24
p =
3.Computer networksMedium

TLS provides which security properties for HTTPS?

  1. AOnly faster loading
  2. BAnonymity of the user
  3. CConfidentiality, integrity and server authentication
  4. DProtection against all malware and phishing on the visited site
4.Computer networksHard

Why was the TCP window scale option introduced?

  1. AThe 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths
  2. BUDP needed a way to control its sending rate on congested paths
  3. CWithout it, TCP could not detect lost segments on long-distance links
  4. DThe 32-bit window field was too large and wasted header space in every TCP segment sent
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

N = −508 bit
U =
6.Number systemsHard
click the bits to set them012806403201608040201

Set the bits to the 8-bit result of 1010 0000 >> 1. What is the result's value R in decimal?

1010 0000>> 1
R =

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 < 1444
211 − 2 = 2046 ≥ 1444 → h = 11

Prefix length

p = 32 − 11 = 21

Answer

p = /21
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

158 = 10011110
161 = 10100001
common leading bits: 2

Prefix length

p = 16 + 2 = 18

Answer

p = /18

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

3.Computer networks

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

C · Confidentiality, integrity and server authentication
4.Computer networks

Answer: A · The 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths

Why this is the answer

The original header allows at most 65,535 bytes of unacknowledged data. Window scaling multiplies this by a power of two so high bandwidth-delay paths can be filled.

Answer

A · The 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths
5.Number systems

Answer: U = 206

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

50 = 0011 0010
inverted: 1100 1101
+1 → 1100 1110

Read it as unsigned

1100 1110₂ = 256 − 50 = 206

Answer

U = 206
6.Number systems

Answer: R = 80

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

Shifting right by 1 moves every bit 1 places to the right; bits that fall off the right end are lost and zeros come in on the left.

1010 0000 >> 1
= 0101 0000

Value of the result

0101 0000₂ = 80

Answer

R = 80

ExamProblems · examproblems.com/courses/computer-networks