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.252.011111111111111111111110000000000network bitshost bits

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

255.255.252.0
H =
2.IPv4 subnettingHard
last octet = 231112816413201608141211networkhost

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

10.20.178.231/29
x =
3.Computer networksMedium

Which range of TCP/UDP port numbers is reserved as "well-known" ports?

  1. A49152–65535
  2. B1024–49151
  3. C0–65535
  4. D0–1023
4.Computer networksHard

You must divide 192.168.1.0/24 into at least 5 subnets with up to 25 hosts each. Which prefix length fits best?

  1. A/28
  2. B/26
  3. C/27
  4. D/25
5.Number systemsMedium
place values in two's complement1−12816413201608140201

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

1110 01008 bit
N =
6.Number systemsHard
click the bits to set them012806403201608040201

Set the bits to the 8-bit result of 1101 1011 << 3. What is the result's value R in decimal?

1101 1011<< 3
R =

3Solutions

1.IPv4 subnetting

Answer: H = 1022

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.252.0 = /22

Usable hosts

210 − 2 = 1022

Answer

H = 1022
2.IPv4 subnetting

Answer: x = 224

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: ⌊231/8⌋·8 = 224
broadcast: 224 + 8 − 1 = 231
usable hosts: 225 … 230

Answer

x = 224
3.Computer networks

Answer: D · 0–1023

Why this is the answer

Ports 0–1023 are well-known ports for standard services. 1024–49151 are registered ports and 49152–65535 are dynamic or private ports.

Answer

D · 0–1023
4.Computer networks

Answer: C · /27

Why this is the answer

/27 gives 8 subnets with 30 usable hosts each. /26 gives only 4 subnets, and /28 allows only 14 hosts per subnet.

Answer

C · /27
5.Number systems

Answer: N = −28

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 + 64 + 32 + 4 = −28

Answer

N = −28
6.Number systems

Answer: R = 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.

Bit by bit

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

1101 1011 << 3
= 1101 1000

Value of the result

1101 1000₂ = 216

Answer

R = 216

ExamProblems · examproblems.com/courses/computer-networks