1- Given R0, RI, R2, and R3 followed by the indicated base; i- Convert each value into its corresponding 9 bit binary value, the most significant bit is used as the sign bit, separate the sign bit with a comma, for example; 0,10100000 (RO)8 = 165 (RO)2= Use the 9 least significant bits, discard the extra bits. (RI)16 - FSF (RI)2- (R2)16 = F81 (R2)2= (R3)7 152 (R3)2- (Separte the sign from the other bits with a comma, for example; 110011000 is written as; 1,10011000) ii- Evaluate; R4 - RO + RI. (consider negative numbers to be already given in 2's complement) bitk hbittbitir4bitbi2birlhio RO RI R4

1- Given R0, RI, R2, and R3 followed by the indicated base; i- Convert each value into its corresponding 9 bit binary value, the most significant bit is used as the sign bit, separate the sign bit with a comma, for example; 0,10100000 (RO)8 = 165 (RO)2= Use the 9 least significant bits, discard the extra bits. (RI)16 - FSF (RI)2- (R2)16 = F81 (R2)2= (R3)7 152 (R3)2- (Separte the sign from the other bits with a comma, for example; 110011000 is written as; 1,10011000) ii- Evaluate; R4 - RO + RI. (consider negative numbers to be already given in 2's complement) bitk hbittbitir4bitbi2birlhio RO RI R4

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

Similar questions

e) Explain what even parity coding is and give one example of what it is used for. By adding 1 parity bit at MSB, rewrite the following sequences so that they have even parity: 10010, 10110
Perform the following calculations and list the flag status for Z,V,N, and C
Can you do this?
4. Pèrform the following additions and subtractions. Assume that all numbers are in 32 bit 2's complement. Stäte the sign of each number, the sign of the answer, and whether an overflow occurs. a. 00 00 04 C8 + 48 49 B7 6F 4849 BC37.6Nd Overflow) b. 00 12 5F 89 + 8F DE 27 83 < 8F FO'87OC CNo Ovelflaw) c. 39 B4 08 75 + 93 19 76 26 GC CD 7E9B ( No Ovelfla) d. 6.A 01 B9 33 + 55 62 09 42 e. FF FE 59 00 - 23 45 67 89 f. 49 7B 05 CC - 92 93 8A 6D g. 86 21 4F BC - 6B A4 59 72
M0o.
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
[4.1] Consider the number -1.36875 x 10¹ as the dividend and 5.625 x 10¹ as the divisor. a. Find their binary representation. b. Normalize the results that you got it in (A) and put them in the 8-bit quarter- precision format (1 for sign bit, 2 for exponent, and 5 for fraction). c. Implement the division and show all the steps of the division to results that you got it in (B). Show if there is an overflow or underflow by assuming that there is a guard bit, a round bit, and a sticky bit.
1- Write a program to subtract two numbers each of 16-bit, if the result is negative apply the 2's complement.
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.
Perform the following additions. Assume that all numbers are in 8-bit 2’scomplement notation. State the carry-in and carry-out, whether overflow or not,and if the result is correct. 10011001 +10111011 Perform the following subtractions. Assume that all numbers are in 2’scomplement notation. State the carry-in and carry-out, whether overflow or not,and if the result is correct. 11101101 – 00101010
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?