Write a short recursive Java method that determines if a string s is a palindrome, that is, it is equal to its reverse. Examples of palindromes include 'racecar' and 'mom'. Test the method by asking the user to provide string entries to be checked. Hint: Check the equality of the first and last characters and recur (but be careful to return the correct value for both odd and even-length strings).

How do I add, If s is null, the method should return null. If s is the blank string, "", the method should return the blank string to my code? import java.util.Scanner;public class replaceFirst { public static String replaceFirst(String Str,char c) { Str = Str.substring(0,0) + c + Str.substring(0 + 1);// modified string return Str; } public static void main(String[] args) { System.out.print( replaceFirst("basant",'c')); } }

Write the following programs in Java: In the Converter class write the static method, bin2decimal(String bin). The parameter for this method is an unsigned (nonnegative) binary number represented by a string. The method returns the decimal equivalent for the binary parameter, as an integer.If the binary string is invalid (contains characters other than ‘0’ and ‘1’), the method returns -1. Convert from a binary (b) string with up to 16 digits to decimal (d) using the following formula:? = ?0 + ?1 ×ばつ 2 + ?2 ×ばつ 22 +⋯+ ?7 ×ばつ 215where b0, b1, ?2, ... ?7 are the binary digits in order of increasing significance. For example, 1101 is: 1 +たす 0×ばつかける2 +たす 1×ばつかける22 +たす 1×ばつかける23 =わ 13 in decimal. Side note: You may NOT use the decode method of the Long wrapper class instead of this formula. In the Converter class write another static method, english2encrypted(String english). The parameter for this method is a word or sentence represented by a string. The word or sentence should only contain letters (no digits,...

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 in JAVA

With Java, use single, two-way and multi-way if statements to write different kinds of loops that process Strings.

Create a method in JAVA that returns a string when it receives three ints

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.

Computer Programming Java Write a method named FirstHalf that receives a String parameter named word and then returns the first half of the string. You are guaranteed as a precondition that word has an even length greater than 1.

Consider the following method: public boolean isprefix(String s1, String s2) {int i = 0;if(s1.length > s2.length) return false;while(i < s1.length) {if(s1[i] != s2[i])return false;i++;}return true;} Exactly how many lines of code (statements) are executed by the method isprefix() in the worst case? Express your answer in terms of n, the length of the string s1. Hint: simplify your final answer as much as possible, and do not put spaces in your answer. Use juxtaposition for the multiplication operator, for example to write "nine times n" write "9n" not "9xn" or "9*n"; to write "four times (n+2)" write "4(n+2)", not "4x(n+2)" or "4*(n+2)". Do not write your answer in Big-O notation. Write the exact number of lines executed.

USING JAVA Implement two methods that: Capitalize the first letter of each word in the given text. Reverse the characters in the words that are in the odd positions of the original text. Add a test program that exercises these methods for a string with at least tenwords in it. For example: The original text is "learning javafx is fun! javafx is a powerful library." The result and reversed text will be "Learning xfavaJ Is !nuF Javafx sI A lufrewoP Library."

Write the code in java and please dont plagarise or copy from other sources write it on your own and read the question carefully and do what in the question says thank you.