Computer Science Formulas
Fundamental computer science formulas for information theory, algorithms, and digital logic.
Big O Notation
Understand algorithm time complexity with Big O notation. Compare how algorithms scale as input size grows.
Binary Conversion Formulas
Convert numbers between binary, decimal, and hexadecimal systems. Essential for programming and digital electronics.
Boolean Algebra Laws
The fundamental laws of Boolean algebra for digital logic design. AND, OR, NOT operations and their key identities.
Hamming Distance Formula
Calculate the number of differing positions between two binary strings. Used in error detection and correction coding.
Nyquist-Shannon Sampling Theorem
Determine the minimum sampling rate to accurately capture a signal. Essential for digital audio and signal processing.
Shannon's Entropy Formula
Measure the information content and uncertainty in data. The foundation of information theory and data compression.