Similar Books

    No books found

Title
Chapter: 18 / Q: 7
(Fibonacci series) Modify Listing 18.2, ComputeFibonacci.java, so that the program finds the number of times the fib method is called. (Hint: Use a static variable and increment it every time the method is called.)
Chapter: 18 / Q: 8
Print the digits in an integer reversely) Write a recursive method that displays an int value reversely on the console using the following header:
Chapter: 18 / Q: 10
(Occurrences of a specified character in a string) Write a recursive method that finds the number of occurrences of a specified letter in a string using the following method heade
Chapter: 18 / Q: 11
(Sum the digits in an integer using recursion) Write a recursive method that computes the sum of the digits in an integer. Use the following method header:
Chapter: 18 / Q: 12
(Print the characters in a string reversely) Rewrite Programming Exercise 18.9 using a helper method to pass the substring high index to the method. The helper method header is: public static void reverseDisplay(String value, int high)
Chapter: 18 / Q: 13
(Find the largest number in an array) Write a recursive method that returns the largest integer in an array. Write a test program that prompts the user to enter a list of eight integers and displays the largest element
Chapter: 18 / Q: 14
(Find the number of uppercase letters in a string) Write a recursive method to return the number of uppercase letters in a string. Write a test program that prompts the user to enter a string and displays the number of uppercase letters in the string
Chapter: 18 / Q: 15
(Occurrences of a specified character in a string) Rewrite Programming Exercise 18.10 using a helper method to pass the substring high index to the method. The helper method header is:
Chapter: 18 / Q: 16
(Find the number of uppercase letters in an array) Write a recursive method to return the number of uppercase letters in an array of characters. You need to define the following two methods. The second one is a recursive helper method
Chapter: 18 / Q: 17
(Occurrences of a specified character in an array) Write a recursive method that finds the number of occurrences of a specified character in an array. You need to define the following two methods. The second one is a recursive helper method
total questions: 772

Questions

772

Views

Best Answers

299

Points

5