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 1148 host addresses in a single subnet. What is the longest prefix length p (smallest subnet) that is big enough?

1148 hosts
p =
2.IPv4 subnettingHard
third octet 35 … 38012806413201608041211commonvaries

A router has routes to these networks: 10.132.35.0/24, 10.132.36.0/24, 10.132.37.0/24, 10.132.38.0/24. What is the longest prefix length p of a single summary route that covers all of them?

10.132.35.0/24 … 10.132.38.0/24
p =
3.Computer networksMedium

How does TLS typically use asymmetric and symmetric cryptography?

  1. AAsymmetric methods agree keys and authenticate; symmetric ciphers encrypt the data
  2. BSymmetric methods agree keys and authenticate; asymmetric ciphers encrypt all the data
  3. COnly asymmetric cryptography is used throughout
  4. DOnly symmetric cryptography is used, with a fixed shared password
4.Computer networksHard

Why was the TCP window scale option introduced?

  1. AThe 32-bit window field was too large and wasted header space in every TCP segment sent
  2. BThe 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths
  3. CUDP needed a way to control its sending rate on congested paths
  4. DWithout it, TCP could not detect lost segments on long-distance links
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

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

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

903
b = bit

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 < 1148
211 − 2 = 2046 ≥ 1148 → h = 11

Prefix length

p = 32 − 11 = 21

Answer

p = /21
2.IPv4 subnetting

Answer: p = 21

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

35 = 00100011
38 = 00100110
common leading bits: 5

Prefix length

p = 16 + 5 = 21

Answer

p = /21

Summary route: 10.132.32.0/21 (it also covers 4 network(s) that are not in the list).

3.Computer networks

Answer: A · Asymmetric methods agree keys and authenticate; symmetric ciphers encrypt the data

Why this is the answer

Public-key methods and certificates set up a shared secret and prove identity. Fast symmetric ciphers such as AES then protect the bulk data.

Answer

A · Asymmetric methods agree keys and authenticate; symmetric ciphers encrypt the data
4.Computer networks

Answer: B · The 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths

Why this is the answer

The original header allows at most 65,535 bytes of unacknowledged data. Window scaling multiplies this by a power of two so high bandwidth-delay paths can be filled.

Answer

B · The 16-bit window field limits the window to 65,535 bytes, too small for fast long-distance paths
5.Number systems

Answer: U = 160

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

96 = 0110 0000
inverted: 1001 1111
+1 → 1010 0000

Read it as unsigned

1010 0000₂ = 256 − 96 = 160

Answer

U = 160
6.Number systems

Answer: b = 10 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

29 = 512 < 903
210 = 1024 ≥ 903

Answer

b = 10

ExamProblems · examproblems.com/courses/computer-networks