Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 1.10, Problem 6QE
Explanation of Solution
Hamming Distance:
The hamming distance between two bit patterns is the number of bits in which the patterns differ.
There are many codes possible for this scheme.
- Start with A with five bits pattern length
- The Hamming distance between the patterns representing A and B in the code in Table 1 is four.
- The Hamming distance between B and C in the code in Table 1 is three.
- The Hamming distance between A and D in the code in Table 1 is three.
- The Hamming distance between B and D in the code in Table 1 is three.
- The important feature of the code in Table 1 is that any two patterns are separated by a Hamming distance of at least three
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
How do you determine the error detection and
error correction capabilities of a given code
with known minimum distance? Illustrate for a
particular minimum distance.
In a given 32-bit floating-point representation of numbers, if the number of bits of the mantissa is reduced to accommodate an increase in the number of bits of the exponent, this will result in the following:
(select the best answer)
Increased range of the numbers at the expense of the precision
Increased precision of the numbers at the expense of the range
Both range and precision increase
Both range and precision decrease
Suppose that we use the floating-point format with 12 decimal digits, SEEEMMMMMMMM, to rep-
resent a real number, where S is the digit to represent the sign of the mantissa (use 0 for pos-
itive and 5 for negative), EEE are the 3 digits to represent the exponent in excess-500 format,
MMMMMMMM are the 8 digits to represent the magnitude of the mantissa, and the decimal point of
the mantissa is right to the left of MMMMMMMM (i.e., SEEEMMMMMMMM representing the real number
+0.MMMMMMMM × 10EEE-500)
What are the smallest positive number and the largest positive number that can
be represented in this format? Write them in exponential notation.
Chapter 1 Solutions
Computer Science: An Overview (12th Edition)
Ch. 1.1 - What input bit patterns will cause the following...Ch. 1.1 - In the text, we claimed that placing a 1 on the...Ch. 1.1 - Assuming that both inputs to the flip-flop in...Ch. 1.1 - a. If the output of an AND gate is passed through...Ch. 1.1 - Prob. 5QECh. 1.1 - Prob. 6QECh. 1.2 - If the memory cell whose address is 5 contains the...Ch. 1.2 - Prob. 2QECh. 1.2 - How many bits would be in the memory of a computer...Ch. 1.3 - Prob. 1QE
Ch. 1.3 - Prob. 2QECh. 1.3 - Prob. 3QECh. 1.3 - Prob. 4QECh. 1.3 - Prob. 5QECh. 1.3 - Prob. 6QECh. 1.4 - Here is a message encoded in ASCII using 8 bits...Ch. 1.4 - In the ASCII code, what is the relationship...Ch. 1.4 - Prob. 3QECh. 1.4 - Prob. 4QECh. 1.4 - Convert each of the following binary...Ch. 1.4 - Prob. 6QECh. 1.4 - What is the largest numeric value that could be...Ch. 1.4 - An alternative to hexadecimal notation for...Ch. 1.4 - What is an advantage of representing images via...Ch. 1.4 - Prob. 10QECh. 1.5 - Convert each of the following binary...Ch. 1.5 - Convert each of the following base ten...Ch. 1.5 - Convert each of the following binary...Ch. 1.5 - Express the following values in binary notation:...Ch. 1.5 - Perform the following additions in binary...Ch. 1.6 - Convert each of the following twos complement...Ch. 1.6 - Prob. 2QECh. 1.6 - Suppose the following bit patterns represent...Ch. 1.6 - Suppose a machine stores numbers in twos...Ch. 1.6 - In the following problems, each bit pattern...Ch. 1.6 - Prob. 6QECh. 1.6 - Prob. 7QECh. 1.6 - Prob. 8QECh. 1.6 - Prob. 9QECh. 1.6 - Prob. 10QECh. 1.6 - Prob. 11QECh. 1.7 - Prob. 1QECh. 1.7 - Prob. 3QECh. 1.7 - Prob. 4QECh. 1.8 - What makes Python an interpreted programming...Ch. 1.8 - Write Python statements that print the following:...Ch. 1.8 - Write Python statements to make the following...Ch. 1.8 - Write a Python statement that given an existing...Ch. 1.9 - Prob. 1QECh. 1.9 - Prob. 2QECh. 1.9 - Prob. 3QECh. 1.9 - Prob. 4QECh. 1.9 - Prob. 5QECh. 1.9 - Prob. 6QECh. 1.9 - Prob. 7QECh. 1.10 - Prob. 1QECh. 1.10 - Could errors have occurred in a byte from Question...Ch. 1.10 - Prob. 3QECh. 1.10 - Prob. 4QECh. 1.10 - Prob. 5QECh. 1.10 - Prob. 6QECh. 1 - Determine the output of each of the following...Ch. 1 - a. What Boolean operation does the circuit...Ch. 1 - a. If we were to purchase a flip-flop circuit from...Ch. 1 - Assume that both of the inputs in the following...Ch. 1 - The following table represents the addresses and...Ch. 1 - How many cells can be in a computers main memory...Ch. 1 - Prob. 7CRPCh. 1 - Prob. 8CRPCh. 1 - Prob. 9CRPCh. 1 - Prob. 10CRPCh. 1 - Suppose a picture is represented on a display...Ch. 1 - Prob. 12CRPCh. 1 - Prob. 13CRPCh. 1 - If each sector on a magnetic disk contains 1024...Ch. 1 - How many bytes of storage space would be required...Ch. 1 - Prob. 16CRPCh. 1 - Prob. 17CRPCh. 1 - Suppose a typist could type 60 words per minute...Ch. 1 - Prob. 19CRPCh. 1 - Prob. 20CRPCh. 1 - Prob. 21CRPCh. 1 - Prob. 22CRPCh. 1 - Prob. 23CRPCh. 1 - Prob. 24CRPCh. 1 - Prob. 25CRPCh. 1 - Prob. 26CRPCh. 1 - Prob. 27CRPCh. 1 - Prob. 28CRPCh. 1 - Prob. 29CRPCh. 1 - Prob. 30CRPCh. 1 - Prob. 31CRPCh. 1 - Prob. 32CRPCh. 1 - Prob. 33CRPCh. 1 - Prob. 34CRPCh. 1 - Prob. 35CRPCh. 1 - Prob. 36CRPCh. 1 - Prob. 37CRPCh. 1 - Prob. 38CRPCh. 1 - Prob. 39CRPCh. 1 - Prob. 40CRPCh. 1 - Prob. 41CRPCh. 1 - Prob. 42CRPCh. 1 - Prob. 43CRPCh. 1 - Prob. 44CRPCh. 1 - Prob. 45CRPCh. 1 - What would be the hexadecimal representation of...Ch. 1 - Prob. 47CRPCh. 1 - Prob. 48CRPCh. 1 - Prob. 49CRPCh. 1 - Prob. 50CRPCh. 1 - Prob. 51CRPCh. 1 - Prob. 52CRPCh. 1 - Prob. 53CRPCh. 1 - Prob. 54CRPCh. 1 - Prob. 55CRPCh. 1 - Prob. 56CRPCh. 1 - Prob. 57CRPCh. 1 - Prob. 58CRPCh. 1 - Write and test a Python script that, given a...Ch. 1 - Prob. 61CRPCh. 1 - Prob. 2SICh. 1 - Prob. 3SICh. 1 - Prob. 4SICh. 1 - Prob. 5SICh. 1 - Prob. 6SICh. 1 - Prob. 7SI
Knowledge Booster
Similar questions
- Suppose that we use the floating-point format with 12 decimal digits, SEEEMMMMMMMM, to rep- resent a real number, where S is the digit to represent the sign of the mantissa (use 0 for pos- itive and 5 for negative), EEE are the 3 digits to represent the exponent in excess-500 format, MMMMMMMM are the 8 digits to represent the magnitude of the mantissa, and the decimal point of the mantissa is right to the left of MMMMMMMM (i.e., SEEEMMMMMMMM representing the real number +0.MMMMMMMM × 10EEE-500.) When you use this format to represent a real number, in which scenario an overflow will occur and in which scenarios an underflow may occur?arrow_forwardThe value ofa float type variable is represented using the single-precision 32-bit floating point format of IEEE-754 standard that uses I bit for sign, 8 bits for biased exponent and 23 bits for mantissa. A float type variable X is assigned the decimal value of -1425. The representation of X in hexadecimal notation isarrow_forwardGenerate hamming code for the message 1011 100.arrow_forward
- 2. Convert the IEEE 754 single precision binary representation to a decimal number 1001 1001 1011 0000 0000 0000 0000 0000 Note: make sure that in final answer the fraction is in base 10 (at most 3 digits). You don't need to change the power of 2 in a power of 10.arrow_forwardThere is a base-10 (decimal) floating-point number representation uses one mantissa sign digit: s m , threemantissa digits: dm0 , dm1 , and dm2 , one exponent sign digit: se , and one exponent digit: de0 Why is the resolution representing the values from 0.1 to 1 equal to 0.001? while the resolution between 1 to 10 is 0.01?arrow_forwardWrite down the bit pattern in the fraction of value1/3 assuming a floating point format that uses Binary Coded Decimal (base 10) numbers in the fraction instead of base 2. Assume there are 24 bits, and you do not need to normalize. Is this representation exact?arrow_forward
- Q2 – A// Express the complex number [(2+3i )( 1-2i) ] in polar and exponential form with r>0 and – n<0arrow_forwardVI. Floating point representation Consider a 12-bit variant of the IEEE floating point format as follows: • Sign bit 5-bit exponent with a bias of 15. • 6-bit significand All of the rules for IEEE 754 Standard apply. Fill in the numeric value represented by the following bit patterns. You must write your number in decimal form (e.g. 0.0146485375, -0.0146485375). Bit Pattern 010011101110 111011101011 100101001111 001010111010 Numerical Valuearrow_forwardTrue/False 1. The octal number system is a weighted system with eight digits.2. The binary number system is a weighted system with two digits.3. MSB stands for most significant bit.4. In hexadecimal, 9 + 1 = 10.5. The 1’s complement of the binary number 1010 is 0101.6. The 2’s complement of the binary number 1111 is 0000.7. The right-most bit in a signed binary number is the sign bit.8. The hexadecimal number system has 16 characters, six of which are alphabetic characters.9. BCD stands for binary coded decimal.10. An error in a given code can be detected by verifying the parity bit.11. CRC stands for cyclic redundancy check.12. The modulo-2 sum of 11 and 10 is 100.arrow_forwardConvert the decimal (base 10) number 63 to a binary (base 2) number that has only the digits '0' and '1'. Binary number: (For example, the decimal number 16 is the same as the binary number 10000; the decimal number 13 is the same as the binary number 1101.)arrow_forwardA corporate executive who is slowly embezzling money from the company's pension fund has instructed his partner in crime, an investment banker, to send all correspondence in code. The computer operators on his staff type the correspondence on cards, each card containing 60 characters. To decode the message, you must first divide up the string into 5 blocks containing 12 characters each, with every twelfth character used to build a word. In addition, each letter is to be replaced with the letter six ahead of it in the alphabet. Thus, A becomes G, B becomes H, and U becomes A, V becomes B, and so on. Write a procedure in PL/I to read the characters from cards, decode the characters of each card, and print the 12 output words, four per line. The program should terminate when a card contains all consonants (consider Y to be a consonant).arrow_forwardBinary coded decimal is a combination of Three binary digits Two binary digits Four binary digits Five binary digits O ? = Add the two BCD numbers: 1001 + 0100 00101011 O 10101111 O 00010011 01010000 The standard product of sum form of the function y(X,Z) =X(X + Z) is (X+Z)(X+Z') O (X+Z)(X'+Z') (X+Z)(X'+Z') (X+Z') O (X'+Z)(X'+Z') Oarrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr