2. Consider the following recursive algorithm implemented as a Java method: public static boolean isPalindrome (String s) { if (s.length() == return true; 0) { } else if (s.length() return true; == } 1) { } else if (s.charAt(0) != s.charAt(s.length()-1)) { return false; } else { return isPalindrome (s.substring(1, s.length()-2)); Assuming that the recursive call takes 15 basic operations, a return statement takes 3 basic operations and that any of the if statements takes 7 basic operations, give a recurrence describing the worst-case running time for this algorithm.

2. Consider the following recursive algorithm implemented as a Java method: public static boolean isPalindrome (String s) { if (s.length() == return true; 0) { } else if (s.length() return true; == } 1) { } else if (s.charAt(0) != s.charAt(s.length()-1)) { return false; } else { return isPalindrome (s.substring(1, s.length()-2)); Assuming that the recursive call takes 15 basic operations, a return statement takes 3 basic operations and that any of the if statements takes 7 basic operations, give a recurrence describing the worst-case running time for this algorithm.

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

Consider the following recursive method in Java that determines ifa string is a palindrome (i.e., reads the same forward or backwards) or not: Public boolean isPalindrome ( String str ){If( str.length() ≤ 1 )return true;elsereturn ( str.charAt (0) == str.charAt( str.length() – 1 ) &&isPalindrome( str.substring(1..str.length() - 1)));} // end of isPalindrome a. Explain convincingly why the recurrence below for f(n), where n is the length of the string parameter str, is a correct expression for the number of primitive operationsrequired by a call isPalindrome.t(0) = Θ(1)t(1) = Θ(1)t(?) = t(? − 2) + Θ(1)b. Show that t(n) = Θ(n), solves the recurrence for t(n) in (a) above.
The following recursive method called z is created. This method accepts two parameters: A string s, and an integer index The code in the method is: if (index == s.length()) return ""; <------ base case if(index % 2 == 0) return ""+ s.charAt(index) + z(s,index+1); <---- recursive call else return z(s,index+1); <----- recursive call What would be the output with the call: z("javajavajava",0);
Consider a recursive method below. static void mysteryRecursion (String x) { if (x.length() < 1) { System.out.println(x); } else { System.out.println (x.charAt (0) + " " + x.charAt (x.length () - 1)) ; mysteryRecursion (x.substring (1, x.length () - 1)); What gets printed if I make the method call mysteryRecursion("helloworld");
The method is in fact faulty. Give a test input (String) that will make the method to fail -- i.e., it will throw an exception when it is executed with the input).
Convert the following Java method to a functionally equivalent iterative method without any recursion. public static double fun(int n) { if (n == 0) return 0; else return 1.0/(n+fun(n-1)); }
Write a recursive method in java that sums all values between s and n inclusive /* assume s is less than or equal to n to start */ public static int sum(int s, int n) { }
Consider the following recursive method: public int recursiveMethod (int n) if (n <= 0) return 0; else int smaller = n - 1; return recursiveMethod (smaller) + n (n - 1); What is the integer return of a call recursiveMethod (5)? 36 39 40 44 Next Page Previous Page
Write a recursive method oddSum that takes a positive odd integer n and returns the sum of odd integers from 1 to n.
PLZ help with the following: In Java Write a program using recursion to display all valid (i.e. properly open and closed) combinations of n-pairs of parentheses.