3:0 X :- 1 Consider the following algorithm. y : n while (x < y) do...

 

Transcribed Image Text:

3:0 X :- 1 Consider the following algorithm. y : n while (x < y) do for i:=1 to n do j : j + 5 end for X=X+2 yy / 2 end while What is the "smallest" big-oh (O()) notation for the above algorithm? Question 16. (4 points) The Fundamental Theorem of Arithmetic states: "Every positive integer greater than 1 can be written uniquely as a prime or as the product of primes, where the prime factors are written in order of nondecreasing size." What is the prime factorization of the integer 90? Question 17. (3 points) For the decimal value 1911o what would be its binary value (base 2)? 3:0 X :- 1 Consider the following algorithm. y : n while (x < y) do for i:=1 to n do j : j + 5 end for X=X+2 yy / 2 end while What is the "smallest" big-oh (O()) notation for the above algorithm? Question 16. (4 points) The Fundamental Theorem of Arithmetic states: "Every positive integer greater than 1 can be written uniquely as a prime or as the product of primes, where the prime factors are written in order of nondecreasing size." What is the prime factorization of the integer 90? Question 17. (3 points) For the decimal value 1911o what would be its binary value (base 2)?

Answer rating: 100% (QA)

For the given algorithm x 1 y n while x y for i 1 to n do ... View the full answer