problem3 replace Write a method that accepts a String as a parameter and returns a String where every appearance of the lowercase word "are" has been replaced with "are not". The word "are" should not be immediately preceded or followed by a letter -- so for example the "are" in "care" or "scared" does not count. (Note: Character.isLetter (char) tests if a char is a letter.) Examples: problem3_replace ("are test"); // returns "are not tests" problem3_replace ("are-are"); // returns "are not-are not" problem3_replace ("These are right"); // returns "These are not right" problem3_replace ("I love Java!"); // returns "I love Java!" problem3_replace ("My favorite numbers are3 and 5."); // returns "My favorite numbers are not3 and 5." problem3_replace ("I dare you"); // returns "I dare you"

problem3 replace Write a method that accepts a String as a parameter and returns a String where every appearance of the lowercase word "are" has been replaced with "are not". The word "are" should not be immediately preceded or followed by a letter -- so for example the "are" in "care" or "scared" does not count. (Note: Character.isLetter (char) tests if a char is a letter.) Examples: problem3_replace ("are test"); // returns "are not tests" problem3_replace ("are-are"); // returns "are not-are not" problem3_replace ("These are right"); // returns "These are not right" problem3_replace ("I love Java!"); // returns "I love Java!" problem3_replace ("My favorite numbers are3 and 5."); // returns "My favorite numbers are not3 and 5." problem3_replace ("I dare you"); // returns "I dare you"

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

JAVAA7-Write a class with a constructor that accepts a String object as its argument. The class should have a method that returns the number of vowels in the string, and another method that returns the number of consonants in the string. Demonstrate the class in a program by invoking the methods that return the number of vowels and consonants. Print the counts returned.
JAVA PPROGRAM ASAP Please create this program ASAP BECAUSE IT IS MY LAB ASSIGNMENT so it passes all the test cases. The program must pass the test case when uploaded to Hypergrade. Chapter 9. PC #2. Word Counter (page 608) Write a method that accepts a String object as an argument and returns the number of words it contains. For instance, if the argument is “Four score and seven years ago” the method should return the number 6. Demonstrate the method in a program that asks the user to input a string and then passes it to the method. The number of words in the string should be displayed on the screen. Test Case 1 Please enter a string or type QUIT to exit:\nHello World!ENTERThere are 2 words in that string.\nPlease enter a string or type QUIT to exit:\nI have a dream.ENTERThere are 4 words in that string.\nPlease enter a string or type QUIT to exit:\nJava is great.ENTERThere are 3 words in that string.\nPlease enter a string or type QUIT to exit:\nquitENTER
Write a method that accepts a string as an argument and checks it for proper capitalization and punctuation. The method should determine if the string begins with an uppercase letter and ends with a punctuation mark. The method should return true if the string meets the criteria; otherwise it should return false.
5. Add a firstname parameter of type String to myMethod, and output "Azeneth Garcia". static void myMethod
In the class String, the substring method inserts a String into another String. -True or -False
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.
Q1) Write a method that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, "silent" and "listen" are anagrams. Write a test program that prompts the user to enter two strings and, if they are anagrams, displays "anagram", otherwise displays "not anagram". Note: The header of the method is as follows: public static boolean isAnagram(String s1, String s2) Sample Input #1: Enter two strings: Silent listen Sample Output #1: The string “Silent” and “listen” are anagrams. Sample Input #1: Enter two strings: teach peach Sample Output #1: The string “teach” and “peach” aren’t anagrams.
Questioin: Hidden Secret Problem! In this problem, you are given two names, you have to find whether one name is hidden into another. The restrictions are: You can change some uppercase letters to lower case and vice versa. You can add/remove spaces freely. You can permute the letters. And if both the names match exactly, then you can say that one name is hidden into another. Input Input starts with an integer T (≤ 100), denoting the number of test cases. Each case starts with two lines. Each line contains a name consists of upper/lower case English letters and spaces. You can assume that the length of any name is between 1 and 100(inclusive). Output For each case, print the case number and Yes if one name is hidden into another. Otherwise print No. Sample Input Output 3 Tom Marvolo Riddle I am Lord Voldemort I am not Harry Potter Hi Pretty Roar to man Harry and Voldemort Tom and Jerry and Harry Case 1: Yes Case 2: Yes Case 3: No And I want…
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 }
Part I: PrintVertical.java Write a program that will prompt the user to enter a sentence (string data), read that sentence into your program as a single string, and then finally process the string by calling the method specified below (vertical). You must process the sentence by calling the method rather than processing the string directly in your main method. Write a void method, vertical, which receives a string as a parameter and prints each letter of the string to the screen on separate lines. Example Execution (user input in green) Please enter a sentence: Hey there! Your sentence printed vertically is: H e t h e r
True or False: The String class’s replace method can replace individual characters, but cannot replace substrings.
In this assignment you will use the MyString class that you wrote earlier in this course. A palindrome is a string that reads the same forward and backward. Write a program that reads in any number of MyStrings from the user and determines if each MyString is a palindrome. The user will terminate each MyString by pressing the return (or enter) button. The user will indicate that there are no more MyStrings by entering "quit". To do this you must write a recursive function named isAPalindrome that takes a single MyString argument and two arguments that are bounds on MyString indices. The function must examine the part of the argument between the two bounds (including the bounds) and return true if this part of the argument is a palindrome, false if it is not a palindrome. The function must be recursive and must not call any other functions except ispunct(), isspace(), and toupper() (described below). Do not make any changes to the MyString class (except, if necessary, to correct errors…