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.10.0/24 must be divided into at least 8 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?

192.168.10.0/248 subnets
H =
2.IPv4 subnettingHard
third octet 56 … 63012806413211618040201commonvaries

A router has routes to these networks: 10.97.56.0/24, 10.97.57.0/24, 10.97.58.0/24, 10.97.59.0/24, 10.97.60.0/24, 10.97.61.0/24, 10.97.62.0/24, 10.97.63.0/24. What is the longest prefix length p of a single summary route that covers all of them?

10.97.56.0/24 … 10.97.63.0/24
p =
3.Computer networksMedium

How many usable host addresses does a /24 IPv4 network have?

  1. A254
  2. B256
  3. C252
  4. D255
4.Computer networksHard

What does the Diffie-Hellman key exchange achieve on its own, and what is its weakness?

  1. AIt encrypts bulk data directly over a public channel, but it is far too slow for large files and video
  2. BIt agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle
  3. CIt authenticates both users with passwords, but needs a central server
  4. DIt signs certificates for websites, but only works with short keys
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

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

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

4678
b = bit

3Solutions

1.IPv4 subnetting

Answer: H = 30

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

Bits to borrow

23 = 8 ≥ 8 → b = 3, /27

Hosts per subnet

25 − 2 = 30

Answer

H = 30
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

56 = 00111000
63 = 00111111
common leading bits: 5

Prefix length

p = 16 + 5 = 21

Answer

p = /21

Summary route: 10.97.56.0/21

3.Computer networks

Answer: A · 254

Why this is the answer

A /24 has 8 host bits, so 2⁸ = 256 addresses. The network and broadcast addresses are reserved, leaving 254 for hosts.

Answer

A · 254
4.Computer networks

Answer: B · It agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle

Why this is the answer

Diffie-Hellman lets two parties derive the same secret that eavesdroppers cannot compute. An attacker in the middle can run separate exchanges with each side unless the values are signed or otherwise authenticated.

Answer

B · It agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle
5.Number systems

Answer: U = 165

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

91 = 0101 1011
inverted: 1010 0100
+1 → 1010 0101

Read it as unsigned

1010 0101₂ = 256 − 91 = 165

Answer

U = 165
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 < 4678
213 = 8192 ≥ 4678

Answer

b = 13

ExamProblems · examproblems.com/courses/computer-networks