A sender needs to send the four data items 0x1236, 0xABCC, 0x03BC, and 0xEEEE. To avoid confusion, 0x is written in the prefix to denote that the data is in Hexadecimal. For example, 0x3456 is 3456 in hexadecimal. Now answer the following: i. Find the checksum at the sender site. ii. Find the checksum at the receiver site if there is no error . iii. Find the checksum at the receiver site if the second data item is changed to 0xABCE and the third data item is changed to 0x02BA.

PROBLEM 1: HEXADECIMAL TABLE • Convert 1010101111001101 from unsigned binary to hexadecimal. • Convert 11111110001000010011 from unsigned binary to hexadecimal. • Convert 000101000111 from unsigned binary to hexadecimal. • Convert 0101000101 from unsigned binary to hexadecimal. • Convert 11001101 from unsigned binary to hexadecimal. [Short Answer] Why do we use the hexadecimal notation? What to put in your HW Write-Up: • Answer the five problems above. • Write at least a paragraph (3-5 sentences) in answering the short answer question above. If you use a reference, make sure to list your reference. PROBLEM 2: BOOLEAN ALGEBRA Remember: • The NOT operator has highest priority, followed by AND then OR. • XY means X AND Y, X + Y means X OR Y, X̅ means NOT X Create the truth tables for the below functions; where X, Y, Z equals the binary listed below: F(X, Y, Z) = XY + Z F(X, Y, Z) = Y + Z̅X F(X, Y, Z) = Z + YX̅ F(X, Y, Z) = ZY + X̅ X Y Z 0 1 0 1 1 0 1 1 1 0 0 0 1 1 1 1 0 1 1 0 1 0 0 0 What…

Add the following 6-bit two's complement numbers. Give your ansvwer in binary and hexadecimal. Also answer the question: did overflow occur? Ox2C + Ox35 Do not include the "Ox" prefix in your hexadecimal answer. For example, if your answer were O×1B, then you would enter: 1B. Result in binary: Result in hexadecimal: Did overflow occur? (answer yes or no):

Decode the message without encoding techniques.(I need an explanation on how it's done.  Having diffulties. Thanks)   01001110 01100101 01110110 01100101 01110010 00100000 01100111 01101111 01101110 01101110 01100001 00100000 01100111 01101001 01110110 01100101 00100000 01111001 01101111 01110101 00100000 01110101 01110000 00001010 01001110 01100101 01110110 01100101 01110010 00100000 01100111 01101111 01101110 01101110 01100001 00100000 01101100 01100101 01110100 00100000 01111001 01101111 01110101 00100000 01100100 01101111 01110111 01101110 00001010 01001110 01100101 01110110 01100101 01110010 00100000 01100111 01101111 01101110 01101110 01100001 00100000 01110010 01110101 01101110 00100000 01100001 01110010 01101111 01110101 01101110 01100100 00100000 01100001 01101110 01100100 00100000 01100100 01100101 01110011 01100101 01110010 01110100 00100000 01111001 01101111 01110101 00001010 01001110 01100101 01110110 01100101 01110010 00100000 01100111 01101111 01101110 01101110 01100001…

What is the result of the following binary subtraction? (11011001)2 - (01101010)2 None of the other choices listed here is correct. (1001111) 2 (1011111)2 (1101011)2 (1101111)2 (1100111)2

If we use the 128-bit binary field extension F 128 to decode the 127-bit binary BCH code at a distance of 6, we get a total of 127 bits. How big is the code, and is there a guaranteed minimum separation?

Consider the example below that shows both the payload and the two- dimensional parity bits (shown in green), and where exactly one of the payload or parity bits shown has been corrupted. In this example, odd parity is used. - 11000100 001111000 01010010010101101 00110111 100011001 11110110011011111 10111011 110011100 00010011 100110000 Please indicate the row and the column location of the bit that has flipped from its original value.

One way of detecting errors is to transmit data as a block of n rows of k bits per row and adding parity bits to each row and each column. The lower-right corner is a parity bit that checks its row and its column, Will this scheme detect all single errors? Double errors? Triple errors?

III. Consider the example below that shows both the payload and the two-dimensional parity bits (shown in green), and where exactly one of the payload or parity bits shown has been corrupted. In this example, odd parity is used. - 11000100001111000 01010010010101101 00110111 100011001 11110110011011111 10111011 110011100 00010011 100110000 Please indicate the row and the column location of the bit that has flipped from its original value.

When the result of an unsigned arithmetic operation is too big to fit into the destination, what flag is set?