Problem 1: The Mysterious Function We have come through an old interesting function whose pseudo-code was defined as follows: Algorithm 1 MYSTERIOUS-FUNCTION(1n) Require: n E Z An< 222 if n > 222 then return n- 14 else return MYSTERIOUS-FUNCTION(MYSTERIOUS-FUNCTION(n + 15)) end if a) Implement the algorithm in Python b) Try various inputs, within the valid range n< 222, 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

Problem 1: The Mysterious Function We have come through an old interesting function whose pseudo-code was defined as follows: Algorithm 1 MYSTERIOUS-FUNCTION(1n) Require: n E Z An< 222 if n > 222 then return n- 14 else return MYSTERIOUS-FUNCTION(MYSTERIOUS-FUNCTION(n + 15)) end if a) Implement the algorithm in Python b) Try various inputs, within the valid range n< 222, 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

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question 1: Tracing Recursive functions The solution can be handwritten in a paper and attach the pictures of solution to a PDF file a) Trace the following recursive method for the function call “multiplyDigits(58741)" and show the output result public static int multiplyDigits (int n) { 0) return 1; if (n } else == return ((n % 10) * multiplyDigits(n / 10)); } b) Trace the following recursive method for the function call "fibCalc(5,0,1)" and show the output. public static int fibCalc(int n, int s, int t) { if (n == 0) return s; if (n == 1) return t; return fibCalc(n 1, t, s + t);
Need help in python. Problem: 2D random walk. A two dimensional random walk simulates the behavior of a particle moving in a grid of points. At each step, the random walker moves north, south, east, or west with probability 1/4, independently of previous moves. Compose a program that takes a command-line argument n and estimates how long it will take a random walker to hit the boundary of a 2n+1-by-2n+1 square centered at the starting point. //Given codeImport stdioImport randomImport sysn = int(sys.argv[1])//write code herestdio.write('The walker took ')stdio.write(c)stdio.writeln(' steps')
What will happen if the pseudo code given below executes? func(x): IF x < 50: PRINT X x=x*5 RETURN func(x) /Tester func(2) DOutput values 2,10,50 will be printed Function has a parameter which takes integer As there is no base case error will occur Maximum limit of recursion will be exceeded
Java, I am not displaying my results correct. It should add up the digits in the string. input string |result for the sumIt Recursion functions and a findMax function that finds the largest number in a string "1d2d3d" | 6 total "55" |10 total "xx" | 0 total "12x8" |12 Max number "012x88" |88 Max Number "012x88ttttt9xe33ppp100" |100 Max Number public class Finder { //Write two recursive functions, both of which will parse any length string that consists of digits and numbers. Both functions //should be…
The following function f uses recursion:def f(n):if n <= 1return nelsereturn f(n-1) + f(n-2)5Let n be a valid input, i.e., a natural number. Which of the following functions returns the same result but without recursion? a) def f(n):a <- 0b <- 1if n = 0return aelsif n = 1return belsefor i in 1..nc <- a + ba <- bb <- creturn b b) def f(n):a <- 0i <- nwhile i > 0a <- a + i + (i-1)return a c) def f(n):arr[0] <- 0arr[1] <- 1if n <= 1return arr[n]elsefor i in 2..narr[i] <- arr[i-1] + arr[i-2]return arr[n] d) def f(n):arr[0..n] <- [0, ..., n]if n <= 1return arr[n]elsea <- 0for i in 0..na <- a + arr[i]return a
K + edgenuity.com/player/ s Semester A 7 1 2 3 4 5 05 return 1 else: return n* factorial(n-1) Which line of code includes a recursive function call? 0 3 04 01 Consider the Python code for finding the factorial of an integer n using recursion. Line numbers have been added to the left of each line of code. def factorial(n): if n == 1: Mark this and return c C O M 31 0 DELL O FIXIXI A Save and Exit G < Next English Sign out V 4 19 Kinley Heat TIME REMAINING 59:14 Submit Mar 27 0 2:38
The following function f uses recursion:def f(n):if n <= 1return nelse return f(n-1) + f(n-2)Let n be a valid input, i.e., a natural number. Which of the following functions returns the same result but without recursion?a) def f(n):a <- 0b <- 1 if n = 0return aelsif n = 1 return belsefor i in 1..nc <- a + b a <- b b <- c return bb) def f(n):a <- 0i <- n while i > 0 a <- a + i + (i-1) return ac) def f(n): arr[0] <- 0 arr[1] <- 1 if n <= 1return arr[n]elsefor i in 2..n arr[i] <- arr[i-1] + arr[i-2]return arr[n]d) def f(n): arr[0..n] <- [0, ..., n] if n <= 1return arr[n]elsea <- 0 for i in 0..n a <- a + arr[i]return a
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is: **** *** ** * ** *** ****
Write a recursive function that takes an array and a callback function and returns True if any value of that array returns True from that callback function otherwise returns False.As a callback funtion for this problem, assume that the callback function is used to check if a given input is an even number.- Analyse the running time of the algorithm
Write a recursive function that finds n-th power of number m. Ex:m=3 n=4 Ans=81 WRITE IN PYTHON PLEASE
Write a recursive function F(N) that generalízes the following function: NF(N) 1 2 10 19 4 37 5 70 (Hìnt: F(N) computes the output differently for odd and even values of N! Think about the base case first, then think about what would be the recursive case for the odd value of N and what would be the recursive case for an even value of N!) For example: Test Result print(F(0)) 1 Answer: (penalty regime: 0, 0, 0, 0, 0, 5, 10, 15, 20, .. %)
Write a recursive function called that takes a string of single names separated by spaces and prints out all possible combinations (permutations), each combination on a new line. When the input is: Alice Bob Charlie then the output is: Alice Bob Charlie Alice Charlie Bob Bob Alice Charlie Bob Charlie Alice Charlie Alice Bob Charlie Bob Alice Here is the original code in Python: def all_permutations(permList, nameList): # TODO: Implement method to create and output all permutations of the list of names. pass if __name__ == "__main__": nameList = input().split(' ') permList = [] all_permutations(permList, nameList)