Input a and b, preprocess to guarantee a >= b > 0 while (0 != remainder) remainder = a - b if(remainder >= b) // meaning quotient > 1 remainder = remainder - b if(remainder >= b) // meaning quotient > 2 remainder = remainder - b if(remainder >= b) // meaning quotient > 3 remainder = a - b * IntegerPart (a/b) // PUNT %3D endif endif endif a = b b = remainder endwhile At end, the gcd is a Given the above modified Euclid's algorithm, how many iterations of the while loop are needed for the input (35, 110)? А. 2 В. 5 С. 8 D. 10 E. None

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

Given the above modified Euclid’s algorithm, how many iterations of the while loop are needed for the input (35, 110)?

Please look at the attached image.

Input a and b, preprocess to guarantee a >= b > 0
while (0 != remainder)
remainder = a - b
if(remainder >= b)
// meaning quotient > 1
remainder
remainder - b
%3D
if(remainder >= b)
// meaning quotient > 2
remainder = remainder - b
// meaning quotient > 3
// PUNT
if (remainder >= b)
remainder = a - b * IntegerPart(a/b)
endif
endif
endif
a = b
b = remainder
endwhile
At end, the gcd is a
Given the above modified Euclid's algorithm, how many iterations of the while
loop are needed for the input (35, 110)?
А. 2
В. 5
С. 8
D. 10
E. None
Transcribed Image Text:Input a and b, preprocess to guarantee a >= b > 0 while (0 != remainder) remainder = a - b if(remainder >= b) // meaning quotient > 1 remainder remainder - b %3D if(remainder >= b) // meaning quotient > 2 remainder = remainder - b // meaning quotient > 3 // PUNT if (remainder >= b) remainder = a - b * IntegerPart(a/b) endif endif endif a = b b = remainder endwhile At end, the gcd is a Given the above modified Euclid's algorithm, how many iterations of the while loop are needed for the input (35, 110)? А. 2 В. 5 С. 8 D. 10 E. None
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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