Write the method catDog. * * Given a String str, return true if the words "cat" and "dog" appear the same * number of times in the string. * * Examples: catDog("catdog") returns true catDog("catcat") returns false * catDog("1cat1cadodog") returns true * * @param str the String to examine. * @return true if there are the same number of cats and dogs.

Write the method catDog. * * Given a String str, return true if the words "cat" and "dog" appear the same * number of times in the string. * * Examples: catDog("catdog") returns true catDog("catcat") returns false * catDog("1cat1cadodog") returns true * * @param str the String to examine. * @return true if there are the same number of cats and dogs.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

Repeating String Write a method that takes a String and an int and return a String that is the original String repeated n times. For example, repeatString("Famous", 3) should return "FamousFamousFamous" The method signature should be public String repeatString(String str, int n) public String repeatString(String str, int n) { //declare a string variable //set up statements for repeating n number of times //create the appropriate return statement }
Java
Use for loop in Java language Write the method stringSplosion().* * The method takes one parameter, a non-empty String str (such as "Code") and* returns a String in the form "CCoCodCode". Notice that this includes the* first character of the original String, followed by the first two characters,* and so on until the whole String is used.* * Examples: stringSplosion("Code") returns "CCoCodCode" stringSplosion("abc")* returns "aababc" stringSplosion("x") returns "x"* * @param str the input String to process.* @return a new String as described above.
1. Write the method named skipChar()* * You are given a String str. Return a new String* where there are two copies of the first character,* no copies of the second, two copies of the third,* and so on.** Examples:* skipChar("hello") returns "hhlloo"* skipChar("cat") returns "cctt"* skipChar("frog") returns "ffoo"** @param str the String to start with* @return a new String as described here*/
Write a method that counts the number of letters ina string using the following header:public static int countLetters(String s)Write a test program that prompts the user to enter a string and displays the numberof letters in the string.
Given an input string, complete a helper method that extracts the vowels and returns the string of the vowels in the input string recursively. All strings are lowercase. Do not use any loops or regular expressions. Test case 1: extractVowel("i love you 3000") "ioeou" Test case 2: extractVowel("aiueo") "aiueo" Given methods: public static String extractVowel (String str) { return extractVowelHelper (str, 0, ""); } 1 2 3 4 private static boolean isVowel (char c){ return c == 'a' || c == 'e' || c == 'i' || c == '0' || == 'u'; } 5. 6. 7.
2. Write a method isPalidrome(String arg) that determines if a String is palindrome or not. Palindrome is when a String remains the same after reversing. The method should return boolean type. For example: MADAM is palindrome.
Write a method isPalidrome(String arg) that determines if a String is palindrome or not. Palindrome is when a String remains the same after reversing. The method should return boolean typeWrite a method isPalidrome(String arg) that determines if a String is palindrome or not. Palindrome is when a String remains the same after reversing. The method should return boolean type
Programming language is: C#
Lab Task 04: Include the methods in the file KMP_Implementation.txt in a complete Java program that prompts for and reads a text string and then a text pattern to search for in the text. It then displays the result of the search. Sample program runs: Enter the text: ABABСАВАВАВСАВАВСАВАВСАВАВКККАВАВСАВАВ Enter the pattern to search for: ABABCABAB Pattern found at these text starting indexes: 0 Enter the text: A KFUPM STUDENT Enter the pattern to search for: KFE Pattern not in text. 7 12 17 29
Write an application that reads a five-letter word from the user and produces every possible three-letter string that can be derived from the letters of that word. For example, the three-letter words produced from the word “bathe” include “ate,” “bat,” “bet,” “tab,” “hat,” “the” and “tea.”
1. Write the method named shift3() You are given a String str. Return a new String where all of the characters are "shifted" by 3. Here is the algorithm to do this 1. Visit each character in the String 2. Create a new char by adding 3 3. Store the new character in the output string Examples: shift3("hello") returns "khoor" shift3("cat") returns "fdw" shift3("frog") returns "iurj" @param str the String to start with @return the rotated String as described here