Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 2, Problem 35CRP
a.
Program Plan Intro
Masking:
Masking is a method used to implement the logical operation (that is OR, AND, XOR) of a bit binary string or binary string with anremaining binary string (that is mask value) to create a future variation in the resultant value. It retain definite bits in the original binary string.
b.
Program Plan Intro
Masking:
Masking is a method used to implement the logical operation (that is OR, AND, XOR) of a bit binary string or binary string with anremaining binary string (that is mask value) to create a future variation in the resultant value. It retain definite bits in the original binary string.
c.
Program Plan Intro
Masking:
Masking is a method used to implement the logical operation (that is OR, AND, XOR) of a bit binary string or binary string with anremaining binary string (that is mask value) to create a future variation in the resultant value. It retain definite bits in the original binary string.
d.
Program Plan Intro
Masking:
Masking is a method used to implement the logical operation (that is OR, AND, XOR) of a bit binary string or binary string with anremaining binary string (that is mask value) to create a future variation in the resultant value. It retain definite bits in the original binary string.
e.
Program Plan Intro
Masking:
Masking is a method used to implement the logical operation (that is OR, AND, XOR) of a bit binary string or binary string with anremaining binary string (that is mask value) to create a future variation in the resultant value. It retain definite bits in the original binary string.
f.
Program Plan Intro
Masking:
Masking is a method used to implement the logical operation (that is OR, AND, XOR) of a bit binary string or binary string with anremaining binary string (that is mask value) to create a future variation in the resultant value. It retain definite bits in the original binary string.
g.
Program Plan Intro
Masking:
Masking is a method used to implement the logical operation (that is OR, AND, XOR) of a bit binary string or binary string with anremaining binary string (that is mask value) to create a future variation in the resultant value. It retain definite bits in the original binary string.
h.
Program Plan Intro
Masking:
Masking is a method used to implement the logical operation (that is OR, AND, XOR) of a bit binary string or binary string with anremaining binary string (that is mask value) to create a future variation in the resultant value. It retain definite bits in the original binary string.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
It is necessary to formulate the Hamming code for four data bits, D3, D5, D6, and D7, together with three parity bits, P1, P2, and P4.1. Evaluate the 7-bit composite code word for the data word 0010.2. Evaluate three check bits, C4, C2, and C1, assuming no error.3. Assume an error in bit D5 during writing into memory. Show how the error in the bit is detected and corrected.4. Add parity bit P8 to include double-error detection in the code. Assume that errors occurred in bits P2 and D5. Show how the double error is detected.
Exercise on Hamming Code
An 8-bit data word stored in memory is 00111100, while word fetched from the memory is 00101100.1) How many check bits should be combined in word stored and word fetched?2) Find check bits in word stored.3) Find check bits in word fetched.4) Find which bit position contains error.
Calculate the parity of a byte with the value 31 and show the pattern stored to
memory. Assume the parity bit is on the right. Suppose the most significant bit
was inverted in memory, and then you read it back. Did you detect the error?
What happens if the two most significant bits are inverted?
Chapter 2 Solutions
Computer Science: An Overview (12th Edition)
Ch. 2.1 - What sequence of events do you think would be...Ch. 2.1 - What information must the CPU supply to the main...Ch. 2.1 - Prob. 3QECh. 2.2 - Prob. 1QECh. 2.2 - In the text, JUMP instructions were expressed by...Ch. 2.2 - Is the instruction If 0 equals 0, then jump to...Ch. 2.2 - Write the example program in Figure 2.7 in actual...Ch. 2.2 - The following are instructions written in Vole...Ch. 2.2 - What is the difference between the instructions...Ch. 2.2 - Here are some instructions in English. Translate...
Ch. 2.3 - Prob. 1QECh. 2.3 - Suppose the Vole memory cells at addresses 0xB0 to...Ch. 2.3 - Suppose the Vole memory cells at addresses 0xA4 to...Ch. 2.3 - Suppose the Vole memory cells at addresses 0xF0 to...Ch. 2.4 - Prob. 1QECh. 2.4 - Prob. 2QECh. 2.4 - Prob. 3QECh. 2.4 - a. Suppose you XOR the first 2 bits of a string of...Ch. 2.4 - Prob. 5QECh. 2.4 - Prob. 6QECh. 2.4 - Prob. 7QECh. 2.4 - Prob. 8QECh. 2.4 - Prob. 9QECh. 2.4 - Prob. 10QECh. 2.4 - Using Vole machine language (Appendix C), write a...Ch. 2.4 - Prob. 12QECh. 2.5 - Prob. 1QECh. 2.5 - Prob. 2QECh. 2.5 - Prob. 3QECh. 2.6 - The hypotenuse example script truncates the sides...Ch. 2.6 - Prob. 2QECh. 2.6 - The Python built-in function str () will convert a...Ch. 2.6 - Use the Python built-in bin () to write a script...Ch. 2.6 - Prob. 6QECh. 2.7 - Referring back to Questions 3 of Section 2.3, if...Ch. 2.7 - Prob. 2QECh. 2.7 - Suppose there were two central processing units...Ch. 2 - a. In what way are general-purpose registers and...Ch. 2 - Answer the following questions in Vole machine...Ch. 2 - Prob. 3CRPCh. 2 - What is the value of the program counter in the...Ch. 2 - Prob. 5CRPCh. 2 - Prob. 6CRPCh. 2 - Prob. 7CRPCh. 2 - Suppose a machine language is designed with an...Ch. 2 - Translate the following instructions from English...Ch. 2 - Rewrite the program in Figure 2.7 assuming that...Ch. 2 - 11. Classify each of the following instructions...Ch. 2 - Prob. 12CRPCh. 2 - Prob. 13CRPCh. 2 - Suppose the memory cells at addresses 0x00 through...Ch. 2 - Suppose the memory cells at addresses 0x00 through...Ch. 2 - Suppose the memory cells at addresses 0x00 through...Ch. 2 - Suppose the memory cells at addresses 0x00 through...Ch. 2 - Prob. 18CRPCh. 2 - If the Vole executes an instruction every...Ch. 2 - Prob. 20CRPCh. 2 - Prob. 21CRPCh. 2 - Prob. 22CRPCh. 2 - Prob. 23CRPCh. 2 - Write a program in Vole to compute the sum of...Ch. 2 - Prob. 26CRPCh. 2 - Prob. 27CRPCh. 2 - Suppose the following program, written in Vole, is...Ch. 2 - Summarize the steps involved when the Vole...Ch. 2 - Summarize the steps involved when the Vole...Ch. 2 - Summarize the steps involved when the Vole...Ch. 2 - Suppose the registers 0x4 and 0x5 in the Vole...Ch. 2 - Prob. 33CRPCh. 2 - Prob. 34CRPCh. 2 - Prob. 35CRPCh. 2 - Prob. 36CRPCh. 2 - Prob. 37CRPCh. 2 - Prob. 38CRPCh. 2 - Prob. 39CRPCh. 2 - Prob. 40CRPCh. 2 - Prob. 41CRPCh. 2 - Prob. 42CRPCh. 2 - a. What single instruction in the Vole machine...Ch. 2 - Write a Vole program that reverses the contents of...Ch. 2 - Write a Vole program that subtracts the value...Ch. 2 - Prob. 46CRPCh. 2 - Suppose a person is typing forty words per minute...Ch. 2 - Prob. 48CRPCh. 2 - Suppose the Vole communicates with a printer using...Ch. 2 - Write a Vole program that places 0s in all the...Ch. 2 - Prob. 51CRPCh. 2 - Prob. 52CRPCh. 2 - Suppose you are given 32 processors, each capable...Ch. 2 - Prob. 54CRPCh. 2 - Prob. 55CRPCh. 2 - Describe how the average of a collection of...Ch. 2 - Write and test a Python script that reads in a...Ch. 2 - Write and test a Python script that reads in a...Ch. 2 - Prob. 59CRPCh. 2 - Suppose a computer manufacturer develops a new...Ch. 2 - Prob. 2SICh. 2 - Prob. 3SICh. 2 - Prob. 4SICh. 2 - Suppose a manufacturer produces a computer chip...Ch. 2 - Prob. 6SICh. 2 - Prob. 7SICh. 2 - Prob. 8SI
Knowledge Booster
Similar questions
- If the floating-point number representation on a certain system has a sign bit, a 3-bit exponent and a 4-bit significand: What is the largest positive and the smallest positive number that can be stored on this system if the storage is normalized? (Assume no bits are implied, there is no biasing, exponents use two's complement notation, and exponents of all zeros and all ones are allowed.) What bias should be used in the exponent if we prefer all exponents to be non-negative? Why would you choose this bias?arrow_forward5. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a. How many parity bits are necessary? b. Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code and an odd parity, find the code word to present the 10-bit information word: 1 0 0 1 1 0 0 1 1 1arrow_forwardSuppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a. How many parity bits are necessary? b. Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code and an odd parity , find the code word to present the 10-bit information word: 1 00 1 1 00 1 1 1 We now receive the following code word: C. 10 10 1 1 0 0 0 0 10 1 1 Is this a legal code word, assuming an odd parity? If not, what is the corrected code word? (Which bit is the error bit?)arrow_forward
- Are you able to differentiate between the least significant bit and the most significant bit in a given set of data?arrow_forwardIf an unsigned 8-bit integer were to be extended to a 16-bit one, the first 8 most significant bits (MSB) would be filled with ones, creating a signed 16-bit representation. Pick a solution from these two options: Is it true or false that...?arrow_forward4. IEEE 754-2008 contains a half precision that is only 16 bits wide. The leftmost bit is still the sign bit, the exponent is 5 bits wide and has a bias of 15, and the mantissa is 10 bits long. A hidden 1 is assumed. Write down the bit pattern to represent ( – 1.5625 * 10-1) assuming a version of this format, which uses an excess-16 format to store the exponent. Comment on how the range and accuracy of this 16-bit floating point format compares to the single precision IEEE 754 standard.arrow_forward
- Illustrate the encoding procedure with the message vector [ 1100] by using the states of the register(the right most bit is the earliest bit) and obtain the final Code wordarrow_forwardThe Hewlett-Packard 2114, 2115, and 2116 used a format with the left most 16 bits being the fraction stored in two’s complement format, followed by another 16-bit field which had the left most 8 bits as an extension of the fraction (making the fraction 24 bits long), and the rightmost 8 bits representing the exponent. However, in an interesting twist, the exponent was stored in signmagnitude format with the sign bit on the far right! Write down the bit pattern to represent 1.5625 101 assuming this format. No hidden 1 is used. Comment on how the range and accuracy of this 32-bit pattern compares to the single precision IEEE 754 standard.arrow_forward6. 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:arrow_forward
- Computer Science Construct a hamming code by adding a parity bit to a two data bit stream the parity should be even 1- show all the possible code words 2- What is the minimum Hammin distancearrow_forwardanswer the ff and show complete step by step soln: 1.) Find the bitwise operation ^ of given pair of bit string. Write your answer based on the format of the bit string. 1010 0000, 1101 1010 2.) Find the bitwise operation ⨁ of given pair of bit string. Write your answer based on the format of the bit string. 1010 1111, 0101 1111arrow_forwardb) Given an IEEE-754 single precision notation as shown below, show how this notation can be represented in a sign-magnitude notation in decimal. You are required to show all working steps. 1 10000001 110011000000000000000000 Assume that: Excess-127 is applied. The implied binary point is on the right of the first bit of mantissa.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning