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

The network 192.168.10.0/24 must be divided into at least 3 equal subnets. If you borrow as few bits as possible, how many usable hosts H does each subnet have?

192.168.10.0/243 subnets
H =
2.IPv4 subnettingHard
third octet 124 … 126012816413211618140201commonvaries

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

10.115.124.0/24 … 10.115.126.0/24
p =
3.Computer networksMedium

Which metric does RIP use to choose routes?

  1. AMeasured delay
  2. BBusiness policy
  3. CLink bandwidth
  4. DHop count
4.Computer networksHard

Which mechanism prevents broadcast loops in a network with redundant switch links?

  1. ASpanning Tree Protocol
  2. BARP caching
  3. CNAT
  4. DDHCP snooping
5.Number systemsMedium
8-bit two's complement0−12806403201608040201

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

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

Set the bits to the 8-bit result of 1100 0001 OR 1011 0111. What is the result's value R in decimal?

1100 0001OR1011 0111
R =

3Solutions

1.IPv4 subnetting

Answer: H = 62

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

22 = 4 ≥ 3 → b = 2, /26

Hosts per subnet

26 − 2 = 62

Answer

H = 62
2.IPv4 subnetting

Answer: p = 22

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

124 = 01111100
126 = 01111110
common leading bits: 6

Prefix length

p = 16 + 6 = 22

Answer

p = /22

Summary route: 10.115.124.0/22 (it also covers 1 network(s) that are not in the list).

3.Computer networks

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

D · Hop count
4.Computer networks

Answer: A · Spanning Tree Protocol

Why this is the answer

STP elects a root bridge and blocks redundant paths, unblocking them if an active link fails.

Answer

A · Spanning Tree Protocol
5.Number systems

Answer: U = 249

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

7 = 0000 0111
inverted: 1111 1000
+1 → 1111 1001

Read it as unsigned

1111 1001₂ = 256 − 7 = 249

Answer

U = 249
6.Number systems

Answer: R = 247

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

OR gives 1 where at least one bit is 1.

1100 0001
OR 1011 0111
= 1111 0111

Value of the result

1111 0111₂ = 247

Answer

R = 247

ExamProblems · examproblems.com/courses/computer-networks