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

1305 hosts
p =
2.IPv4 subnettingHard
last octet = 113012816413211608040211networkhost

A host has the address 10.20.165.113/29. What is the fourth octet x of the last usable host address in its subnet?

10.20.165.113/29
x =
3.Computer networksMedium

Which single prefix summarises both 192.168.0.0/24 and 192.168.1.0/24?

  1. A192.168.1.0/23
  2. B192.168.0.0/22
  3. C192.168.0.0/23
  4. D192.168.0.0/25
4.Computer networksHard

TCP congestion control's "slow start" phase:

  1. AKeeps the window fixed at one segment
  2. BIncreases the congestion window exponentially until a threshold or loss
  3. CIs used only by UDP
  4. DHalves the congestion window every round trip until a packet loss is detected
5.Number systemsMedium
place values in two's complement1−12816403201608140201

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

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

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

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

Prefix length

p = 32 − 11 = 21

Answer

p = /21
2.IPv4 subnetting

Answer: x = 118

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

23 = 8

Subnet of this host

network: ⌊113/8⌋·8 = 112
broadcast: 112 + 8 − 1 = 119
usable hosts: 113 … 118

Answer

x = 118
3.Computer networks

Answer: C · 192.168.0.0/23

Why this is the answer

0 and 1 share all bits of the third octet except the last, so one bit less of prefix (/23) starting at 192.168.0.0 covers both exactly.

Answer

C · 192.168.0.0/23
4.Computer networks

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

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

Answer: N = −60

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 = −60

Answer

N = −60
6.Number systems

Answer: R = 59

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.

0111 0110 >> 1
= 0011 1011

Value of the result

0011 1011₂ = 59

Answer

R = 59

ExamProblems · examproblems.com/courses/computer-networks