Question Bank - ICT

Here's the question bank on all the ICT topics.

What is parity checking?

A.
A method used to check that data has reached the destination
B.
A method to check whether data has been changed or is corrupted
C.
A method to check that number is even or odd
D.
A method to check that data is in serial or parallel order

Solution:

Parity checking is the process that ensures accurate data transmission between nodes during communication. A parity bit, or check bit, is a bit added to a string of binary code. Parity bits are a simple form of error detecting code. It is the simplest technique for detecting and correcting errors. The MSB of an 8-bits word is used as the parity bit and the remaining 7 bits are used as data or message bits. Because of its simplicity, parity is used in many hardware applications where an operation can be repeated in case of difficulty, or where simply detecting the error is helpful. The primary advantages of parity are its simplicity and ease of use. Its primary disadvantage is that sometimes, it may fail to catch errors. If two data bits are corrupted, for instance, parity will not detect the error. It also checks whether the data is in serial or in parallel order. Hence parity checking is a method to check that data is in serial or parallel order. Additional InformationData corruption refers to errors in computer data that occur during writing, reading, storage, transmission, or processing, which introduce unintended changes to the original data. Computer, transmission, and storage systems use a number of measures to provide end-to-end data integrity or lack of errors.

For more questions,

Click Here

Download Gyanm App

free current affairs for competitive exams

Scan QR code to download our App for
more exam-oriented questions

free current affairs for competitive exams

OR
To get link to download app

Thank you! Your submission has been received. You will get the pdf soon. Call us if you have any question: 9117343434
Oops! Something went wrong while submitting the form.