Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Question
a. Following pseudocode on slide #30, implement a function to perform binary addition.
The function takes two integers as inputs, and returns the binary representation of the sum of the two
numbers as a string. Note that the addition has to be performed using the binary representations of the
two integers, meaning you can not do '5+8 = 13' then return the binary representation of 13. Use the
following pairs to test your code: (24,98), (2387482,1), (25,25)
Binary Addition of Integers
Algorithms for performing operations with integers using their binary
expansions are important as computer chips work with binary numbers. Each
digit is called a bit.
procedure add(a, b: positive integers)
{the binary expansions of a and b are (a-19-2.a) and (b-1b-2²b)₂
respectively}
n-2'
n-2'
C:=0
for j:= 0 to n-1
d:=
:= [(a₁ + b₁ + c)/2]
s, := a₁ +b+c=2d
c:= d
S := C
return(s,S₁,...,s){the binary expansion of the sum is (SS-₁,5)₂}
The number of additions of bits used by the algorithm to add two n-bit
integers is O(n).
expand button
Transcribed Image Text:a. Following pseudocode on slide #30, implement a function to perform binary addition. The function takes two integers as inputs, and returns the binary representation of the sum of the two numbers as a string. Note that the addition has to be performed using the binary representations of the two integers, meaning you can not do '5+8 = 13' then return the binary representation of 13. Use the following pairs to test your code: (24,98), (2387482,1), (25,25) Binary Addition of Integers Algorithms for performing operations with integers using their binary expansions are important as computer chips work with binary numbers. Each digit is called a bit. procedure add(a, b: positive integers) {the binary expansions of a and b are (a-19-2.a) and (b-1b-2²b)₂ respectively} n-2' n-2' C:=0 for j:= 0 to n-1 d:= := [(a₁ + b₁ + c)/2] s, := a₁ +b+c=2d c:= d S := C return(s,S₁,...,s){the binary expansion of the sum is (SS-₁,5)₂} The number of additions of bits used by the algorithm to add two n-bit integers is O(n).
Expert Solution
Check Mark
Still need help?
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

hi sorry i forgot to mention that this is in python sorry!

Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

hi sorry i forgot to mention that this is in python sorry!

Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Knowledge Booster
Background pattern image
Computer Science
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
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education