class StringRecursion{ public static void main(String[] args){ System.out.println(howManyDigits("nBdj^19hb1^3j")); System.out.println(howManyDigits("Elementary data structures")); System.out.println(howManyDigits("H1Lolow2World !")); System.out.println(howManyDigits("")); System.out.println(containsCapital("uteP")); System.out.println(containsCapital("abcba")); System.out.println(containsCapital("12#(1)b!nc!")); System.out.println(containsCapital("12#(1)b!nc!X")); /* Part 2. Added for the Thirsday lab.*/ System.out.println("Checking for Palindromes:"); System.out.println(checkPalindrome("zxcxz")); System.out.println(checkPalindrome("zxccxz")); System.out.println(checkPalindrome("1xccxx1")); System.out.println("Reversing a given string:"); System.out.println(reverseOrder("POT")); System.out.println(reverseOrder("ZIGZAG")); System.out.println(reverseOrder("PETU")); } /** * Write a recursive method to return number of digits a string * contains. * @param str * @return */ static int howManyDigits(String str){ // change the body of this method. return 0; } /** * Write a recursive method to find if a string contains * any capital letter (any letter between A-Z). * @param str * @return */ static boolean containsCapital(String str){ // change the body of this method. return true; } /** Part 2 * Write a recursive method to check if a given string * is a Palindrome. * @param str * @return */ static boolean checkPalindrome(String str){ // change the body of this method. return true; } /** Part 2 * Write a recursive method to reverse the order * of a given string. * @param str * @return */ static String reverseOrder(String str){ // change the body of this method. return "JAVA"; } }

With correct code of the methods, the output of the program will be as follows. 4 0 2 0 true false false true Checking for Palindromes: true true false Reversing a given string: TOP GAZGIZ UTEP