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

The network 192.168.48.0/24 is divided into /26 subnets, numbered 1, 2, 3, … from the lowest address (subnet 1 starts at .0). What is the fourth octet x of the network address of subnet 4?

192.168.48.0/24/26subnet 4 (subnet 1 starts at .0)
x =
2.IPv4 subnettingHard
last octet = 156112806403211618140201networkhost

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

10.20.127.156/29
x =
3.Computer networksMedium

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

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

Why does TCP choose an unpredictable initial sequence number for each connection?

  1. ATo select the best route to the destination for the segments of that connection
  2. BTo avoid confusion with old segments and make spoofed segments harder to inject
  3. CTo compress the data more efficiently
  4. DTo encrypt the payload of each segment
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

N = −358 bit
U =
6.Number systemsHard
3230 codes, b = ? bits?2ᵇ⁻¹…?4?2?1

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

3230
b = bit

3Solutions

1.IPv4 subnetting

Answer: x = 192

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

26 = 64

Subnet number 4

network: (4 − 1)·64 = 192
broadcast: 192 + 64 − 1 = 255

Answer

x = 192
2.IPv4 subnetting

Answer: x = 158

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: ⌊156/8⌋·8 = 152
broadcast: 152 + 8 − 1 = 159
usable hosts: 153 … 158

Answer

x = 158
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 · To avoid confusion with old segments and make spoofed segments harder to inject

Why this is the answer

Random initial sequence numbers stop delayed segments from old connections being accepted and make it hard for off-path attackers to forge valid segments.

Answer

B · To avoid confusion with old segments and make spoofed segments harder to inject
5.Number systems

Answer: U = 221

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

35 = 0010 0011
inverted: 1101 1100
+1 → 1101 1101

Read it as unsigned

1101 1101₂ = 256 − 35 = 221

Answer

U = 221
6.Number systems

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

211 = 2048 < 3230
212 = 4096 ≥ 3230

Answer

b = 12

ExamProblems · examproblems.com/courses/computer-networks