Computers and Technology, 07.05.2021 17:50 JS28boss
Write a recursive procedure to implement the following function hotpo(n): hotpo(nhotpon/2) >l is even hotpo 3 n+1) n>1 n is odd n words: 1. The procedure takes a natural number n(n1) as input; 2. If n is even, divide it by 2 to getn12; 3. If n is odd, multiply it by 3 and add 1 to obtain 3n+1. 4. Repeat the process until the result is 1. The procedure stops and returns 1 For example, if the input value is 3, the procedure will have the following recursive calls: (hotpo 3) (hotpo 10)- (hotpo 5)(hotpo 16) (hotpo 8) (hotpo 4)(hotpo 2)- (hotpo 1)
(1) Give the complete Scheme procedure and use comments to mark the size-n problem, stopping condition and return value, size-m problem, and construction of size-n problem solution. [5 points] (define hotpo (lambda (n)
(2) Modify the program in (1): Add a second parameter, named counter, into the hotpo procedure. The counter will count the number of iterations (the number of reentrances) that the procedure will execute before it stops. The revised procedure should return the counter value. For example, (hotpo 3 counter) should return 7. 3 points] (define hotpo (lambda (n counter)
Answers: 3
Computers and Technology, 24.06.2019 14:40
Create a function (prob3_6) that will do the following: input a positive scalar integer x. if x is odd, multiply it by 3 and add 1. if the given x is even, divide it by 2. repeat this rule on the new value until you get 1, if ever. your program will output how many operations it had to perform to get to 1 and the largest number along the way. for example, start with the number 3: because 3 is odd, we multiply by 3 and add 1 giving us 10. 10 is even so we divide it by 2, giving us 5. 5 is odd so we multiply by 3 and add one, giving us 16. we divide 16 (even) by two giving 8. we divide 8 (even) by two giving 4. we divide 4 (even) by two giving 2. we divide 2 (even) by 2 to give us 1. once we have one, we stop. this example took seven operations to get to one. the largest number we had along the way was 16. every value of n that anyone has ever checked eventually leads to 1, but it is an open mathematical problem (known as the collatz conjectureopens in new tab) whether every value of n eventually leads to 1. your program should include a while loop and an if-statement.
Answers: 3
Computers and Technology, 24.06.2019 22:00
Is the process of organizing data to reduce redundancy. a. normalization b. primary keying c. specifying relationships d. duplication
Answers: 1
Computers and Technology, 25.06.2019 03:30
All nate specialties are offered at two levels, a. journeyman and master. b. installation and service. c. apprentice and journeyman. d. heating and air conditioning.
Answers: 1
Computers and Technology, 25.06.2019 08:00
What are good colleges to apply to if you got like a 2.5 as a gpa? already got a call back from gcu at least its a start rt
Answers: 2
Write a recursive procedure to implement the following function hotpo(n): hotpo(nhotpon/2) >l is...
Mathematics, 18.11.2019 13:31
Mathematics, 18.11.2019 13:31
Mathematics, 18.11.2019 13:31
Advanced Placement (AP), 18.11.2019 13:31
Mathematics, 18.11.2019 13:31
Social Studies, 18.11.2019 13:31
Chemistry, 18.11.2019 13:31
Mathematics, 18.11.2019 13:31
History, 18.11.2019 13:31
Mathematics, 18.11.2019 13:31
Mathematics, 18.11.2019 13:31