Algorithms, information theory and discrete math
Average information content of a random source (bits).
Analyzes running time of divide-and-conquer algorithms.
Number of positions at which two strings differ.
Minimum number of bits to represent n distinct values.
Converts a binary number to decimal.
Total nodes in a perfect binary tree of height h.
Convert a decimal number to binary by dividing by 2 and reading remainders.
Convert a hexadecimal number to decimal.
Exclusive OR: true when exactly one input is true.
Represents negative integers in binary by inverting bits and adding one.
Ordering of common algorithmic growth rates.
Runtime that grows logarithmically with input size.
Runtime of efficient comparison sorts.
Runtime that grows with the square of input size.
Runtime that doubles with each added element.
General form for analyzing divide-and-conquer recurrences.
Time to transfer data of a given size at a rate.
Number of addressable locations for n bits.
Convert a hex number to decimal by positional weights.
XOR of data bits used for error detection.
Minimum sampling rate to capture a signal without aliasing.
Maximum data rate of a noiseless channel.
Maximum error-free data rate of a noisy channel.
Parity bits r needed to protect m data bits.
Effective access time from hit time, miss rate, and penalty.
Maximum speedup from parallelizing a fraction of a task.
Number of operations completed per unit time.