Q1.Write a recursive method to compute the following series:11f(i) =,+-++6....2iWrite a test program that displays f(i) for i = 1, 2, 3, 4, and 5.Sample runi = 1i = 2i = 3i = 4f(i) = 0.50f(i) = 0.75f(i) = 0.92f(i) = 1.04f(i) = 1.14

Answer import java.util.*;import java.lang.*;import java.io.*;import java.math.RoundingMode;import…

Q1. Write a recursive method to compute the following series: 1 1 1 1 f(i) = 4 6. 2i Write a test program that displays f(i) for i = 1, 2, 3, 4, and 5. Sample run i 1 f(i) 2 = 0.50 i f(i) = 0.75 f(i) = 0.92 f(i) = 1.04 f(i) = 1.14 %3D %3D i 3 i = 4 %3D i=5

Q1. Write a recursive method to compute the following series: 1 1 1 1 f(i) = 4 6. 2i Write a test program that displays f(i) for i = 1, 2, 3, 4, and 5. Sample run i 1 f(i) 2 = 0.50 i f(i) = 0.75 f(i) = 0.92 f(i) = 1.04 f(i) = 1.14 %3D %3D i 3 i = 4 %3D i=5

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

1. a) Given a recursive algorithm as below: int F(int n) { if (n <= 1) return 1; else if (n % 2 == 0) return F(n-1) + n; else return F(n/2) - 1; } Illustrate how you will find out the value of F(10) using the above algorithm. You need to show all the steps. b) Given a function as below: int recFx(int a, int b) { If (a < b) return a +b; else return recFx(a - b, b + 1); } Determine the values of: recFx(-10, 8) recFx(148, 78) (11) Must show all the steps.
T/F 11. A recursion will still be replaced by an iteration and the other way around.
The following recursive method get Number Equal searches the array x of 'n integers for occurrences of the integer val. It returns the number of integers in x that are equal to val. For example, if x contains the 9 integers 1, 2, 4, 4, 5, 6, 7, 8, and 9, then getNumberEqual(x, 9, 4) returns the value 2 because 4 occurs twice in x. public static int getNumberEqual(int x[], int n, int val) { if (n< 0) ( return 0; } else { if (x[n-1) == val) { return getNumberEqual(x, n-1, val) +1; } else { return getNumber Equal(x, n-1, val); } // end if ) // end if } // end get Number Equal Demonstrate that this method is recursive by listing the criteria of a recursive solution and stating how the method meets each criterion.
The Fibonacci algorithm is a famous mathematical function that allows us to create a sequence of numbers by adding together the two previous values. For example, we have the sequence:1, 1, 2, 3, 5, 8, 13, 21…Write your own recursive code to calculate the nth term in the sequence. You should accept a positive integer as an input, and output the nth term of the sequence.Once you have created your code, add comments describing how the code works, and the complexity of any code you have created.
Chapter 8 Irvine book, When I compiled this code I get the following errors ;Greatest Common Divisor Comment !Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books and on the Web. Write a test program that calls your GCD procedure five times, using the following pairs of integers: (5,20), (24,18), (11,7), (432,226), (26,13). After each procedure call, display the GCD.! INCLUDE Irvine32.incCalcGcd PROTO,int1:DWORD, int2:DWORD .dataarray SDWORD 5,20,24,18,11,7,438,226,26,13str1 BYTE "Greatest common divisor is: ",0 .codemain PROC mov ecx,LENGTHOF array / 2 mov esi,OFFSET array L1: INVOKE CalcGcd,[esi],[esi+4] mov edx,OFFSET str1 call WriteString call WriteDec call Crlf add esi,TYPE array * 2 loop L1 exitmain ENDP ;---------------------------------------------CalcGcd PROC, int1:DWORD, int2:DWORD;; Calculate the greatest common…
python 3 Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names, then use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia then the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia question: is it any way that i can use ('if' statement as base case, and 'else' statement as recursive case) in the code below? thanks. code: def all_permutations(permList, nameList):# TODO: Implement method to create and output all permutations of the list of names.def createPermutationsList(nameList):f = len(nameList) if f == 0:return [] if f == 1:return [nameList] permList = [] for i in range(f):newList = nameList[i]remaining = nameList[:i] + nameList[i+1:]for p in createPermutationsList(remaining):permList.append([newList] + p)…
Implement a recursive is_palindrome(s:str)->bool function, which checks if the given string is a palindrome or not. Examples: >>> is_palindrome('racecar') True >>> is_palindrome('racecars') False please help my homework and put here screenshot. # instruction said not using loops
Design and implement a recursive program(in java) to determine and print the Nth line of Pascal's triangle, as shown below. Each interior value is the sum of the two values above it. Hint: Use an array to store the values on each line.
Artificial Intelligence (Part - 1) ==================== The Towers of Hanoi is a famous problem for studying recursion in computer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (1) Propose a state representation for the problem?
1.)I have to recursive with python language and was asked to do a buy 2 get 1 free where you have some amount of money(x) each item costs a given amount(y), for each 2 item you get 1 free, builda recursive solution to find out how many items you can buy for x amount of money. 2.) Buy M, get N free Then alter your first answer to allow for the user to enter any M and N for how many you need to buy to get free items