Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
PARITY BIT:
A parity bit is an extra bit transmitted with data item select to give the resulting bit odd or even parity. For example an even parity data packet 10100001 has parity bit 1 as it has odd number of 1's. An odd parity data packet 10010111 has parity bit 0 as it has odd number of 1's.
Let us take another example, if noise or other interference produces an error one of the bits in the data will be modified from a 1 to a 0 or from a 0 to a 1. Thus the parity of giving bits will be large.
Suppose original parity and data is 10100001+1 (even parity). After interference the incorrect data is 10101001+1 and it has convert an odd parity.
LIMITATIONS OF PARITY CHECKING:
Parity can only check errors that modify in odd number of bits for example the parity and original data is 10100001+1 (even parity) and the incorrect data is 10101011+1 (even parity). We can see that even no. of bits have been modified due to noise so parity checking could not check this error. Parity generally is used to check on bit error.
ALTERNATIVE ERROR DETECTION METHODES:
In addition to parity checking alternative error detection functions have been produced. These functions differ from each other by the following respects.
Explain TCP congestion control.
Question: (a) African governments are slowly shifting to more transparent ICT regulations. However, but limited spectrum availability remains a key barrier to sustaining lon
Question : a) Below is a capture of an Ethernet II frame which contains an IPv4 packet and a TCP segment. Give the source MAC address for the frame in hexadecimal; the source I
algorithm on simple intrest
I am ryan, i am looking for data security and network assignment help, Do you have experts in data security?
i have an idea of clustering in wsns . where each and every sensor node use the reputation scheme and while clustering provide help against the selfishness atatck of the sensor nod
(a) Using the extended Euclidean algorithm, find the multiplicative inverse of 504 mod 67. (b) Decrypt the following ciphertext, which has been encrypted using Caesar cipher:
DATAGRAM REASSEMBLY Recreation of original datagram is known as reassembly. Ultimate receiver acts reassembly as given below.Fragments can reach out of order. Header bit check
(a) Using Fermat's theorem, find 3 201 mod 11. (b) Explain how the Diffie-Hellman key agreement protocol works and what its purpose and main properties are. Consider a Dif
RING topology all computers are connected in loop. A ring topology is a network topology in which every node connects to exactly two other devices, forming a single continuous pa
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd