We define the following recursive Python function: def cool(n): if n==0: return 2 if n==1: return 1 return cool(n-1)+2*cool(n-2) where n is assumed to be a natural number. Change the cool function into a dyna programming one: def coolDP (n) using memoisation. Note that you can use Python dictionaries for this function.

We define the following recursive Python function: def cool(n): if n==0: return 2 if n==1: return 1 return cool(n-1)+2*cool(n-2) where n is assumed to be a natural number. Change the cool function into a dyna programming one: def coolDP (n) using memoisation. Note that you can use Python dictionaries for this function.

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

Please written by computer source solve the question in python
with python
Write a recursive function that finds the number of occurrences of a specified character in a list. You need to define the following two functions. The second one is a recursive helper function.def count(chars, ch):def countHelper(chars, ch, high):Write a test program that prompts the user to enter a list of characters in one line, and a character, and displays the number of occurrences of the character in the list.
Which is the base case of the following recursion function: def mult3(n): if n == 1: return 3 else: return mult3(n-1) + 3 else n == 1 mult3(n) return mult3(n-1) + 3
This is what you will need to do for the C programming: 1. In quiz1.c implement digit_sum_base function using recursion that calculates the digit sum of a number's presentation with base as base. For example, if base is 2, a binary number, digit_sum_base(5, 2) should be 5's binary reprentation 101, adding up all digits together and we have 2. digit_sum_base(1234, 10) should be 10 = (1+2+3+4). You may assumen is always non-negative integer and base is an integer between 2 to 10 inclusive. 2. In main.c implement the main function so that when we run the program this is what happens: %./main Enter an int: 0 Enter a base: 10 answer is O. $ ./main Enter an int: 1234 Enter a base: 10 answer is 10. $
Write a recursive function that accepts a number and returns its factorial. b. Write a recursive function that accepts an array, its size and the index of the initial element as arguments. The function fills the array with the elements of the following sequence: n1 = 3, nk+1 = nk+35 c. Write an iterative and a recursive versions of the binary search. In C++ coding
Suppose you have to design a number calculation system. You need to write a recursive function that will take a 2 dimensional array / list(in python) of numbers. You need to find the minimum number of the array / list using a recursive function. Implement the following recursive function. [You can not use any loop in the code] Hint: You will need nested recursive functions. [Note for Implementation: You are not allowed to use any built-in functions except len() and print() in Python and any kind of global/class variable]. def firstFunctionMin(arr, index1, index2, min): #To Do return OR public int firstFunctionMin (int [0 arr, int index1, int index2, int min) { //TO Do return Sample Input Sample Output Explanation [[10, 2, 13]. [4, 15, 16]. [7, 8, 2 9]] Here, in the list the minimum number is 2. [[15, 18]. [4, 17]] 4 Here, in the list the minimum number is 4.
Identify the bug in the following recursive function. def sumSquare(numList): if len(numList) : 1: == print numList[0]*+2 else: return numList[0] * +2 + sumSquare(numList[1:]) Syntax error in the last line. Results in an infinite recursion. The else should be elif The == in the if statement should be >= The base case doesn't return anything.
Need some help with this c++ problem In order to compute a power of two, you can take the next-lower power and double it. For example, if you want to compute 211 and you know that 210 = 1024, then 211 = 2 × 1024 = 2048. Based on this observation, write a recursive function int pow2(int n) where n is the exponent. If the exponent is negative, return -1. int pow2(int n) { ..... }
code needed
please solve in python and give code. thankzz
3. Observe the following formulae: fin) = 1 fin) = 3 + f(n-1) fin) = 2 + f(n-1) if n=0 if n is even if n is odd a) Write a direct recursive function based on the formulae above. The function prototype is given as: int f(int n); Note: You don't have to worry about n being less than 0, but beware of 0 being an even number. b) Using mutual recursion and based on the formulae above, complete the function definition for the following function prototypes: int fodd (int n) ; int fEven (int n); c) Write a complete C program to test the direct and mutual recursions that you have written in Parts (a) and (b). Prompt the user for n values.