If a bit is present at a point otherwise dedicated to a parity bit but is not used for parity, it may be referred to as a mark parity bit if the parity bit is always 1, or a space parity bit if the bit is always 0.For a given set of bits, if the count of bits with a value of 1 is even, the parity bit value is put to 1 make the total count of 1s in the whole set (including the parity bit) an odd number. parity was also used on at least some paper-tape (punched tape) data entry systems (which preceded magnetic tape systems).Parity in this form, apply across multiple parallel signals, is known as a transverse redundancy check. In a parallel bus, there is one longitudinal redundancy check bit per parallel signal.

COMING SOON!

```
/**
* Problem : Determine parity of a number.
* Parity refers to whether number contains odd or even number of set bits
* Approach: We loop till number becomes zero and invert parity while unsetting
* right most set bit.
*/
#include <iostream>
bool getparity( int num )
{
bool parity = false;
while( num ) {
parity = !parity;
num = (num & (num - 1));
}
return parity;
}
int main()
{
int num;
std::cout << "Enter number:";
std::cin >> num;
std::cout << "Parity of num is "
<< (getparity(num) ? "odd" : "even")
<< std::endl;
return 0;
}
```