QUESTION 23 Use an arithmetic left-shift operation on the bit pattern 11011011. The pattern is an integer in 2s complement format. (Hint: find the normal representation first, then do the left-shift, and convert the result back to 2s complement form.) 1. (10110110)2 2. (11101110)2 3. (10110101)2 4. (10111000)2

QUESTION 23 Use an arithmetic left-shift operation on the bit pattern 11011011. The pattern is an integer in 2s complement format. (Hint: find the normal representation first, then do the left-shift, and convert the result back to 2s complement form.) 1. (10110110)2 2. (11101110)2 3. (10110101)2 4. (10111000)2

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 31VE

See similar textbooks

Similar questions

1. Using even parity, add parity bits to the following bit patterns: a. 0110 100 b. 1011 011 c. 0000 000 2. Using odd parity, add parity bits to the following bit patters: a. 0110 100 b. 1011 011 c. 0000 000
Suppose you will convert 0.110011 base 2 to base 10 by applying the intuitive method, that is, multiply the first bit to the right of the radix point by 1/2, multiply the 2nd bit to the right of the radix point by 1/4, multiply the 3rd bit to the right of the radix point by 1/8 and so on, and then add the results of the multiplications. 1/2, 1/4, 1/8, etc. are the weights of the digits of the number being converted. Which is the weight of the last bit to the right of the radix point of 0.110011 base 2 if 0.110011 base 2 is converted to base 10?
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?
4-The following block is sent: 0110111 0101010 1101010 1010101. Using a 2-dimensional parity check, what will be received by the receiver without the block being corrupted in transmission. put a space after each frame (8 bits). your final answer shoule be 5 frames. 5-Given: Original message : 110101010; Generator: 1010 Perform a CRC Calculation: 6-The symbols M and N are transmitted. Show the transmission of this data (at the sender and receiver) using Checksum Method.
Using a 32-bit bitfield, assume two's complement encoding with a binary point between bits 23 and 24. | What is the largest possible number that can be expressed? What is the numeric precision of this format?
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.625 * 10-2 assuming a version of this format. Calculate the sum of 2.625*102 and 4.150390625 * 10-1 by hand, assuming both numbers are stored in the 16-bit half precision described above. Assume 1 guard, 1 round bit, and 1 sticky bit, and round to the nearest even. Show all the steps.
Here, A = 0x55. Perform a bitwise operation to clear the 0-3 bits in A.Here, A = 0x73. Perform a bitwise logical operation to set the 1-3 bits in A.Here, A = 0x73. Perform a bitwise logical operation to invert the top four bits of the number and leave the bottom fourbits unchanged.
The 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.
. What are the 16-bit 1’s and 2’s complements of the following binarynumbers?a. 10000b. 100111100001001c. 01001110001001002. Convert the following binary numbers to floating point format.Assume a binary format consisting of a sign bit (negative = 1), a base 2,8-bit, excess-128 exponent, and 23 bits of mantissa, with the impliedbinary point to the right of the first bit of the mantissa.a. 110110.011011b. −1.1111001c. 0.1100×236d. 0.1100×2−36
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-2 assuming a version of this format. Calculate the sum of 2.6125*102 and 4.150390625 * 10-1 by hand,assuming both numbers are stored in the 16-bit half precision described above. Assume 1 guard, 1 round bit, and 1 sticky bit, and round to the nearest even. Show all the steps.
FROM the LEFT, what are respectively the 2nd bit, 4th bit, and 6th bit if 150 base 10 is represented using 2’s complement? a. 0 1 1 b. 1 1 1 c. 1 0 0 d. 0 1 0
LPC2148 observes the Big Endian layout, which means: Least Significant Bit equals how many bits? Most Significant Bit equals how many bits?