A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.

NOTE: Only questions about software development related to discrete mathematics are on topic. Discrete mathematics is the branch of mathematics concerned with discrete phenomena – as opposed to continuous phenomena like geometry, real analysis, physics, etc. Typical discrete math topics are discrete probability, combinatorics, graph theory, algorithms and complexity, but also matrices, difference equations, recurrences.

The git-flow workflow defines a strict branching model designed around a project release. It provides a robust framework for managing larger projects. Use this tag for help with applying git-flow to your workflow, or for help with the supporting scripts (either the original scripts or the AVH Edition).

Questions about the API provided by Box, Inc. for their online storage service.

NAnt is a build tool for .Net, aiming to support all the various versions of the .Net framework, including all versions of Microsoft .NET, Compact Framework and Silverlight, Mono and Moonlight. Additionally, there is a contribution project called NAntContrib, adding support for additional .Net tools (FxCop, NGen, GacUtil, Wsdl, XSD, MSBuild) and systems like PVCS, StarTeam, Visual SourceSafe, Surround SCM and Microsoft BizTalk.

Data sanitization to prevent code injection

Scalaz provides type classes and purely functional data structures for Scala

The LocationManager class in Android provides access to the system location services. These services allow applications to obtain periodic updates of the device's geographical location, or to fire an application-specified Intent when the device enters the proximity of a given geographical location.

On Mac OS X, the NSOperationQueue class regulates the execution of a set of NSOperation objects.

Use this tag only when [behavior] is the name of a language/framework construct.

The knapsack problem is a problem in combinatorial optimization: Given a set of items with associated weights and values, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and it maximizes the total value. It is an NP-complete problem, but several common simplifications are solved efficiently with dynamic programming.