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

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

192.168.218.0/24/27subnet 3 (subnet 1 starts at .0)
x =
2.IPv4 subnettingHard
last octet = 187112806413211618041211networkhost

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

10.20.2.187/30
x =
3.Computer networksMedium

Why does Wi-Fi use collision avoidance (CSMA/CA) instead of collision detection?

  1. AWi-Fi only allows one device per network
  2. BRadio signals never collide
  3. CCollision detection only works on fibre cables, not on shared wireless radio channels
  4. DA wireless station cannot reliably detect collisions while it is transmitting
4.Computer networksHard

By Shannon's theorem, what is the capacity of a 1 MHz channel with a signal-to-noise ratio of 255?

  1. A8 Mbit/s
  2. B2 Mbit/s
  3. C255 Mbit/s
  4. D1 Mbit/s
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

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

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

4342
b = bit

3Solutions

1.IPv4 subnetting

Answer: x = 64

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

25 = 32

Subnet number 3

network: (3 − 1)·32 = 64
broadcast: 64 + 32 − 1 = 95

Answer

x = 64
2.IPv4 subnetting

Answer: x = 187

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

22 = 4

Subnet of this host

network: ⌊187/4⌋·4 = 184
broadcast: 184 + 4 − 1 = 187
usable hosts: 185 … 186

Answer

x = 187
3.Computer networks

Answer: D · A wireless station cannot reliably detect collisions while it is transmitting

Why this is the answer

A radio transmitter cannot hear other weak signals while sending, and some stations are hidden from each other. So 802.11 waits random backoff times and uses acknowledgements.

Answer

D · A wireless station cannot reliably detect collisions while it is transmitting
4.Computer networks

Answer: A · 8 Mbit/s

Why this is the answer

C = 10⁶ × log₂(256) = 10⁶ × 8 = 8 Mbit/s. This is the upper limit for error-free data rate on a noisy channel.

Answer

A · 8 Mbit/s
5.Number systems

Answer: U = 150

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

106 = 0110 1010
inverted: 1001 0101
+1 → 1001 0110

Read it as unsigned

1001 0110₂ = 256 − 106 = 150

Answer

U = 150
6.Number systems

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

212 = 4096 < 4342
213 = 8192 ≥ 4342

Answer

b = 13

ExamProblems · examproblems.com/courses/computer-networks