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.176.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 network address of subnet 8?

192.168.176.0/24/29subnet 8 (subnet 1 starts at .0)
x =
2.IPv4 subnettingHard
last octet = 11012806403201618041211networkhost

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

10.20.237.11/29
x =
3.Computer networksMedium

Which metric does RIP use to choose routes?

  1. AHop count
  2. BLink bandwidth
  3. CBusiness policy
  4. DMeasured delay
4.Computer networksHard

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

  1. AIt agrees a shared secret over a public channel, but alone it is open to a man-in-the-middle
  2. BIt encrypts bulk data directly over a public channel, but it is far too slow for large files and video
  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
place values in two's complement1−12806413211608040211

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

1011 00018 bit
N =
6.Number systemsHard
10 bits, unsigned, N = ???????????

What is the largest unsigned integer N that fits in 10 bits?

10 bit
N =

3Solutions

1.IPv4 subnetting

Answer: x = 56

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 8

network: (8 − 1)·8 = 56
broadcast: 56 + 8 − 1 = 63

Answer

x = 56
2.IPv4 subnetting

Answer: x = 15

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 of this host

network: ⌊11/8⌋·8 = 8
broadcast: 8 + 8 − 1 = 15
usable hosts: 9 … 14

Answer

x = 15
3.Computer networks

Answer: A · Hop count

Why this is the answer

RIP is a distance-vector protocol that counts hops, with 16 meaning unreachable. This limits it to small networks.

Answer

A · Hop count
4.Computer networks

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

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

Answer: N = −79

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 + 32 + 16 + 1 = −79

Answer

N = −79
6.Number systems

Answer: N = 1023

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.

Largest value

210 − 1 = 1023

Answer

N = 1023

ExamProblems · examproblems.com/courses/computer-networks