Below is a recursive version of binary search, which was not presented inclass.The method contains an error because:1) public static int binarySearch(int[] a, int hi, int low, int mid, int x){2)3)4)5)6)if (low > hi)return -1;else if (a[mid] == x)return mid;else if (x < a[mid])return binarysearch(a,mid-1, low, (low+mid-1)/2,x);3%3D8)9)10) }elsereturn binarysearch(a, hi,mid+1, (mid+1+hi)/2,x);O it never calculates the midpointO it incorrectly mixes up parameters in the recursive call on line 7O it incorrectly mixes up parameters in the recursive call on line 9O it doesn't have a basis caseO none of the above

The correct answer is given in the next step along with an explanation Also, the correct code is…

Below is a recursive version of binary search, which was not presented in class. The method contains an error because: 1) public static int binarySearch(int[] a, int hi, int low, int mid, int x) { 2) 3) 4) 5) 6) 7) 8) 9) 10) } if (low > hi) return -1; else if (a[mid] return mid; else if (x < a[mid]) return binarysearch(a,mid-1, low,(low+mid-1)/2,x); х) =3= else return binarySearch(a,hi,mid+1, (mid+1+hi)/2,x); O it never calculates the midpoint O it incorrectly mixes up parameters in the recursive call on line 7 O it incorrectly mixes up parameters in the recursive call on line 9 O it doesn't have a basis case none of the above

Below is a recursive version of binary search, which was not presented in class. The method contains an error because: 1) public static int binarySearch(int[] a, int hi, int low, int mid, int x) { 2) 3) 4) 5) 6) 7) 8) 9) 10) } if (low > hi) return -1; else if (a[mid] return mid; else if (x < a[mid]) return binarysearch(a,mid-1, low,(low+mid-1)/2,x); х) =3= else return binarySearch(a,hi,mid+1, (mid+1+hi)/2,x); O it never calculates the midpoint O it incorrectly mixes up parameters in the recursive call on line 7 O it incorrectly mixes up parameters in the recursive call on line 9 O it doesn't have a basis case none of the above

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. Write a recursive method expFive(n) to compute y=5^n. For instance, if n is 0, y is 1. If n is 3, then y is 125. If n is 4, then y is 625. The recursive method cannot have loops. Then write a testing program to call the recursive method. If you run your program, the results should look like this: > run RecExpTest Enter a number: 3 125 >run RecExpTest Enter a number: 3125 2. For two integers m and n, their GCD(Greatest Common Divisor) can be computed by a recursive function. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Once m is 0, the function returns n. Once n is 0, the function returns m. If neither is 0, the function can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n. Although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. Meaning your code needs to follow the given algorithm. Then…
Question 31 Below is a recursive version of binary search, which was not presented in class. When calling this method (from the main or other method) what would need to be passed as actual parameters? 1) public static int binarySearch(intO a, int hi, int low, int mid, int x) { 2) if (low > hi) 3) return -1; 4) else if (a[mid] x). return mid; else if (x < a[mid]) return binarySearch(a,mid-1,low, (low+mid-1)/2,x); else return binarySearch(a,hi,mid+1, (mid+1+hi)/2,x); 10) } first parameter - an array to be searched second parameter - the length of the array minus 1 O third parameter - 0 forth parameter - (n-1)/2, where n is the length of the array O fifth parameter - the integer to be searched for O all of the above
JAVA Question 2: For two integers m and n, their GCD (Greatest Common Divisor) can be computed by a recursive method. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Method body: If m is 0, the method returns n. If n is 0, the method returns m. If neither is 0, the method can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n (or m % n). The recursive method cannot have loops. Note: although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. main method: Prompt and read in two numbers to find the greatest common divisor. Call the gcd method with the two numbers as its argument. Print the result to the monitor. Example program run: Enter m: 12 Enter n: 28 GCD(12,28) = 4 And here is what I have so far, package CSCI1302;import java.util.*;public class RecursionDemo { public static void…
9. Ackermann's Function Ackermann's function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Write a method ackermann (m, n), which solves Ackermann's function. Use the following logic in your method: If m = 0 then return n + 1 If n = 0 then return ackermann (m Otherwise, return ackermann(m 1, 1) 1, ackermann (m, n - 1))
1. Let product(n,m) be a recursive addition-subtraction method for multiplying two positive integers. Recursive cases for m = 1 and m < 1 make this method. The return value should be n plus a recursive product() call with n and m - 1. Test a Java method.
Consider the following recursive method: Public static int Fib(int a1, int a2, int n){ if(n == 1) return a1; else if (n == 2) return a2;else return Fib(a1, a2, n-1) + Fib(a1, a2, n-2);} Please draw the recursion trace for Fib(2,3,5)
Public class Utilities { getDigits Method: public static java.lang.String getDigits(java.lang.String str) Returns a string with the digits (if any) present in the str parameter. You can assume str will never be null. You can use Character.isDigit() to determine whether a character is a digit. You may not use an auxiliary method in order to implement this method. Your implementation must be recursive and you may not use any loop construct. From the String class, the only methods you can use are length(), isEmpty(), charAt() and substring. Do not use ++ or -- in any recursive call argument. It may lead to an infinite recursion. For example, use index + 1, instead of index++. Parameters: str - Returns: String with digits or empty string
Java Program: Recursive Method There are n people in a room where n is an integer greater then or equal to 2. Each person shakes hands once with every other person. What is the total number of handshakes in the room? Write a recursive method to solve this problem with the following header:public static int handshake(int n)where handshake(n) returns the total number of handshakes for n people in the room. To get you started if there are only one or two people in the room, then:handshake(1)=0handshake(2)=1
Modify the following operations into a recursive procedure. void ditui(int n) { int i; i=n; } while(i>1) print(i--);
Exercise-3: Write a recursive and iterative methods to convert a decimal number to its binary equivalent string. The iterative algorithm (in pseudo-code) for converting a decimal integer into a binary integer as follows: 1. If the integer is 0 or 1, its binary equivalent is 0 or 1. 2. If the integer is greater than or equal to 2 do the following: 3. Divide the integer by 2. 4. Separate the result into a quotient and remainder. 5. Divide the quotient again and repeat the process until the quotient is zero. 6. Write down all remainders in reverse order as a string. 7. This string is the binary equivalent of the given integer. // Recursive decimal to binary method public static String dec2binRecursive(int n) { if (n<2) return n+ " ". else return dec2binRecursive(n/2) + n%2; } a) Write the Complete program for above Recursive decimal to binary method Algorit b) Iterative decimal to binary method
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.
C# Write a recursive method called Power(base, exponent) that, when called, returns base exponent . For example, Power ( 3, 4 ) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal to 1. The recursion step should use the relationship: base exponent = base * base exponent – 1 The terminating condition occurs when exponent is equal to 1 because base 1 = base Incorporate this method into an application that enables the user to enter the base and exponent. Requirements: In the Main() method, declare three arrays of long data types: baseNumbers, exponents, and results. Each array should be created to hold exactly 5 members. Using a FOR loop, populate the baseNumbers array with random integers between 1 and 50 and populate the exponents array with random integers between 1 and 10. Use a random number generator to create these random numbers. Using another FOR loop, call the Power method, passing it a member of the baseNumbers array and a member of the exponents…