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

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

1597 hosts
p =
2.IPv4 subnettingHard
third octet 29 … 32012806403211618140211commonvaries

A router has routes to these networks: 10.240.29.0/24, 10.240.30.0/24, 10.240.31.0/24, 10.240.32.0/24. What is the longest prefix length p of a single summary route that covers all of them?

10.240.29.0/24 … 10.240.32.0/24
p =
3.Computer networksMedium

Which protocol does the "ping" command use?

  1. ATCP
  2. BUDP
  3. CICMP
  4. DHTTP
4.Computer networksHard

A remote-terminal application feels sluggish because small keystroke packets are held back. Which TCP mechanism is often responsible?

  1. ANagle's algorithm
  2. BThe three-way handshake
  3. CSlow start
  4. DFast retransmit
5.Number systemsMedium
8-bit two's complement?−128?64?32?16?8?4?2?1

Write −31 as an 8-bit two's complement pattern. Read the pattern as an unsigned binary number: what is its value U in decimal?

N = −318 bit
U =
6.Number systemsHard
click the bits to set them012806403201608040201

Set the bits to the 8-bit result of 0011 1111 << 2. What is the result's value R in decimal?

0011 1111<< 2
R =

3Solutions

1.IPv4 subnetting

Answer: p = 21

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

210 − 2 = 1022 < 1597
211 − 2 = 2046 ≥ 1597 → h = 11

Prefix length

p = 32 − 11 = 21

Answer

p = /21
2.IPv4 subnetting

Answer: p = 18

Route summarisation: a summary route a.b.c.0/p covers all networks whose first p bits match. Write the differing octet of the first and last network in binary; the number of common leading bits, plus the bits of the octets before it, is the longest summary prefix.

Compare the bits

29 = 00011101
32 = 00100000
common leading bits: 2

Prefix length

p = 16 + 2 = 18

Answer

p = /18

Summary route: 10.240.0.0/18 (it also covers 60 network(s) that are not in the list).

3.Computer networks

Answer: C · ICMP

Why this is the answer

Ping sends ICMP echo requests and measures the time until echo replies return.

Answer

C · ICMP
4.Computer networks

Answer: A · Nagle's algorithm

Why this is the answer

Nagle's algorithm waits to bundle small segments while earlier data is unacknowledged. This saves bandwidth but adds delay for interactive traffic.

Answer

A · Nagle's algorithm
5.Number systems

Answer: U = 225

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.

Invert and add one

31 = 0001 1111
inverted: 1110 0000
+1 → 1110 0001

Read it as unsigned

1110 0001₂ = 256 − 31 = 225

Answer

U = 225
6.Number systems

Answer: R = 252

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 2 moves every bit 2 places to the left; bits that fall off the left end are lost and zeros come in on the right.

0011 1111 << 2
= 1111 1100

Value of the result

1111 1100₂ = 252

Answer

R = 252

ExamProblems · examproblems.com/courses/computer-networks