# CS601 Assignment No 5 Spring 2012 solution

Q. 1. Suppose a sender sent a word “assignment” for which the receiver received the following binary:

“01100001011010010111001101101001011001110110111001101110011001010110111001110100”

By applying the complete process of LRC using even parity, you are required to check that, is the same word received by the receiver or not? Also write the word received by the receiver.

 Binary Code Alphabet Binary Code Alphabet Binary Code Alphabet Binary Code Alphabet 0110 0001 a 0110 1000 h 0110 1111 o 0111 0110 v 0110 0010 b 0110 1001 i 0111 0000 p 0111 0111 w 0110 0011 c 0110 1010 j 0111 0001 q 0111 1000 x 0110 0100 d 0110 1011 k 0111 0010 r 0111 1001 y 0110 0101 e 0110 1100 l 0111 0011 s 111 1010 z 0110 0110 f 0110 1101 m 0111 0100 t 0110 0111 g 0110 1110 n 0111 0101 u

Table 1

HINT: First convert the word “assignment” into binary equivalent with the help of the given table 1. The LRC calculated by the sender is not appended with the given binary. It is also your task to calculate the LRC by yourself.

Q1 ….. Solution

Word sent

01100001    a

01110011    s

01110011    s

01101001    i

01100111    g

01101110    n

01101101    m

01100101    e

01101110    n

01110100    t

…………

00010011    LRC

………………………………………………

01100001    a

01101001    i

01110011    s

01101001    i

01100111    g

01101110    n

01101110    n

01100101    e

01101110    n

01110100    t

…………

00001010    LRC

Word sent and word received is not same!