Write a program that will contain the following methods: printSub1, printSub2, printSub3, printSub4 – print all substrings of S using recursion. For example, if S = "abcd": printSub1 will print "a", "ab", "abc", "abcd", "b", "bc", "bcd", "c", "cd", "d" printSub2 will print "d", "cd", "bcd", "abcd", "c", "bc", "abc", "b", "ab", "a" printSub3 will print "a", "b", "c", "d", "ab", "bc", "cd", "abc", "bcd", "abcd" printSub4 will print "abcd", "bcd", "abc", "cd", "bc", "ab", "d", "c", "b", "a" Note that the actual output will not have quotation marks around the substrings. The substrings must print in the order shown for each method. You may only use these String methods in your work: length(), substring() Your main method in this program should provide an appropriate menu which allows the user the enter the string of their choice and pick any of the print substring options they want. write the methods recursively and in java

how can i solve this using java?

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

Complete the java program. Use two methods and make one of them recursive

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

write a code in java (using recursion)

A parking lot charges $3 per hour for the first 10 hours of a 24 hour period. There is no further charge starting at the 11th hour and ending at the 24th hour. The charge for a full 24 hour period is therefore $30. The same pattern applies for periods longer than 24 hours. Write a program to calculate the cost in dollars, given the number of hours that the parking lot was used. public class Parking { } public static void main(String[] args) { } // Change hours to get the answer for the those number of hours. int hours = 25; } int result = cost(hours); System.out.println(result); public static int cost(int hours) { int result = 0; // Write your code within the body of this method. return result;

2

Solve in javaFX