Consider the following recursive method in Java that determines if a 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; else return ( 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 operations required 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.

Consider the following recursive method in Java that determines if a 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; else return ( 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 operations required 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.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Write a method(recursive) in Java programming language, where we pass an array of numbers and method returns the smallest number.
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) { }
Write a recursive Java method that takes a String as a parameter and returns true if the String is a palindrome. You may assume that the string only contains lower case characters (i.e. no numbers, spaces, punctuation, etc).
Write a Non tail recursion and a tail recursion method in Java with a test class that does the following: The factorial of a positive integer n —which we denote as n!—is the product of n and the factorial of n 1. The factorial of 0 is 1. Write two different recursive methods in Java that each return the factorial of n. Please and Thank you
Write a RECURSIVE method called “sequence” that takes a single int parameter (n) and returns the int value of the nth element of the sequence S = 2, 4, 6, 12, 22, 40, 74, 136, 250, 460, … Where S is defined by the recursive formula: For n >= 0S(0) = 2; // Base case 1S(1) = 4; // Base case 2S(2) = 6; // Base case 3S(N) = 2 * ( S(N-1)/2 + S(N-2)/2 + S(N-3)/2)
Write a recursive method called doubleDigits that accepts an integer n as a parameter and returns the integer obtained by replacing every digit of n with two of that digit. For example, doubleDigits(348) should return 334488. The call doubleDigits(0) should return 0. Calling doubleDigits on a negative number should return the negation of calling doubleDigits on the corresponding positive number; for example, doubleDigits(–789) should return –778899.
Write a method called isAbecedarian that takes a String and returns a boolean indicating whether the word is abecedarian. Your method can be iterative or recursive. in JAVA
Write a java recursive method called printNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12
Write a java method: public static String repeat(String str, int num) that returns the string str repeated n times. For Example: repeat("delta", 4) returns "deltadeltadeltadelta".
How to write a recursive method called palindrome and a non-recursive method called palindromenonrecursive in java that determine if a string is a palidrome (ignore characters that are not letters). Then write a driver to test the two versions of the two methods. (A palindrome is a string that reads the same forward as well as backward. For example, “otto” and “never odd or even” are palindromes)
Write a recursive method called reverseString() that takes in a string as a parameter and returns the string in reversed order. The main method is provided to read a string from the user and call the reverseString() method. Use Java. Ex: If the input of the program is: Hello the reverseString() method returns and the program outputs: Reverse of "Hello" is "olleH". Ex: If the input of the program is: Hello, world! the reverseString() method returns and the program outputs: Reverse of "Hello, world!" is "!dlrow ,olleH". Hint: Move the first character to the end of the returning string and pass the remaining sub-string to the next reverseString() method call. import java.util.Scanner; public class LabProgram { /* TODO: Write recursive reverseString() method here. */public static void main(String[] args) {Scanner scnr = new Scanner(System.in);String input, result;input = scnr.nextLine();result = reverseString(input); System.out.printf("Reverse of \"%s\" is \"%s\".", input, result);}}
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 (until -1), and use a recursive method to create and output all possible orderings of those names separated by a comma, one ordering per line. When the input is: Julia Lucas Mia -1 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