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
255.255.255.24011111111111111111111111111110000network bitshost bits

A subnet uses the mask 255.255.255.240. How many usable host addresses H does it have?

255.255.255.240
H =
2.IPv4 subnettingHard
last octet = 128112806403201608040201networkhost

A host has the address 10.20.68.128/27. What is the last number (fourth octet) x of its subnet's broadcast address?

10.20.68.128/27
x =
3.Computer networksMedium

What does a subnet mask of 255.255.255.0 correspond to in CIDR notation?

  1. A/8
  2. B/16
  3. C/24
  4. D/32
4.Computer networksHard

TCP congestion control's "slow start" phase:

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

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

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

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

1010 1001<< 1
R =

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).

Prefix length

255.255.255.240 = /28

Usable hosts

24 − 2 = 14

Answer

H = 14
2.IPv4 subnetting

Answer: x = 159

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

25 = 32

Subnet of this host

network: ⌊128/32⌋·32 = 128
broadcast: 128 + 32 − 1 = 159
usable hosts: 129 … 158

Answer

x = 159
3.Computer networks

Answer: C · /24

Why this is the answer

Three octets of 255 are 24 one-bits, so 255.255.255.0 = /24.

Answer

C · /24
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: U = 172

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

84 = 0101 0100
inverted: 1010 1011
+1 → 1010 1100

Read it as unsigned

1010 1100₂ = 256 − 84 = 172

Answer

U = 172
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

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

1010 1001 << 1
= 0101 0010

Value of the result

0101 0010₂ = 82

Answer

R = 82

ExamProblems · examproblems.com/courses/computer-networks