Problem 1: The Mysterious Function We have come through an old interesting function whose pseudo-code was defined as follows: Algorithm 1 MYSTERIOUS-FUNCTION(n) Require: n E Z ^n< 350 if n > 350 then return n- 47 else return MYSTERIOUS-FUNCTION(MYSTERIOUS-FUNCTION(n + 48)) end if a) Implement the algorithm in Python b) Try various inputs, within the valid rangen< 350, what have you noticed of the output? c) Prove your thoughts, hypothesis, in part (b) [Hint: use your implementation to prove a property of the output at a particular input along with inductive scheme] d) Empirically, show the performance curve of the algorithm using time measurements

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

I want d)

Problem 1: The Mysterious Function
We have come through an old interesting function whose pseudo-code was defined as
follows:
Algorithm 1 MYSTERIOUS-FUNCTION(n)
Require: n E ZAn< 350
if n > 350 then
return n- 47
else
return MYSTERIOUS-FUNCTION(MYSTERIOUS-FUNCTION(n + 48))
end if
a) Implement the algorithm in Python
b) Try various inputs, within the valid rangen< 350, what have you noticed of the
output?
c) Prove your thoughts, hypothesis, in part (b)
[Hint: use your implementation to prove a property of the output at a particular
input along with inductive scheme]
d) Empirically, show the performance curve of the algorithm using time measurements
Transcribed Image Text:Problem 1: The Mysterious Function We have come through an old interesting function whose pseudo-code was defined as follows: Algorithm 1 MYSTERIOUS-FUNCTION(n) Require: n E ZAn< 350 if n > 350 then return n- 47 else return MYSTERIOUS-FUNCTION(MYSTERIOUS-FUNCTION(n + 48)) end if a) Implement the algorithm in Python b) Try various inputs, within the valid rangen< 350, what have you noticed of the output? c) Prove your thoughts, hypothesis, in part (b) [Hint: use your implementation to prove a property of the output at a particular input along with inductive scheme] d) Empirically, show the performance curve of the algorithm using time measurements
Expert Solution
steps

Step by step

Solved in 4 steps with 3 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