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

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

192.168.10.0/2420 subnets
H =
2.IPv4 subnettingHard
last octet = 247112816413211608141211networkhost

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

10.20.248.247/25
x =
3.Computer networksMedium

How long does it take to put a 1500-byte packet onto a 12 Mbit/s link (transmission delay)?

  1. A8 ms
  2. B0.125 ms
  3. C12 ms
  4. D1 ms
4.Computer networksHard

Why was the TCP window scale option introduced?

  1. AWithout it, TCP could not detect lost segments on long-distance links
  2. BThe 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths
  3. CThe 32-bit window field was too large and wasted header space in every TCP segment sent
  4. DUDP needed a way to control its sending rate on congested paths
5.Number systemsMedium
place values in two's complement1−12806413211608040201

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

1011 00008 bit
N =
6.Number systemsHard
1737 codes, b = ? bits?2ᵇ⁻¹…?4?2?1

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

1737
b = bit

3Solutions

1.IPv4 subnetting

Answer: H = 6

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

25 = 32 ≥ 20 → b = 5, /29

Hosts per subnet

23 − 2 = 6

Answer

H = 6
2.IPv4 subnetting

Answer: x = 255

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

27 = 128

Subnet of this host

network: ⌊247/128⌋·128 = 128
broadcast: 128 + 128 − 1 = 255
usable hosts: 129 … 254

Answer

x = 255
3.Computer networks

Answer: D · 1 ms

Why this is the answer

1500 bytes = 12,000 bits. 12,000 / 12,000,000 bit/s = 0.001 s = 1 ms. Transmission delay depends on packet size and link rate, not distance.

Answer

D · 1 ms
4.Computer networks

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

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

Answer: N = −80

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 + 32 + 16 = −80

Answer

N = −80
6.Number systems

Answer: b = 11 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

210 = 1024 < 1737
211 = 2048 ≥ 1737

Answer

b = 11

ExamProblems · examproblems.com/courses/computer-networks