Assume that the 8-bit input word is 11101011: I. Please calculate the check bits (code). II. Suppose now that data bit 5 sustains an error and is changed from 0 to 1, recalculated the check bits. III. Now compare the new check bits with the old check bits to find the position for the data error bit.

Assume that the 8-bit input word is 11101011: I. Please calculate the check bits (code). II. Suppose now that data bit 5 sustains an error and is changed from 0 to 1, recalculated the check bits. III. Now compare the new check bits with the old check bits to find the position for the data error bit.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: in the complement addition and subtraction, the use of two sign bit to determine the overflow, the…

A: determine the overflow

Q: 5. For the 8-bit word 11010001, calculate the check bits to be stored with it. Suppose when the word…

A: Below is the answer to above question. I hope this will be helpful for you..

Q: 1.) When adding single bits, we usually also consider a carry-in bit, as well as a carry-out bit.…

A: When adding single bits, we usually aslo consider a carry-in bit, as well as a carry-out bit. This…

Q: Assume we have a 2's complement system with an 8-bit whole number part and a 2-bit fractional part.…

A: As per our guidelines we are suppose to answer one question, please repost other question as…

Q: Convert -0.6 to a 16 bit floating point number. (Sign:1-bit Exp:5-bit Mant:10-bit excess-15) Convert…

A: 16 bit floating point number is called Half. The Half type is more precisely described as a base-2…

Q: There is an error in the following 7-bit Hamming code with EVEN parity bits. P7 P1 0 0 P2 P3 1 0 P4…

A: To determine the position of the erroneous bit and the correct code, we need to first calculate the…

Q: 4. The result of n-bit 2's complement addition is always correct (regardless of carry out) as long…

A: 2's complement means simply converting 1's as 0's and 0's as 1's. Generally, 2's complement is done…

Q: Write a Verilog continuous assignment statement or a VHDL signal assignment statement that compares…

A: Verilog is a programming language for hardware. Mostly used to design electronic circuits

Q: Convert the following binary and hexadecimal num- bers to floating point format. Assume a binary…

A: given:Assume a binary format consisting of a sign bit (negative = 1), a base 2, 8-bit, excess-128…

Q: Can you distinguish between the most significant and least significant bits?

A: Base 2 is used to denote binary number. A binary number bits can be either 0 or 1. Since there are…

Q: Explain what even parity coding is and give one example of what it is used for. By adding 1 parity…

A: Parity code: The parity code is used to detect errors during the transmission of binary information.…

Q: Exercise on Hamming Code An 8-bit data word stored in memory is 00111100, while word fetched from…

A: Given,An 8-bit data word stored in memory is 00111100, while word fetched from the memory is…

Q: 8. The generator polynomial is given by X¹+X³+1. (a) Encode the data bits, 00111011001, using CRC.…

A: According to the information given:- We have to define the generator polynomial is given by…

Question

Assume that the 8-bit input word is 11101011:
I. Please calculate the check bits (code).
II. Suppose now that data bit 5 sustains an error and is changed from 0 to 1, recalculated the check bits.
III. Now compare the new check bits with the old check bits to find the position for the data error bit.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

F - Assuming a three-bit exponent field and a four-bit significand, write the bit pattern for the following decimal values: (i) –12.5 (ii) 13.0
Give the bit pattern that would result from a bitwise AND, OR and XOR operation on the following two bit patterns: 10101010 11110000 AND: OR: XOR:
Q1) Express 0.62510 in the revised 14-bit floating-point model Q2) Express -32. 25y0 in the revised 14-bit floating-point model Q3) Find the sum of 1410 and 0.25p using the 14-bit floating-point model.
8. Add the following two 8-bit binary numbers, producing an 8-bit result. Indicate the status of the carry and overflow bits at the end of the addition by circling the appropriate choices. The space in between is only for readability. 1111 0010 + 1101 0110 ----------- Overflow? Yes or No Carry? Yes or No
- In a codeword, we add two redundant bits to each 8-bit data word. Find the following: Number of valid codewords , Number of invalid codewords. - If we want to be able to detect 2-bit errors, what should be the minimum Hamming distance? - In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many 0s need to be added to the dataword to make the dividend? What is the size of the remainder? What is the size of the divisor?
7. Add the following two 8-bit binary numbers, producing an 8-bit result. Indicate the status of the carry and overflow bits at the end of the addition by circling the appropriate choices. The space in between is only for readability. 1101 0110 + 1001 0111 -------------- Overflow? Yes or No Carry? Yes or No
6. For an 8-bit operand, specify the 8-bit mask and the logical operator to perform the following operations. Bit positions are numbered 7-0, left to right. a. Logical Operator: Logical Mask: b. Set all bits to 1. Logical Operator: C. Clear bits 5, 4, 3, and 2 to 0. All other bits remain unchanged. Logical Mask: d. Complement bits 2, 1, and O. All other bits remain unchanged. Logical Operator: Logical Mask: Set bits 7, 6, and 5 to 1. All other bits remain unchanged. Logical Operator: Logical Mask:
(b) A floating point number has the 12 bit binary sequence 1011 11011101. The first four bits are for the exponent, which has a bias of 7, and the next eight bits are for the mantissa, with no hidden bit and its leading bit is the sign bit, (i) (ii) What decimal number does this binary sequence represent? In this resulting decimal number, how many digits can you trust?
please help with both
a. Assume (F43)(16) and (1B7)(16) are unsigned 12-bit Hexadecimal integers.CalculateF43 -1B7. Is there overflow?b. Assume 185 and 122 are unsigned 8-bit decimal integers. Calculate185 - 122. Is there overflow?c. Calculate (1100 1101)2 + (1100 10101)2
Question 1. and {C,D} form the two 2-bit numbers N1 and N2. The circuit will perform the difference N1 – N2 and gives output bits F (MSB) and G. Assume that the circuit never sees the combinations of inputs in which N1 is less than N2 i.e. you can regard those input combinations as don't care Consider a 2-bit binary subtractor defined as follows. The inputs {A,B} conditions. а. Fill in the truth table for F and G. b. Fill in the K-map for the minimum sum of products expressions for the function F and G.