Proving the Central Limit Theorem via Fourier analysis of probability measures, why heavy-tailed Cauchy distributions break convergence, and the Berry-Esseen error bound.
Why sums of independent random variables converge to the Gaussian distribution, how the √n scaling law governs sample means, and how the CLT drives statistical inference.
Why asymptotic limit theorems aren't enough for randomized algorithms: deriving Markov, Chebyshev, and exponential Chernoff tail bounds.
How operating systems select victim frames under memory pressure: Bélády's anomaly in FIFO, the hardware cost of exact LRU, and the Second-Chance Clock approximation.
Why flat page tables fail at 32-bit and 64-bit scale, how segmentation differs from paging, and how radix multi-level page tables solve the memory overhead.