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

1126 hosts
p =
2.IPv4 subnettingHard
last octet = 127012816413211618141211networkhost

A host has the address 10.20.73.127/28. What is the fourth octet x of the last usable host address in its subnet?

10.20.73.127/28
x =
3.Computer networksMedium

Using even parity, which parity bit is added to the data bits 1011001?

  1. A2
  2. B4
  3. C1
  4. D0
4.Computer networksHard

A path has 100 Mbit/s bandwidth and a 40 ms round-trip time. How much data must be in flight to keep it fully used?

  1. A2.5 MB
  2. B4 kB
  3. C50 kB
  4. D500 kB
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

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

Set the bits to the 8-bit result of 1010 1100 << 1. What is the result's value R in decimal?

1010 1100<< 1
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 < 1126
211 − 2 = 2046 ≥ 1126 → h = 11

Prefix length

p = 32 − 11 = 21

Answer

p = /21
2.IPv4 subnetting

Answer: x = 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).

Block size

24 = 16

Subnet of this host

network: ⌊127/16⌋·16 = 112
broadcast: 112 + 16 − 1 = 127
usable hosts: 113 … 126

Answer

x = 126
3.Computer networks

Answer: D · 0

Why this is the answer

1011001 contains four 1-bits, already an even number, so the parity bit is 0. With odd parity it would be 1.

Answer

D · 0
4.Computer networks

Answer: D · 500 kB

Why this is the answer

The bandwidth-delay product is 100 × 10⁶ bit/s × 0.04 s = 4 × 10⁶ bits = 500 kB. The sender's window must be at least this large.

Answer

D · 500 kB
5.Number systems

Answer: U = 142

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

114 = 0111 0010
inverted: 1000 1101
+1 → 1000 1110

Read it as unsigned

1000 1110₂ = 256 − 114 = 142

Answer

U = 142
6.Number systems

Answer: R = 88

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

1010 1100 << 1
= 0101 1000

Value of the result

0101 1000₂ = 88

Answer

R = 88

ExamProblems · examproblems.com/courses/computer-networks