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 An< 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 range n < 350, what have you noticed of the output?

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 An< 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 range n < 350, what have you noticed of the output?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter18: Deterministic Dynamic Programming

Section: Chapter Questions

Problem 10RP

See similar textbooks

Similar questions

The function below has the recursive relation T(x,y) = 2T(y/2)+O(1) when x,y>0Knowing these information, find the following: 1) The worst-case time complexity of the function2) The worst-case auxiliary space complexity of the function3) Explanation as to how the time complexity of the function can be improved without using multiplication operations.
1.Consider the following Boolean Satisfiability problem:Given a Boolean expression consisting of variables, does the expression have an assignment for the set of variables where the expression evaluates to TRUE. (i)Outline, in pseudocode, an exact algorithm for the problem. This should guarantee a solution if one exists. (Please state clearly the algorithm used) (ii)For the exact method used in part (1) (i), estimate the time required for the algorithm to find an exact solution in the big O-notation.
Problem 2: Given a fixed integer B ( B2), we demonstrate that any integer N(N 2 O) can be written in a unique way inm of the sum of p+1 terms as follows: N=ae + aixB+ a2xB? + ... + 4px Bº where all as, for o sisp, are integer such that 0 Sa B-l. The notation a,dipl...de is called the represenn of N in base B. Noticas is the remainder clidean division of N by B. If Q is the quotient, a, is the remainder of the Euclidean division of etc. 1. Write an algorit that generates the representation of N in base B. 2. Compute the time complexity of your algorithm
Computer Science Prove that the set M = {x ∈ R: x 2 = 2a3 b , a ∈ N, b ∈ N} is countably infinite. Your solution should either give a bijective function f : N → M or give pseudo-code of a program that prints all the values of such a function, in the following format (in this case you don’t have to define f explicitly, but need to also show the first five lines of output): 0: element of M 1: another element of M 2: yet another element of M
The Traveling Salesman Problem in Paris - An Optimal Tour Considering a Multimodal Transportation System Give an example and write suitable code. i posted 2 times this question but all are giving wrong ans give accurate ans otherwise you will get downvote
9.If you pass n=2 to your function your 2nd term of Fibonacci series is 1 and (n-1)th= 1" term of Fibonacci series is 0 and (n+1)th= 3rd term of Fibonacci series is 1..
Use the master theorem to determine the run-time complexity of the following function. Clearly indicate the values of a, b, and c that you are using.
(a) Devise a recursive algorithm to nd a2n, where the inputs to the algorithm consist ofa which is a real number and n which is a positive integer. Hint: Use the equalitya2n+1= (a2n)2.(b) Assume that you are not allowed to use any function for computing the powers. Devisean iterative algorithm for solving the same problem.(c) Analyze the running times of the two approaches.
Please help me with these question. SHow all you work. Thank you 1. Prove that∀k ∈ N, 1k + 2k + · · · + nk ∈ Θ(nk+1). 2. Suppose that the functions f1, f2, g1, g2 : N → R≥0 are such that f1 ∈ Θ(g1) and f2 ∈ Θ(g2).Prove that (f1 + f2) ∈ Θ(max{g1, g2}).Here (f1 + f2)(n) = f1(n) + f2(n) and max{g1, g2}(n) = max{g1(n), g2(n)}
Problem 1. (a) Describe an algorithm that computes the product of n given integers. (b) Find the running time function T(n) of this algorithm.
1. Can someone help with this problem Prove that the following problem is NP-hard and determine whether it is also NP-complete or not – if the problem is NP-complete, you also need to give a poly-time verifier and argue the correctness of your verifier.
Determine whether the proposed definition isa valid recursive definition of a function f from the setof nonnegative integers to the set of integers. If f is welldefined, find a formula for f(n) when n is a nonnegativeinteger and prove that your formula is valid. Do NOT use proofs. f(0) = 1, f(n) = −f(n − 1) for n ≥ 1