Tom explored a binary number system and found that it is much easier to perform smart tasks such as AND, XOR or bit shift on non-negative integers, while it is much more complex to perform arithmetic. After playing binary options for a while, Chef developed an exciting algorithm to add two non-bad numbers AA and BB: Addendum (A, B): while B is greater than 0: U = A XOR B V = A NO B A = U B = V * 2 replace A Now Chef wonders how fast this algorithm is. Considering the initial values of AA and BB (binary representation), you need to help him calculate the times when the algorithm loop is repeated. Answer in C++ only.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Tom explored a binary number system and found that it is much easier to perform smart tasks such
as AND, XOR or bit shift on non-negative integers, while it is much more complex to perform
arithmetic. After playing binary options for a while, Chef developed an exciting algorithm to add two
non-bad numbers AA and BB:
Addendum (A, B):
while B is greater than 0:
U = A XOR B
3
V = A NO B
replace A
Now Chef wonders how fast this algorithm is. Considering the initial values of AA and BB (binary
representation), you need to help him calculate the times when the algorithm loop is repeated.
Answer in C++ only.
Input
0
A = U
0
B = V * 2
100010
100010
11100
1010
Output
0
1
3
Transcribed Image Text:Tom explored a binary number system and found that it is much easier to perform smart tasks such as AND, XOR or bit shift on non-negative integers, while it is much more complex to perform arithmetic. After playing binary options for a while, Chef developed an exciting algorithm to add two non-bad numbers AA and BB: Addendum (A, B): while B is greater than 0: U = A XOR B 3 V = A NO B replace A Now Chef wonders how fast this algorithm is. Considering the initial values of AA and BB (binary representation), you need to help him calculate the times when the algorithm loop is repeated. Answer in C++ only. Input 0 A = U 0 B = V * 2 100010 100010 11100 1010 Output 0 1 3
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY