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 16 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?

192.168.10.0/2416 subnets
H =
2.IPv4 subnettingHard
last octet = 95012816403211618141211networkhost

A host has the address 10.20.58.95/29. What is the fourth octet x of its network address?

10.20.58.95/29
x =
3.Computer networksMedium

Using even parity, which parity bit is added to the data bits 1011001?

  1. A1
  2. B4
  3. C2
  4. D0
4.Computer networksHard

A TCP connection has a 64 KB window and a 100 ms round-trip time, and no window scaling. What is its approximate maximum throughput?

  1. AAbout 50 Mbit/s
  2. BAbout 0.5 Mbit/s
  3. CAbout 5 Mbit/s
  4. DAbout 640 Mbit/s
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

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

Set the bits to the 8-bit result of 1011 1111 >> 2. What is the result's value R in decimal?

1011 1111>> 2
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).

Bits to borrow

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

Hosts per subnet

24 − 2 = 14

Answer

H = 14
2.IPv4 subnetting

Answer: x = 88

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: ⌊95/8⌋·8 = 88
broadcast: 88 + 8 − 1 = 95
usable hosts: 89 … 94

Answer

x = 88
3.Computer networks

Answer: D · 0

Why this is the answer

1011001 contains four 1-bits, already an even number, so the parity bit is 0. With odd parity it would be 1.

Answer

D · 0
4.Computer networks

Answer: C · About 5 Mbit/s

Why this is the answer

Throughput ≤ window / RTT = 65,536 × 8 bits / 0.1 s ≈ 5.2 Mbit/s, however fast the link is.

Answer

C · About 5 Mbit/s
5.Number systems

Answer: U = 216

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

40 = 0010 1000
inverted: 1101 0111
+1 → 1101 1000

Read it as unsigned

1101 1000₂ = 256 − 40 = 216

Answer

U = 216
6.Number systems

Answer: R = 47

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 2 moves every bit 2 places to the right; bits that fall off the right end are lost and zeros come in on the left.

1011 1111 >> 2
= 0010 1111

Value of the result

0010 1111₂ = 47

Answer

R = 47

ExamProblems · examproblems.com/courses/computer-networks