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

1433 hosts
p =
2.IPv4 subnettingHard

The network 192.168.175.0/24 is split with VLSM for these LANs: A: 13 hosts, B: 6 hosts, C: 21 hosts, D: 4 hosts, E: 30 hosts. Subnets are allocated from .0 upwards, the LAN with the most hosts first, each with the smallest subnet that fits. What is the fourth octet x of the network address of LAN C?

A: 13B: 6C: 21D: 4E: 30
x =
3.Computer networksMedium

How many usable host addresses does a /26 IPv4 subnet have?

  1. A62
  2. B64
  3. C30
  4. D126
4.Computer networksHard

A firewall blocks all ICMP. Small web requests work, but large downloads over some paths hang. What is the likely cause?

  1. ATCP cannot open connections without ICMP
  2. BDNS needs ICMP to resolve names
  3. CTLS certificates are sent over ICMP
  4. DPath MTU discovery fails because "fragmentation needed" messages are blocked
5.Number systemsMedium
place values in two's complement1−12806413201618140211

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

1010 11018 bit
N =
6.Number systemsHard
click the bits to set them012806403201608040201

Set the bits to the 8-bit result of 0101 0011 XOR 1001 0100. What is the result's value R in decimal?

0101 0011XOR1001 0100
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 < 1433
211 − 2 = 2046 ≥ 1433 → h = 11

Prefix length

p = 32 − 11 = 21

Answer

p = /21
2.IPv4 subnetting

Answer: x = 32

VLSM: each LAN gets the smallest subnet with 2ʰ − 2 ≥ its host count, i.e. prefix 32 − h. Allocating the largest subnets first keeps every block aligned on a multiple of its own size, so the network addresses follow by adding up the block sizes.

Block size per LAN

E: 30 hosts → 25 = 32 (/27)
C: 21 hosts → 25 = 32 (/27)
A: 13 hosts → 24 = 16 (/28)
B: 6 hosts → 23 = 8 (/29)
D: 4 hosts → 23 = 8 (/29)

Allocation, largest first

E: .0 – .31
C: .32 – .63
A: .64 – .79
B: .80 – .87
D: .88 – .95

Answer

x = 32

LAN C: 192.168.175.32/27.

3.Computer networks

Answer: A · 62

Why this is the answer

A /26 has 6 host bits: 2⁶ = 64 addresses, minus the network and broadcast addresses, gives 62 usable hosts.

Answer

A · 62
4.Computer networks

Answer: D · Path MTU discovery fails because "fragmentation needed" messages are blocked

Why this is the answer

PMTUD relies on ICMP messages to learn the smaller MTU. If they are dropped, large packets vanish silently, creating a "black hole" connection.

Answer

D · Path MTU discovery fails because "fragmentation needed" messages are blocked
5.Number systems

Answer: N = −83

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 + 8 + 4 + 1 = −83

Answer

N = −83
6.Number systems

Answer: R = 199

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

XOR gives 1 where the two bits differ.

0101 0011
XOR 1001 0100
= 1100 0111

Value of the result

1100 0111₂ = 199

Answer

R = 199

ExamProblems · examproblems.com/courses/computer-networks