In the context of evolutionary computation, in particular genetic algorithms, there are two stochastic operations "mutation" and "crossover". What are the differences between them?
Mutation is an operation which is applied to a single individual in the population. It can e.g. introduce some noise in the chromosome. For example, if the chromosomes are binary, a mutation may simply be the flip of a (random) bit (gene).
Crossover is an operation which takes as input two individuals (often called the "parents") and somehow combines their chromosomes, so as to produce usually two other chromosomes (the "children"), which inherit, in a certain way, the genes of both parents.
If you're looking for a more serious comparison of both operators, have a look at the paper "Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems" by E. Osaba, R. Carballedo, F. Diaz, E. Onieva, I. de la Iglesia, and A. Perallos.
Evolutionary algorithms use it in a very similar way as the two terms are used in biology:
In biology, a mutation is the permanent alteration of the nucleotide sequence of the genome of an organism, virus, or extrachromosomal DNA or other genetic elements.
Chromosomal crossover [...] is the exchange of genetic material [...] that results in recombinant chromosomes during sexual reproduction.
Hence the main difference is that mutations happen within one individual while crossover is between two individuals.
Mutation is secondary operator (10%) while Crossover is Primary (90%) which creates offspring while mutation can only shuffle information within the Choromsome
I like to use the term, "recombination operator" rather than "crossover operator", because the latter term suggests a specific type of operation: constructing an offspring by switching corresponding chromosome segments between two parents. "Recombination" (to me) suggests any operation that forms an offspring from the genetic information of two parents. "Crossover" in that sense doesn't work when the individuals are, for example, permutations; but many "recombination operators" that do work are still possible, which preserve non-conflicting portions of two parent permutations.
In GA, mutation can be thought of as a relatively small random change that occurs within an individual. Mutation usually is a change of the value of one gene without making use of gene values in any other individuals, but can also be a random rearrangement of elements in a permutation, or a random change in the values of several genes. Sometimes the term is applied to a "hill climbing" procedure in which several mutations are applied to an individual and their effect on fitness is tested; then the one that produces the most fitness improvement is retained.