a. Following pseudocode on slide # 30, implement a function to perform binary a The function takes two integers as inputs, and returns the binary representation. numbers as a string. Note that the addition has to be performed using the binar two integers, meaning you can not do '5+8= 13' then return the binary represen following pairs to test your code: (24,98), (2387482,1), (25,25) Binary Addition of Integ
a. Following pseudocode on slide # 30, implement a function to perform binary a The function takes two integers as inputs, and returns the binary representation. numbers as a string. Note that the addition has to be performed using the binar two integers, meaning you can not do '5+8= 13' then return the binary represen following pairs to test your code: (24,98), (2387482,1), (25,25) Binary Addition of Integ
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
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).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd08e19be-7e5e-4944-9492-2c1f0e254c97%2F6ca95880-da5a-4476-83f9-22c051cf8709%2Fll827qp_processed.png&w=3840&q=75)
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

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 now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images

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
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.Recommended textbooks for you

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

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