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

The network 10.7.68.0/22 is divided into equal subnets with prefix /26. How many subnets N are there?

10.7.68.0/22/26
N =
2.IPv4 subnettingHard

The network 192.168.204.0/24 is split with VLSM for these LANs: A: 26 hosts, B: 12 hosts, C: 3 hosts, D: 24 hosts, E: 35 hosts. Subnets are allocated from .0 upwards, the LAN with the most hosts first, each with the smallest subnet that fits. What is the fourth octet x of the network address of LAN A?

A: 26B: 12C: 3D: 24E: 35
x =
3.Computer networksMedium

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

  1. ADiscover, Request, Offer, Acknowledge
  2. BDiscover, Offer, Request, Acknowledge
  3. CRequest, Offer, Discover, Acknowledge
  4. DOffer, Discover, Acknowledge, Request
4.Computer networksHard

A server's private key is stolen a year from now. Which TLS property keeps today's recorded sessions safe?

  1. ACompressing the data before encryption
  2. BUsing a longer domain name
  3. CForward secrecy from ephemeral Diffie-Hellman key exchange
  4. DSending the certificate twice
5.Number systemsMedium
place values in two's complement1−12806413211608041201

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

1011 00108 bit
N =
6.Number systemsHard
10-bit two's complement, N = ??sign?????????

What is the most negative integer N that can be stored in 10-bit two's complement?

10 bit
N =

3Solutions

1.IPv4 subnetting

Answer: N = 16

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).

Borrowed bits

26 − 22 = 4

Number of subnets

N = 24 = 16

Answer

N = 16

Each /26 subnet has 26 − 2 = 62 usable hosts.

2.IPv4 subnetting

Answer: x = 64

VLSM: each LAN gets the smallest subnet with 2ʰ − 2 ≥ its host count, i.e. prefix 32 − h. Allocating the largest subnets first keeps every block aligned on a multiple of its own size, so the network addresses follow by adding up the block sizes.

Block size per LAN

E: 35 hosts → 26 = 64 (/26)
A: 26 hosts → 25 = 32 (/27)
D: 24 hosts → 25 = 32 (/27)
B: 12 hosts → 24 = 16 (/28)
C: 3 hosts → 23 = 8 (/29)

Allocation, largest first

E: .0 – .63
A: .64 – .95
D: .96 – .127
B: .128 – .143
C: .144 – .151

Answer

x = 64

LAN A: 192.168.204.64/27.

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: C · Forward secrecy from ephemeral Diffie-Hellman key exchange

Why this is the answer

With ephemeral (EC)DHE, each session key is derived from temporary values that are discarded. The long-term key only signs the exchange, so stealing it later does not decrypt old traffic.

Answer

C · Forward secrecy from ephemeral Diffie-Hellman key exchange
5.Number systems

Answer: N = −78

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 + 32 + 16 + 2 = −78

Answer

N = −78
6.Number systems

Answer: N = −512

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.

Most negative value

−29 = −512

Answer

N = −512

ExamProblems · examproblems.com/courses/computer-networks