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

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

192.168.10.0/246 subnets
H =
2.IPv4 subnettingHard
last octet = 112012816413211608040201networkhost

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

10.20.87.112/27
x =
3.Computer networksMedium

What is a cyclic redundancy check (CRC) used for in Ethernet frames?

  1. AChoosing the best route
  2. BEncrypting the frame
  3. CCorrecting every bit error automatically
  4. DDetecting transmission errors
4.Computer networksHard

After repeated collisions, classic Ethernet stations choose their waiting time from a range that doubles each time. Why?

  1. ATo lower the chance of colliding again when many stations compete
  2. BTo give the station with the highest MAC address priority on the shared cable
  3. CTo make the cable carry signals further
  4. DTo synchronise all stations to one clock
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

N = −748 bit
U =
6.Number systemsHard
24 bit1 px1280 px720 pxM = ? KiB

An uncompressed image is 1280 × 720 pixels with 24 bits per pixel. How much memory M does it take, in KiB (1 KiB = 1024 bytes)?

1280 × 720 px24 bit/px1 KiB = 1024 B
M = KiB

3Solutions

1.IPv4 subnetting

Answer: H = 30

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

23 = 8 ≥ 6 → b = 3, /27

Hosts per subnet

25 − 2 = 30

Answer

H = 30
2.IPv4 subnetting

Answer: x = 127

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

25 = 32

Subnet of this host

network: ⌊112/32⌋·32 = 96
broadcast: 96 + 32 − 1 = 127
usable hosts: 97 … 126

Answer

x = 127
3.Computer networks

Answer: D · Detecting transmission errors

Why this is the answer

The sender computes a CRC over the frame; the receiver recomputes it and discards the frame if they differ. CRC detects errors but does not correct them.

Answer

D · Detecting transmission errors
4.Computer networks

Answer: A · To lower the chance of colliding again when many stations compete

Why this is the answer

Each further collision suggests more contention, so the random range grows and stations are more likely to pick different slots. It adapts to load without central control.

Answer

A · To lower the chance of colliding again when many stations compete
5.Number systems

Answer: U = 182

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

74 = 0100 1010
inverted: 1011 0101
+1 → 1011 0110

Read it as unsigned

1011 0110₂ = 256 − 74 = 182

Answer

U = 182
6.Number systems

Answer: M = 2700 KiB

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.

Bits and bytes

1280·720·24 = 22118400 bit = 2764800 B

Convert to KiB

2764800/1024 = 2700 KiB

Answer

M = 2700 KiB

ExamProblems · examproblems.com/courses/computer-networks