Scribd
Upload
2 views17 pages

IT Presentation

Uploaded by

Carissa Bachan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views17 pages

IT Presentation

Uploaded by

Carissa Bachan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Parity

Check
Verification and Validation
presentation
QUESTION :

WHAT IS A PARTIY
CHECK ?
A parity check is a form of data verification.

ANSWE
A parity check is an error detection method used to
verify the integrity of binary data.

Rdata: transmitted or stored hasn't been


It ensures that
corrupted by checking if the number of 1s in a byte of
data is odd or even.

If an error occurs and the parity check fails, the


receiver knows the data is incorrect, signaling a need
for retransmission.
QUESTION :

HOW DO PARTIY
CHECKS WORK ?
ANSWER :
A parity check works by adding
a parity bit (1 or 0) to a set of
binary data to ensure that the
total number of 1s follows a
specific rule (either even or
odd).

Even Parity: The parity bit


ensures the total number of 1s
in the data (including the parity
bit) is even.
EXAMPLE OF HOW
IT
- ‘DataWORKS:
to send’: ‘1010101’ (which has four 1s).
- If using ‘even parity’, a ‘0’is added to keep the total
number of 1s even: `10101010`.
- If using ‘odd parity’, a ‘1’ is added to make the
number of 1s odd: ‘10101011’.

The receiver checks if the parity condition holds. If


not, it knows there's been an error in the transmission
and may request retransmission of the data.
QUESTION :
What if the number of
1s is already
even/odd?
-If the number of 1s is already even in an even parity
ANSWER:
check, the system will add a parity bit of 0. This
ensures that the total number of 1s remains even,
maintaining the parity rule.

-If the number of 1s is already odd in an odd parity


check, the system will add a parity bit of 0 to
maintain the odd number of 1s. This ensures that the
total count of 1s stays odd, aligning with the rule of
odd parity.
QUESTION :
What are the
advantages of parity
checks?
ANSWER :
Easy to Use: It's simple to add a parity bit
and check for errors, making it popular for
basic error detection.

Quick to Detect Errors: It works fast and


can detect if something goes wrong
during data transmission.
ANSWER :
Low Cost: Since it only adds one extra bit
to the data, parity checks don’t take up
much space or slow the computer down.

Good for Small Errors: Parity checks work


well when there’s just one small error (like
one bit changing).
QUESTION :
What are the
disadvantages of
parity checks?
ANSWER :
Limited to Small Errors: It only works for
single-bit errors. If multiple errors occur,
the parity check may not detect them.

Can't Fix Errors: Parity checks can notify


the user that there’s an error in the
code, but it cannot correct it . The data
must be retransmitted.
.
ANSWER :
Not Ideal for Important Data: If perfect data
accuracy is needed, parity checks aren’t
the best option since they might miss
bigger errors in the code.

Possibility of False Alarms: Sometimes,


parity checks might detect an error even
when the data is correct, causing
unnecessary retransmissions.
EXAMPLES OF SYSTEMS THAT
USE PARITY CHECKS:
-Computer memory

-Data transmission

-Raid systems
( Redundant Array
of Independent
Disks)
This simple error detection technique is often
used in communication systems and memory
storage devices.
THANK YOU FOR
YOUR ATTENTION!
THIS PRESENTATION WAS
DONE BY:
SANJANA KANDHAI
CARISSA BACHAN
KHATIJA BOODRAM

You might also like