Formulas

Question 1

Amdahl’s Law

Answer 1

1 / ((1-P) + P/N)
Amdahl’s law states that if P is the proportion of a program that can be made parallel (i.e. benefit from parallelization), then the maximum speedup that can be
achieved by using N processors is:

Question 2

Bytes to bits

Answer 2

1 byte = 8 bits

Question 3

Mega, Giga, Tera, Peta

Answer 3

1 mega = 1 e6
1 giga = 1e9
1 tera = 1e12
1 peta = 1e15

Question 4

The false positive probability of a lookup in Bloom filter

Answer 4

(1 - e^(- kn/m))^k,
where n is the number of unique items inserted to the Bloom filter so far, k is the (optimal) number of hash functions, m is the memory in bits

Question 5

The optimal number of hash functions

Answer 5

k = m/n ln(2),

m is memory in bits, n is the number of unique items inserted