liveBook · Manning

Discrete distribution

A discrete probability distribution assigns probability mass to outcomes in a finite or countably infinite set of distinct values.

How 2 Manning books explain it

Fabulous Adventures in Data Structures and Algorithms

A discrete probability distribution assigns probabilities to outcomes in a finite or countably infinite set.

How it is used
Replaces direct Random.Next calls with distributions that expose sampling, support, and relative likelihoods.
How deep it goes
Defines PMFs, supports, and integer weights, then compares sampling algorithms without developing their full implementations here.
Examples
Uses dice, unfair coins, weighted marbles, C# sampling, and filtering categories from categorical distributions.
What you can do after
Build finite random-value abstractions with IDiscreteDistribution<T> instead of scattering direct Random calls through program logic.

Read how Fabulous Adventures in Data Structures and Algorithms explains discrete distribution →

Grokking Statistics

A probability distribution whose possible outcomes form a finite or countably infinite set of distinct values.

How it is used
Models probabilities for finite categorical, binary, or integer outcomes such as product colors or trial successes.
How deep it goes
Defines probability assignment, validates totals, visualizes categories, and samples outcomes, without deriving distribution formulas.
Examples
Uses controller color sales, probability tables, bar charts, printed probabilities, and random category sampling.
What you can do after
Apply it via Python, Matplotlib, and NumPy to calculate, visualize, print, and sample categorical probabilities.

Read how Grokking Statistics explains discrete distribution →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.