
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
1.7 Add the following numbers in binary using 2's complement to represent negative numbers.
Use a word length of 6 bits (including sign) and indicate if an overflow occurs.
(a) 21 + 11
(d) (−12) + 13
(e) (−11) + (−21)
Repeat the question using 1's complement to represent negative numbers.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- 1. a) Consider the numbers M = 2081 and N = 2329, both in base 10. Write them in base r, as follows, and perform M - N using the (r - 1)'s complement representation subtraction algorithm for following values of r. Write and encircle the results in the places indicated below: (i) r = 2 M₂: N₂: (M-N) ₂: (ii) r = 16 M16: N16: (M-N) 16:arrow_forward[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.arrow_forwardUnderstanding the purpose of a virtual machine is crucial.arrow_forward
- 1.9 Suppose we use six bits to represent a two's complement binary number. (a) What is the largest number that can be represented? (b) What is the smallest number that can be represented? (c) How many total base-10 numbers can be represented?arrow_forwardDescription Find the sum of 10.2510 and 5.2510 using the 14-bit "simple" floating-point model. Hint: Refer to slides or class notes for a similar example.arrow_forward3.26 Let A be an 8-bit input. Fill in the table showing the promotion to 16-bit unsigned and ie bit signed. Give all answers in 16-bit hexadecimal. The first row illustrates the process. Unsigned 16-bit Signed 16-bit 0x80 0x51 0x0080 OXFF80 OXED Ox00 OXBFarrow_forward
- Example: Assuming m-7 bits and using three of those bits for representing the fractional part, ( 1100.000 )2 ( 0110.000 )2 ( 0011.000 )2 ( 0001.100 )2 ( 0000.110 )2 ( 0000.011 )2 (12)10 %3D (12)10 / 2 (6)10 (6)10 /2 (3)10 (3)10 /2 (1.5)10 (1.5)10 / 2 (0.75)10 (0.75)10 / 2 (0.375)10 In this case, each successive division by two has shifted the binary sequence to the right by one bit.arrow_forward1) Convert the following decimal numbers to the 9’s complement: Perform subtraction using 9’s complement on 26-18 2)Convert the following decimal numbers to the 10’s complement: Perform subtraction using 10’s complement on 432-567 3) Perform the following multiplications. Assume that all values are unsignednumbers. (No problem with unsigned (always positive) numbers, just use the samestandard techniques as in base 10.) a. 1010 * 0110arrow_forward1) Convert the following decimal numbers to the 9’s complement: Perform subtraction using 9’s complement on 26-18 2)Convert the following decimal numbers to the 10’s complement: Perform subtraction using 10’s complement on 432-567 3) Perform the following multiplications. Assume that all values are unsignednumbers. (No problem with unsigned (always positive) numbers, just use the samestandard techniques as in base 10.) a. 1010 * 0110arrow_forward
- ES) Convert 27.3410 to octal. If the answer is irrational, stop at four digits after number point. (us) Convert 0.110 to binary. Can you accurately represent the same value in binary using a certain number of bits? Why or why not? What is the relationship between the three numbers below? Explain why it is the case. xyzb xyzob xy.zb Here x, y, and z are all valid single-digit values in the number system in base b and b is an integer larger than 1.arrow_forward6. Using only the binary shift left operation, how can one multiply a number by decimal 16?arrow_forwardPerform the following tasks by explaining the process of each one in detail: 1. Converting all numbers by follow between brackets: a. 487.2 from base 10 to [ bases 2,8, 16] b. 11010110 from base 2 to [ base 10 ] c. 456 from base 8 to [ base 10 ] d. 2B6 from base 16 to [ base 10 ] 2. Adding all numbers by follow between brackets: a. The binary numbers: [11010110 + 10000101] b. The octal numbers: [ 456 + 555 ] c. The hexadecimal numbers: [ 2B6 + 12C] 3. Subtracting all numbers by follow between brackets: a. The binary numbers: [ 11010110 - 10000101] b. The octal numbers: [ 555 – 456 ] c. The hexadecimal numbers: [ 2B6 - 12C]arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education