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

192.168.10.0/2410 subnets
H =
2.IPv4 subnettingHard
last octet = 83012816403211608041211networkhost

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

10.20.129.83/26
x =
3.Computer networksMedium

What is the usual order of messages when a client obtains an address from DHCP?

  1. AOffer, Discover, Acknowledge, Request
  2. BDiscover, Offer, Request, Acknowledge
  3. CDiscover, Request, Offer, Acknowledge
  4. DRequest, Offer, Discover, Acknowledge
4.Computer networksHard

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

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

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

1001 11108 bit
N =
6.Number systemsHard
16 bit1 px1024 px768 pxM = ? KiB

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

1024 × 768 px16 bit/px1 KiB = 1024 B
M = KiB

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 ≥ 10 → b = 4, /28

Hosts per subnet

24 − 2 = 14

Answer

H = 14
2.IPv4 subnetting

Answer: x = 64

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 of this host

network: ⌊83/64⌋·64 = 64
broadcast: 64 + 64 − 1 = 127
usable hosts: 65 … 126

Answer

x = 64
3.Computer networks

Answer: B · Discover, Offer, Request, Acknowledge

Why this is the answer

The client broadcasts Discover, servers reply with Offers, the client Requests one offer and the chosen server confirms with an Acknowledge.

Answer

B · Discover, Offer, Request, Acknowledge
4.Computer networks

Answer: B · 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

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

Answer: N = −98

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 + 16 + 8 + 4 + 2 = −98

Answer

N = −98
6.Number systems

Answer: M = 1536 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

1024·768·16 = 12582912 bit = 1572864 B

Convert to KiB

1572864/1024 = 1536 KiB

Answer

M = 1536 KiB

ExamProblems · examproblems.com/courses/computer-networks