Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 18, Problem 18.10PE
(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 header:
public static int count(String str, char a)
For example, count(“Welcome”, ‘e’) returns 2. Write a test
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
- use Eclipse or Netbeans to create a project.
- In the new created project, create a recursive method to implement the following formula :
a1 = 3
an = 4 an−1 +1, for n ≥ 2
- Use the main method to test the recursive method for various values of n like : for n=1, n=2, n=3, n= 10;
- write the same method but in sequential form (not Recursive). And compare between results for the same values of n.
using java (data structure )
What is the value of the following math operations?
What is the output of the following code segment?
Chapter 18 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 18.2 - What is a recursive method? What is an infinite...Ch. 18.2 - Prob. 18.2.2CPCh. 18.2 - Show the output of the following programs and...Ch. 18.2 - Prob. 18.2.4CPCh. 18.2 - Prob. 18.2.5CPCh. 18.2 - Write a recursive mathematical definition for...Ch. 18.3 - Prob. 18.3.1CPCh. 18.3 - What is wrong in the following methods?Ch. 18.3 - Prob. 18.3.3CPCh. 18.4 - Describe the characteristics of recursive methods.
Ch. 18.4 - Prob. 18.4.2CPCh. 18.4 - Prob. 18.4.3CPCh. 18.5 - Prob. 18.5.1CPCh. 18.5 - Prob. 18.5.2CPCh. 18.5 - What is a recursive helper method?Ch. 18.6 - Prob. 18.6.1CPCh. 18.6 - How does the program get all files and directories...Ch. 18.6 - How many times will the getSize method be invoked...Ch. 18.6 - Will the program work if the directory is empty...Ch. 18.6 - Will the program work if line 20 is replaced by...Ch. 18.6 - Will the program work if lines 20 and 21 are...Ch. 18.7 - Prob. 18.7.1CPCh. 18.8 - Prob. 18.8.1CPCh. 18.8 - Prob. 18.8.2CPCh. 18.8 - How many times is the displayTriangles method...Ch. 18.8 - Prob. 18.8.4CPCh. 18.8 - Prob. 18.8.5CPCh. 18.9 - Which of the following statements are true? a. Any...Ch. 18.9 - Prob. 18.9.2CPCh. 18.10 - Identify tail-recursive methods in this chapter.Ch. 18.10 - Rewrite the fib method in Listing 18.2 using tail...Ch. 18 - Prob. 18.1PECh. 18 - Prob. 18.2PECh. 18 - (Compute greatest common divisor using recursion)...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Fibonacci series) Modify Listing 18.2,...Ch. 18 - Prob. 18.8PECh. 18 - (Print the characters in a string reversely) Write...Ch. 18 - (Occurrences of a specified character in a string)...Ch. 18 - Prob. 18.11PECh. 18 - (Print the characters in a string reversely)...Ch. 18 - (Find the largest number in an array) Write a...Ch. 18 - (Find the number of uppercase letters in a string)...Ch. 18 - Prob. 18.15PECh. 18 - (Find the number of uppercase letters in an array)...Ch. 18 - (Occurrences of a specified character in an array)...Ch. 18 - (Tower of Hanoi) Modify Listing 18.8,...Ch. 18 - Prob. 18.19PECh. 18 - (Display circles) Write a Java program that...Ch. 18 - (Decimal to binary) Write a recursive method that...Ch. 18 - (Decimal to hex) Write a recursive method that...Ch. 18 - (Binary to decimal) Write a recursive method that...Ch. 18 - (Hex to decimal) Write a recursive method that...Ch. 18 - Prob. 18.25PECh. 18 - (Create a maze) Write a program that will find a...Ch. 18 - (Koch snowflake fractal) The text presented the...Ch. 18 - (Nonrecursive directory size) Rewrite Listing...Ch. 18 - (Number of files in a directory) Write a program...Ch. 18 - (Game: Knights Tour) The Knights Tour is an...Ch. 18 - (Game: Knights Tour animation) Write a program for...Ch. 18 - (Game: Eight Queens) The Eight Queens problem is...Ch. 18 - Prob. 18.35PECh. 18 - (Sierpinski triangle) Write a program that lets...Ch. 18 - (Hilbert curve) The Hilbert curve, first described...Ch. 18 - (Recursive tree) Write a program to display a...Ch. 18 - Prob. 18.39PE
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Test Average Write a program that asks the user to enter three test scores. The program should display each tes...
Starting Out with Java: From Control Structures through Objects (6th Edition)
Type in and run the program presented in this chapter. Check the programs results by comparing the original fil...
Programming in C
Class B extends class A. (Class A is the superclass and class B is the subclass.) Describe the order in which t...
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
The refers to the base class. a. friend keyword b. this keyword c. base keyword d. class keyword
Starting out with Visual C# (4th Edition)
This is an operator that raises a number to a power. a. % b. c. d. /
Starting Out with Python (4th Edition)
What does the phrase garbage in, garbage out mean?
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- What is the number of execution times of the following program?arrow_forwardhi I am writing a recursive method for the sum of a number, it works but I am unsure how it works and I would like to understand how it works? public static int sumDigits(int num) { if (num == 0) { return (0); } return (num%10) + sumDigits(num/10); }arrow_forwardC++ For the following code: int fact(int n) { if (n == 0) return 1; else return n * fact(n - 1); } Which of the following are true? A. Group of answer choices B. This function is not recursive. C. This function is recursive. D. The base case is when n!=0 E. The base case is when n ==0arrow_forward
- C++ can someone help me with this code? The code doesnt run, says there an error at exit(0) and can someone explain in detail how it is using recursive to find the FIB number .. #include <iostream> using namespace std; //main method int main() { //variable declaration int num, num1 = 0, num2 = 1, temp; // getting input from user cout<<"Enter a number (enter a negative number to quit): "; cin>>num; //if the number entered by user is negative then exit the program if (num<0) { //exit statement exit(0); } // 0 and 1 are fibonacci numbers if (num1==num || num2==num) { cout<<"%d is a fibonacci number\n"<< num; return 0; } // checking whether a given number is Fibonacci or not while (num2 <= num) { //assigning the value of second number to temp variable…arrow_forwardWhat does the following code snippet do?arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Program to find HCF & LCM of two numbers in C | #6 Coding Bytes; Author: FACE Prep;https://www.youtube.com/watch?v=mZA3cdalYN4;License: Standard YouTube License, CC-BY