1- What is minimum number of bits required to represent [decimal (-143)] as a signed binary number in 2- complement form. A) 7 B) 8 C) 10 D) 9 2- The 5-bits 2- complement equivalent of [decimal (12)] is: A) 00100 B) 11100 C) 01100 D) 10100 3- Multiplication of the unsigned numbers [binary (101101)] and [binary (1011)] results in product of: A) 111111111 B) 110101111 C) 111101111 D) 101101111

1- What is minimum number of bits required to represent [decimal (-143)] as a signed binary number in 2- complement form. A) 7 B) 8 C) 10 D) 9 2- The 5-bits 2- complement equivalent of [decimal (12)] is: A) 00100 B) 11100 C) 01100 D) 10100 3- Multiplication of the unsigned numbers [binary (101101)] and [binary (1011)] results in product of: A) 111111111 B) 110101111 C) 111101111 D) 101101111

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

Round the following binary numbers (rounding position is bolded – it is the bit at the 2-4 position) following the rounding rules of the IEEE floating point representation. I. 1.00111112 II. 1.10010012 III. 1.01111002 IV. 1.01101002 For each of the four (4) resulting rounded binary numbers, indicate - what type of rounding you performed and - compute the value that is either added to or subtracted from the initial binary number (listed above) as a result of the rounding process. In other words, compute the error introduced by the rounding (approximation) process. please note that the rounding is based on the bolded numbers!!! Not the 2s in the end those are just binary signs
Using the following notational conventions, we can transform the decimal value 30 into an 8-bit binary representation: One's a) Complement; b) Excess-M:?
1) Express the following numbers in Binary Format (base 2): a) 10, b) 24, c) 1024
2. Assume we are using the simple model for floating-point representation as given in this book (the representation uses a 16-bit format, 5 bits for the exponent with a bias of excess-15, a normalized mantissa of 10 bits, and a single sign bit for the number): Show how the computer would represent the numbers a) +3.53125 and -3.34375 using this floating-point format. a) +3.53125 b)-0.09375
2. Consider a binary number (00101010),. What base-10 number this binary number is equivalent to if a) it was a signed binary number b) it was an unsigned binary number.
Complete the following arithmetic operations in two's complement representation. What are the values of the carry and overflow flag? Assume a six-bit system. 9 + (-19) = ?
2. Write the normalized floating-point representation of (+ 33.025)10. Assume 16 bits to represent mantissa and 8 bits to represent exponents. Compare 84-2-1and 8421 code. Draw a figure for five bits odd parity generator and parity checker.
Q2 plase text writing
H - For the IEEE 754 single-precision floating point, write the hexadecimal representation for the following decimal values: (i)–1.0 (ii)– 0.0 (iii)256.015625
1) Assume we have 8 bit (1 byte) 2's complement system with a 3-bit fractional. Find a decimal representation of 2's complements binary number 1011 0101.001 2) Assume we have a byte system for the fixed number representation (the whole number is presented with 8-bits (one byte) and the fractional part is presented with 2-bits), find the 2's complement of 0110 0010.01
Please type your solution so that I will be able to read them
1. Express the following decimal integers in 8-bit 2's-complement.a) 75 b) –922. Express the following decimal integers in excess 127 (8 bits)It means: Add the excess 127 to the number then represent the sum as 8 bits unsigned integer.a) 136 b) -7