Digital Electronics - Ex-OR and Ex-NOR Gates - Discussion

Odd parity means that the total number of 1s in the data word (including the parity bit) should be odd. To determine the odd parity bit for each given data word:

1) 1011101.
Number of 1s: 5 (already odd).
Odd parity bit: 0.
Final word with parity: 10111010.

2) 11110111
Number of 1s: 7 (already odd)
Odd parity bit: 0
Final word with parity: 111101110.

3) 1001101.
Number of 1s: 4 (even).
Odd parity bit: 1.
Final word with parity: 10011011.

According to me odd parity is equals to number of ones = 5 so 5 is odd number p = 1;also remaining same.

It's odd parity, so the total number of 1s (including the parity bit) should be odd.

The total numbers of 1s (including parity bit) should ultimately remain even. Correct me if I am wrong?

But according to me answer must be 1st. Because it ask for odd parity that means if no. of once is odd, odd parity must be high = 1. Please clarify.

Parity is nothing checking no.of 1's and in the given question it is given to follow odd parity i.e. no.of 1's in given byte should be odd and if it is not odd we need to add 1 in order to make it odd parity.

First try for 2 bit then analyised then you will see each odd no given to last bit one. Then odd priority become 0, if it is not matched then it become 1.

if no. of 1s r odd the put 0 as a odd parity and viceversa