Write a short recursive Java method that determines if a strings is a palindrome, that is, it is equal to its reverse. Examples of palindromes include 'racecar' and 'gohangasalamiimalasagnahog!

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.

Write a recursive method, matchingParen (String str), that returns: true if str is a nesting of zero or more pairs of parentheses, like "())" or "((()". false if str is null, or if str has any character other than right or left parentheses, or if the right and left parentheses do not match. System.out.println( matchingParen( ) ); System.out.println( matchingParen( "(())" ) ); System. out.println( matchingParen( "(()))" ) ); System.out.println( matchingParen( "((x))" ) ); System.out.println( matchingParen( "()))") ); System.out.println( matchingParen( null ) ); //true //true //true //false //false //false Hint: You may check the first and last chars, and then recur on what's inside them. You may also find it easier to use a helper method.

A palindrome is a string that reads the same forward and backward. For example,"deed" and "level" are palindromes. Write an algorithm in pseudocode that testswhether a string is a palindrome. Implement your algorithm as a static method inJava. The method should call itself recursively and determine if the string is apalindrome.Write a main method that reads a string from the user as input and pass it to thestatic method. You need to validate the string and make sure it contains only letters(no digits or special characters are allowed). The main method should displaywhether the string is a palindrome or not. a) Read the string from the user and validate it.b) Create a method that calls itself recursively and returns whether thestring is a palindrome or not.c) Include a test table with at least the following test cases:1. Invalid input. For example, string contains a number or specialcharacter.2. A valid string that is a palindrome.3. A valid string that is not a palindrome.

Write a short recursive Java method that takes a character strings and outputs its reverse. For example, the reverse of 'pots&pans' would be 'snap&stop'.

Is there a way to create a java program on Branching and selecting method on problems like this? Suppose that we are working for an online service that provides a bulletin board for its users. We would like to give our users the option of filtering out profanity. Suppose that we consider the words cat dog and rabbit to be profane. Write a program that reads a string from the keyboard and test whether the string contain any one of these words. Your program should find words like cAt that differ only in case. Have your program reject only lines that contain one or more of the three words exactly. For example, concatenation is a small category should not be considered profane. This problem can be solved easily. If you add a space to the beginning of the string and a space at the end of the string you only need to check if space cat space or space dog space or space rabbit space is in the string. Use three if statements; one for each word. If one or more of the words are there set...

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).

Write a Java program to find the longest common prefix among a given array of strings. If there is no common prefix, return an empty string "".

Write a code that generates a random lowercase letter. In java programming. Note: Not a string of letters just one letter is generated every time the program is run. meaning the output should not be something like this: a c t c -that's a random string, it should only be one random letter generated randomly.

Write a recursive method oddSum that takes a positive odd integer n and returns the sum of odd integers from 1 to n.