Write a JAVA program that wouldmatch a string. It accepts twoinputs: the phrase/sentence string(text) and the pattern string (word).The program finds the first (or all)instances of the pattern in the textand changes that word in alluppercase and displays its numberof occurrences.Sample Input:Text string: You will always have mylove, my love, for the love I love is aslovely as love itself.Pattern string: loveSample Output:New text: You will always have myLOVE, my LOVE, for the LOVE I LOVEis as lovely as LOVE itself.Number of occurrence: 5

I have provided java code along with output screenshot-----------------

Write a JAVA program that would match a string. It accepts two inputs: the phrase/sentence string (text) and the pattern string (word). The program finds the first (or all) instances of the pattern in the text and changes that word in all uppercase and displays its number

Write a JAVA program that would match a string. It accepts two inputs: the phrase/sentence string (text) and the pattern string (word). The program finds the first (or all) instances of the pattern in the text and changes that word in all uppercase and displays its number

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

java Given a String str, find and print the shortest words. The String will have multiple words separated by commas and spaces. If there is words that have the same length, they should all be displayed at the end. Print all the shortest words in the following format: Input: word1, word2, word3, word4, etc... Output: [short1, short2, short3, etc...] Hint: Think about what comes between each word in the sentence Main topics: arrays, String, loops, if statements, primitive datatypes, operators Example: Input: olive, fish, pursuit, old, warning, python, java, coffee, cat, ray Output: [old, cat, ray] Scanner scan = new Scanner(System.in); String str = scan.nextLine();
java program Write code that accomplishes the following tasks. Consider two bags that can hold strings. One bag is named letters and contain seeral one-letter strings. The other bag is empty and is namedvowels. One at a time removed a string from letters. If the string contain a vowel place it into bag vowels, otherwise, discard the string. After you have checked all of the strings in letters, report the number of vowels and the number of times each voewl appears in the bag.
Language: Java Write a program that reads a sentence from the keyboard. Depending on the last character of the sentence, print the message identifying the sentence as declarative (ends with a period), interrogative (ends with a question mark), exclamatory (end with an exclamation point), or other. Hint: you can use charAt() method from the String class to extract the last character of the input line. The character of a String str is at str.length()-1 position. For taking a sentence as input use the nextLine() method from the Scanner class. You have to use if/else if selection. Sample input and output: Sample 1 Input: How are you? Output: Interrogative Sample 2 Input: I am good. Output: Declarative Sample 3 Input: That is amazing! Output: Exclamatory Sample 4 Input: Although, Output: Other Answer:
Write a java program that would match a string. It accepts two inputs: the phrase/sentence string (text) and the pattern string (word). The program finds the first (or all) instances of the pattern in the text andchanges that word in all uppercase and displays its number of occurrences. Sample Input:Text string: You will always have my love, my love, for the love I love is as lovely as love itself. Pattern string: love Sample Output:New text: You will always have my LOVE, my LOVE, for the LOVE I LOVE is as lovely as LOVE itself. Number of occurrence: 5
Write in C Language Spilitology Yosef is a peculiar fellow. He introduced the idea to study a string by splitting it into two, and he called it Splitology. Why split a string? We do not know. Didn’t we say that Yosef is a weird one? Yosef is interested in one particular type of string, a palindrome. A palindrome is a string that is the same for both forwards and backwards. Example of palindrome strings are “ada”, “taat”, and “radar”. On the other hand, string such as “taman” is not a palindrome; notice that “taman” becomes “namat” if read backwardsand it’s not the same as “taman”. As the idea of Splitology is still new, Yosef is investigating whether a string can be split into two non-empty strings such that each string is a palindrome. For example, the string “malamini” can be split into “malam” and “ini” while both of them are palindrome. Another example is “ababab”. It can be split into “aba” and “bab”, and both of them are palindrome. Note that “ababab” can also be split into…
Write a java program with a method that reverses a string The method must accept one parameter of type String (string to reverse), and returns every second element from the end to the beginning. For example: String: thisisstringResult is: g i t s s h
The files provided in the code editor to the right contain syntax and/or logic errors. In each case, determine and fix the problem, remove all syntax and coding errors, and run the program to ensure it works properly. // Converts a string to lowercase, and // displays the string's length // as well as a count of letters public class DebugSeven4 { public static void main(String[] args) { String aString = "HELP!! I need to get 37 things DONE today!!"; int numLetters = 0. int stringLength = aString.Length(); System.out.println("In all lowercase, the sentence is: "); for(int i = 0; i < stringLength; i++) { char ch = Character.toTheLowerCase(aString.charAt(i)); System.out.print(ch); if(Character.isLetter(ch)) numLetters--; } System.out.println(); System.out.println ("The number of CHARACTERS in the string is " + stringLength); System.out.println(The number of LETTERS is "…
IN JAVA Create a function that takes a string and returns the number of alphanumeric characters that occur more than once. Examples duplicateCount ("abcde") → 0 duplicateCount ("aabbcde") → 2 duplicateCount ("Indivisibilities") → 2 duplicateCount ("Aa") → 0 // Case sensitive
Write the program that has two subroutines: one that builds a String object of a specified size and another that builds a StringBuilder object of the same size. Each of the subroutines is timed, using objects from the Timing class we developed at the beginning of the book. This procedure is repeated three times, first for building objects of 100 characters, then for 1,000 characters, and finally for 10,000 characters. The times are then listed in pairs for each size. code in c#
String and StringBuffer both represent String objects. Can we compare String and StringBuffer in Java?
only in java language Design a java program with an algorithm that will take a string from the user and then decide if each character in that string is unique. For example, if you ask the user to enter a string and that user enters the world ‘hello’, the result of the algorithm implemented should return ‘false’ or ‘not unique’. If the user enters a string such as the word ‘phone’ the program will return ‘true’ or ‘unique’ since every character in the word phone is unique and is not repeated. An example of this program follows: Your code should work for all strings and essentially all characters, as many examples will be tested.
DescriptionA researcher is analyzing DNA. A DNA can be represented as a string composed of the characters A, G, C, or T.One day, researchers found a strange DNA, which is Smooth Repeated DNA. The DNA is represented by a string that has infinite length. The string has a repeating pattern, i.e. the DNA string 0 is repeated an infinite number of times. For example, if0 = "????", then = "???????????? . . . ".According to researchers, a DNA is said to be special if it contains substrings . Determine whetheris a substring of . Squad FormatA line containing the two strings 0 and . Output FormatA line that determines whether it is a substring of . Issue “YES” ifis a substring of . Output “NO” otherwise. Example Input and Output Input Example Example Output AGCT GC YES AGCT TA YES AGCT GT No AGCT TAGCTAGCT YES AGGACCTA CTAA YES Explanation ExampleIn the first to fourth test case examples, is worth "???????????? . . . ". The part in bold is one of the…