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
255.255.255.12811111111111111111111111110000000network bitshost bits

A subnet uses the mask 255.255.255.128. How many usable host addresses H does it have?

255.255.255.128
H =
2.IPv4 subnettingHard
last octet = 132112806403201608140201networkhost

A host has the address 10.20.69.132/25. What is the last number (fourth octet) x of its subnet's broadcast address?

10.20.69.132/25
x =
3.Computer networksMedium

HTTP is stateless. How do websites usually keep a user logged in across requests?

  1. ABy giving each user a fixed IP address
  2. BBy keeping the TCP connection open for days
  3. CWith cookies holding a session identifier or token
  4. DBy storing the password in the URL
4.Computer networksHard

What is the main benefit of persistent connections (keep-alive) in HTTP/1.1?

  1. AThe connection stays encrypted without TLS
  2. BSeveral requests reuse one TCP connection, avoiding repeated handshakes
  3. CResponses can arrive in any order on one stream, so slow replies do not block others
  4. DThe server can push updates over UDP
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

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

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

406
b = bit

3Solutions

1.IPv4 subnetting

Answer: H = 126

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

Prefix length

255.255.255.128 = /25

Usable hosts

27 − 2 = 126

Answer

H = 126
2.IPv4 subnetting

Answer: x = 255

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

27 = 128

Subnet of this host

network: ⌊132/128⌋·128 = 128
broadcast: 128 + 128 − 1 = 255
usable hosts: 129 … 254

Answer

x = 255
3.Computer networks

Answer: C · With cookies holding a session identifier or token

Why this is the answer

The server sets a cookie containing a session ID or token, and the browser returns it with each request so the server can recognise the user.

Answer

C · With cookies holding a session identifier or token
4.Computer networks

Answer: B · Several requests reuse one TCP connection, avoiding repeated handshakes

Why this is the answer

Reusing a connection avoids a new handshake and slow start for each object, so pages with many resources load faster.

Answer

B · Several requests reuse one TCP connection, avoiding repeated handshakes
5.Number systems

Answer: U = 190

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

66 = 0100 0010
inverted: 1011 1101
+1 → 1011 1110

Read it as unsigned

1011 1110₂ = 256 − 66 = 190

Answer

U = 190
6.Number systems

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

28 = 256 < 406
29 = 512 ≥ 406

Answer

b = 9

ExamProblems · examproblems.com/courses/computer-networks