Question

Need to fill the comments with code that works.

Create The Starting Template for this program is shown below. Fill in code where you see highlighted in these highlighted sections that do what the comments request. Don't modify maint) or the printCounts0 routine. When you run your program, you will need to eater in a string for the 'readString" method. Use a package named string methods for this program ructions in the methods readString), countOccurrences0.. ete. Write code the string: Aardvarks get big and bigger as You feed them big and bigger ants who Feed on apples. package string methode : import dava.utst.scanrer: public class MystringMethods i tarting Template private sEring myst public void readString) // Prompt the user and read in a String rom a Scenner class from the keyboard // with the nextLine ( method and store it in "mystr public vosd setString (String s) public int countoccurrences (String s) // use indexof and return the number of oceutrences of the string" in "mystr public int countoeeurrences (ehar c // use indexo and return the numbez of occurrences os the character "myStr" "c" in int countUppercaseletters () // return the number of upper case letters in "aystz int countLowerCaseLetters()

Answer 1

Hi please find the answer

If you have any query please let me know first by comment i will give solutions

===========================================================

MyStringMethods.java

import java.util.Scanner;

public class MyStringMethods {

private String myStr="";

public void readString()

{

// Prompt the user and read in a String form a Scanner class from the keyboard

// with the nextLine() method and store in "myStr"

System.out.println("Enter in the desired String:");

Scanner scan= new Scanner(System.in);

myStr=scan.nextLine();

}

// method to set the string

public void setString(String s)

{

myStr=s;

}

// method to count the number of occurrence of string

public int countOccurrences(String s)

{

// user indexOf and return the number of occurrences of the string "s"

// in "myStr"

int count=0;

String word[]=myStr.split(" ");

for(int i=0;i<word.length;i++)

{

int index=word[i].indexOf(s);

if(index!= -1)

{

count++;

}

}

return count;

}

public int countOccurrences(char c)

{

// use indexOf and return the number of occurrences of the character "c" in "myStr"

int count=0;

String word[]=myStr.split(" ");

for(int i=0;i<word.length;i++)

{

for (int j = -1; (j = word[i].indexOf(c, j + 1)) != -1; j++) {

if(j!= -1)

{

count++;

}

}

}

return count;

}

int countUpperCaseLetters()

{

// return the number of upper case letter in "myStr"

char[] ch=myStr.toCharArray();

int count=0;

for(int i=0; i<myStr.length();i++) {

if(Character.isUpperCase(myStr.charAt(i))){

count++;

}

}

return count;

}

int countLowerrCaseLetters()

{

// return the number of lower case letter in "myStr"

char[] ch=myStr.toCharArray();

int count=0;

for(int i=0; i<myStr.length();i++) {

if(Character.isLowerCase(myStr.charAt(i))){

count++;

}

}

return count;

}

public void printCounts(String s, char c)

{

System.out.println("**************************************");

System.out.println("Analyzing: myStr= "+myStr);

System.out.println("Number of Upper case Letters= "+countUpperCaseLetters());

System.out.println("Number of Lower case Letters= "+countLowerrCaseLetters());

System.out.println("Number of "+s +" is "+ countOccurrences(s));

System.out.println("Number of "+c +" is "+ countOccurrences(c));

}

public static void main(String[] args) {

MyStringMethods msm = new MyStringMethods();

msm.readString();

msm.printCounts("big", 'a');

msm.setString("Parked in a van down by the river bank .... The van evan vanished neart a lot of other vans");

msm.printCounts("van", 'a');

MyStringMethods msm2=new MyStringMethods();

msm2.setString("the elephant in the room wouldn't budge");

msm2.printCounts("the", 'i');

}

}

======================================================

Output

==========================================================

If you have any query please let me know first by comment i will give solutions