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
/?11111111111111111111110000000000network bitshost bits

A department needs 594 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?

594 hosts
p =
2.IPv4 subnettingHard
third octet = 87012816403211608141211networkhost

A host has the address 172.20.87.106/20. What is the third octet x of its network address?

172.20.87.106/20
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. BRequest, Offer, Discover, Acknowledge
  3. CDiscover, Request, Offer, Acknowledge
  4. DDiscover, Offer, Request, Acknowledge
4.Computer networksHard

Why does the side that closes a TCP connection first stay in the TIME_WAIT state for twice the maximum segment lifetime?

  1. ATo keep the encryption keys for later reuse
  2. BSo delayed segments die out and the final ACK can be resent if it was lost
  3. CTo wait for the DNS cache to expire
  4. DTo let the routers along the path update their routing tables for the next connection
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

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

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

2386
b = bit

3Solutions

1.IPv4 subnetting

Answer: p = 22

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

29 − 2 = 510 < 594
210 − 2 = 1022 ≥ 594 → h = 10

Prefix length

p = 32 − 10 = 22

Answer

p = /22
2.IPv4 subnetting

Answer: x = 80

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 in the third octet

24 = 16

Subnet of this host

network: 172.20.80.0
broadcast: 172.20.95.255

Answer

x = 80
3.Computer networks

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

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

Answer: B · So delayed segments die out and the final ACK can be resent if it was lost

Why this is the answer

TIME_WAIT ensures a lost final ACK can be repeated and old duplicate segments expire before the same address and port pair is reused.

Answer

B · So delayed segments die out and the final ACK can be resent if it was lost
5.Number systems

Answer: U = 137

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

119 = 0111 0111
inverted: 1000 1000
+1 → 1000 1001

Read it as unsigned

1000 1001₂ = 256 − 119 = 137

Answer

U = 137
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 < 2386
212 = 4096 ≥ 2386

Answer

b = 12

ExamProblems · examproblems.com/courses/computer-networks