How deeply does Grokking Data Structures cover modulo arithmetic?

Defines remainders through an eight-element array example and stops short of broader mathematical treatment.

Modulo arithmetic

As explained in Grokking Data Structures

Modular arithmetic is arithmetic in which values are considered equivalent when they have the same remainder under a specified modulus.

Modulo arithmetic uses the remainder after division to map a continuing sequence back onto a fixed set of positions. In a circular queue, this lets virtual indexes wrap from an array’s end to its beginning. section 9.7

Wrapping an eight-element array

For an array indexed from 0 to 7, 8 % 8 equals 0, 9 % 8 equals 1, and 10 % 8 equals 2. Thus, virtual index 8 refers to array index 0, allowing the rear pointer to continue after the array’s end. section 9.7

How Grokking Data Structures covers it

liveBook manning.com

Read Grokking Data Structures on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Hacking CryptographyArithmetic in which values are identified according to their remainders modulo a specified integer.
liveBook manning.com

Real-World CryptographyModular arithmetic is arithmetic in which values are identified according to their remainders after division by a fixed modulus.

Compare how 3 books explain modulo arithmetic →

Related concepts

size_timplemented by · size_t is an unsigned integer type in C and C++ used to represent object sizes and related counts.
dataset splitused by · A dataset split is the division of a dataset into distinct subsets assigned different purposes, such as training, validation, or testing.
integer wraparoundimplemented by · Integer wraparound is arithmetic behavior in which an out-of-range fixed-width integer result cycles or is reduced modulo the type’s representable range.
elliptic curve point additionused by · Elliptic-curve point addition combines two curve points according to the curve's group law to produce another curve point.
unsigned integerimplemented by · An unsigned integer is an integer type or representation whose values are nonnegative, with its representable range determined by its bit width and applicable rules.

This explainer was generated by Manning's knowledge graph from the text of Grokking Data Structures. The section links point to the parts of the book it draws on.