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

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

192.168.10.0/2412 subnets
H =
2.IPv4 subnettingHard
third octet 53 … 57012806413211608140211commonvaries

A router has routes to these networks: 10.38.53.0/24, 10.38.54.0/24, 10.38.55.0/24, 10.38.56.0/24, 10.38.57.0/24. What is the longest prefix length p of a single summary route that covers all of them?

10.38.53.0/24 … 10.38.57.0/24
p =
3.Computer networksMedium

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

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

TCP congestion control's "slow start" phase:

  1. AKeeps the window fixed at one segment
  2. BHalves the congestion window every round trip until a packet loss is detected
  3. CIncreases the congestion window exponentially until a threshold or loss
  4. DIs used only by UDP
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

N = −498 bit
U =
6.Number systemsHard
12-bit two's complement, N = ??sign???????????

What is the most negative integer N that can be stored in 12-bit two's complement?

12 bit
N =

3Solutions

1.IPv4 subnetting

Answer: H = 14

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

24 = 16 ≥ 12 → b = 4, /28

Hosts per subnet

24 − 2 = 14

Answer

H = 14
2.IPv4 subnetting

Answer: p = 20

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

53 = 00110101
57 = 00111001
common leading bits: 4

Prefix length

p = 16 + 4 = 20

Answer

p = /20

Summary route: 10.38.48.0/20 (it also covers 11 network(s) that are not in the list).

3.Computer networks

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

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

Answer: C · Increases the congestion window exponentially until a threshold or loss

Why this is the answer

Slow start grows the congestion window exponentially; after the threshold, congestion avoidance grows it linearly, and loss reduces it.

Answer

C · Increases the congestion window exponentially until a threshold or loss
5.Number systems

Answer: U = 207

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

49 = 0011 0001
inverted: 1100 1110
+1 → 1100 1111

Read it as unsigned

1100 1111₂ = 256 − 49 = 207

Answer

U = 207
6.Number systems

Answer: N = −2048

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.

Most negative value

−211 = −2048

Answer

N = −2048

ExamProblems · examproblems.com/courses/computer-networks