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
255.255.255.22411111111111111111111111111100000network bitshost bits

A subnet uses the mask 255.255.255.224. How many usable host addresses H does it have?

255.255.255.224
H =
2.IPv4 subnettingHard
last octet = 191112806413211618141211networkhost

A host has the address 10.20.107.191/26. What is the fourth octet x of its network address?

10.20.107.191/26
x =
3.Computer networksMedium

Which medium access method did classic shared (half-duplex) Ethernet use?

  1. ATDMA
  2. BCSMA/CD
  3. CCSMA/CA
  4. DToken passing
4.Computer networksHard

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

  1. ASpanning Tree Protocol
  2. BDHCP snooping
  3. CNAT
  4. DARP caching
5.Number systemsMedium
place values in two's complement1−12806413201618140201

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

1010 11008 bit
N =
6.Number systemsHard
click the bits to set them012806403201608040201

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

1010 1000<< 1
R =

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

Prefix length

255.255.255.224 = /27

Usable hosts

25 − 2 = 30

Answer

H = 30
2.IPv4 subnetting

Answer: x = 128

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

26 = 64

Subnet of this host

network: ⌊191/64⌋·64 = 128
broadcast: 128 + 64 − 1 = 191
usable hosts: 129 … 190

Answer

x = 128
3.Computer networks

Answer: B · CSMA/CD

Why this is the answer

Carrier sense multiple access with collision detection: stations stop when they detect a collision and retry after a random backoff. Full-duplex switched Ethernet has no collisions.

Answer

B · CSMA/CD
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: N = −84

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 + 8 + 4 = −84

Answer

N = −84
6.Number systems

Answer: R = 80

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 1000 << 1
= 0101 0000

Value of the result

0101 0000₂ = 80

Answer

R = 80

ExamProblems · examproblems.com/courses/computer-networks