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
/24 → /2911111111111111111111111111111000network bitshost bits

The network 192.168.21.0/24 is divided into /29 subnets, numbered 1, 2, 3, … from the lowest address (subnet 1 starts at .0). What is the fourth octet x of the broadcast address of subnet 10?

192.168.21.0/24/29subnet 10 (subnet 1 starts at .0)
x =
2.IPv4 subnettingHard
third octet 234 … 237112816413201618041201commonvaries

A router has routes to these networks: 10.136.234.0/24, 10.136.235.0/24, 10.136.236.0/24, 10.136.237.0/24. What is the longest prefix length p of a single summary route that covers all of them?

10.136.234.0/24 … 10.136.237.0/24
p =
3.Computer networksMedium

Which medium access method did classic shared (half-duplex) Ethernet use?

  1. ACSMA/CA
  2. BTDMA
  3. CToken passing
  4. DCSMA/CD
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 let the routers along the path update their routing tables for the next connection
  2. BTo wait for the DNS cache to expire
  3. CSo delayed segments die out and the final ACK can be resent if it was lost
  4. DTo keep the encryption keys for later reuse
5.Number systemsMedium
place values in two's complement1−12816413201608041201

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

1110 00108 bit
N =
6.Number systemsHard
24 bit1 px640 px480 pxM = ? KiB

An uncompressed image is 640 × 480 pixels with 24 bits per pixel. How much memory M does it take, in KiB (1 KiB = 1024 bytes)?

640 × 480 px24 bit/px1 KiB = 1024 B
M = KiB

3Solutions

1.IPv4 subnetting

Answer: x = 79

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

23 = 8

Subnet number 10

network: (10 − 1)·8 = 72
broadcast: 72 + 8 − 1 = 79

Answer

x = 79
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

234 = 11101010
237 = 11101101
common leading bits: 5

Prefix length

p = 16 + 5 = 21

Answer

p = /21

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

3.Computer networks

Answer: D · CSMA/CD

Why this is the answer

Carrier sense multiple access with collision detection: stations stop when they detect a collision and retry after a random backoff. Full-duplex switched Ethernet has no collisions.

Answer

D · CSMA/CD
4.Computer networks

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

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

Answer: N = −30

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 + 64 + 32 + 2 = −30

Answer

N = −30
6.Number systems

Answer: M = 900 KiB

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.

Bits and bytes

640·480·24 = 7372800 bit = 921600 B

Convert to KiB

921600/1024 = 900 KiB

Answer

M = 900 KiB

ExamProblems · examproblems.com/courses/computer-networks