bartleby

Concept explainers

Question
Book Icon
Chapter 9, Problem 12PC
Program Plan Intro

Miscellaneous String Operations

Program Plan:

The detail of “StringOperationsDemo” class is shown below:

  • In the “main()” method,
    • Declare and initialize the variable and array variable.
    • Call the wordCount() method to display the number of words in string.
    • Call the mostFrequent() method to display the most frequently occurring character.
    • Call replaceSubString() method to replace “the” with “that”.
    • Call arrayToString() method to convert an array to a string.
    • Display the converted string.

The detail of “StringOperations” class is shown below:

  • In the “wordCount()” method,
    • Separate the string using a space delimiter.
    • Return the number of words in string.
  • In the “arrayToString()” method,
    • Convert the array value to string.
    • Return the converted string.
  • In the “mostFrequent()” method,
    • Declare the variable.
    • Convert the String to an array and store into “cArray” variable.
    • Create an integer array variable to store the frequencies of the characters in “cArray” variable.
    • The for loop executes until the frequencies length. If yes,
      • Initialize frequencies elements to “0”.
    • The for loop executes until the array length. If yes, loop executes until the array length. If yes,
      • Check frequency of element and then calculate it.
    • The for loop executes until the frequencies length. If yes,
      • Check the frequencies of elements and determine the most frequent character.
    • Return the most frequent character.
  • In the “replaceSubString()” method,
    • Check the “string2” and “string3” are the same. If yes,
      • Return the string.
    • Create an object for “string1”.
    • Determine the first occurrence of “string2”.
    • The while loop executes until the "index" is not equal to “-1”. If yes,
      • Call the replace() method to replace this occurrence of the substring.
      • Find the next occurrence of “string2”.
    • Return the string.

Blurred answer
Students have asked these similar questions
make corrections of this program based on the errors shown. this is CIS 227 .
Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are "Everyone else" should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions
⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t1 and to. Depending on the four possible combinations of values on t1 and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t1 and to in the first place: t1 to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right...

Chapter 9 Solutions

Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)

Ch. 9.3 - Prob. 9.11CP Ch. 9.3 - Prob. 9.12CP Ch. 9.3 - Prob. 9.13CP Ch. 9.3 - Look at the following code: String str1 = To be,... Ch. 9.3 - Prob. 9.15CP Ch. 9.3 - Assume that a program has the following... Ch. 9.4 - Prob. 9.17CP Ch. 9.4 - Prob. 9.18CP Ch. 9.4 - Prob. 9.19CP Ch. 9.4 - Prob. 9.20CP Ch. 9.4 - Prob. 9.21CP Ch. 9.4 - Prob. 9.22CP Ch. 9.4 - Prob. 9.23CP Ch. 9.4 - Prob. 9.24CP Ch. 9.5 - Prob. 9.25CP Ch. 9.5 - Prob. 9.26CP Ch. 9.5 - Look at the following string:... Ch. 9.5 - Prob. 9.28CP Ch. 9.6 - Write a statement that converts the following... Ch. 9.6 - Prob. 9.30CP Ch. 9.6 - Prob. 9.31CP Ch. 9 - The isDigit, isLetter, and isLetterOrDigit methods... Ch. 9 - Prob. 2MC Ch. 9 - The startsWith, endsWith, and regionMatches... Ch. 9 - The indexOf and lastIndexOf methods are members of... Ch. 9 - Prob. 5MC Ch. 9 - Prob. 6MC Ch. 9 - Prob. 7MC Ch. 9 - Prob. 8MC Ch. 9 - Prob. 9MC Ch. 9 - Prob. 10MC Ch. 9 - To delete a specific character in a StringBuilder... Ch. 9 - Prob. 12MC Ch. 9 - This String method breaks a string into tokens. a.... Ch. 9 - These static final variables are members of the... Ch. 9 - Prob. 15TF Ch. 9 - Prob. 16TF Ch. 9 - True or False: If toLowerCase methods argument is... Ch. 9 - True or False: The startsWith and endsWith methods... Ch. 9 - True or False: There are two versions of the... Ch. 9 - Prob. 20TF Ch. 9 - Prob. 21TF Ch. 9 - Prob. 22TF Ch. 9 - Prob. 23TF Ch. 9 - int number = 99; String str; // Convert number to... Ch. 9 - Prob. 2FTE Ch. 9 - Prob. 3FTE Ch. 9 - Prob. 4FTE Ch. 9 - The following if statement determines whether... Ch. 9 - Write a loop that counts the number of space... Ch. 9 - Prob. 3AW Ch. 9 - Prob. 4AW Ch. 9 - Prob. 5AW Ch. 9 - Modify the method you wrote for Algorithm... Ch. 9 - Prob. 7AW Ch. 9 - Look at the following string:... Ch. 9 - Assume that d is a double variable. Write an if... Ch. 9 - Write code that displays the contents of the int... Ch. 9 - Prob. 1SA Ch. 9 - Prob. 2SA Ch. 9 - Prob. 3SA Ch. 9 - How can you determine the minimum and maximum... Ch. 9 - Prob. 1PC Ch. 9 - Prob. 2PC Ch. 9 - Prob. 3PC Ch. 9 - Prob. 4PC Ch. 9 - Prob. 5PC Ch. 9 - Prob. 6PC Ch. 9 - Check Writer Write a program that displays a... Ch. 9 - Prob. 8PC Ch. 9 - Prob. 9PC Ch. 9 - Word Counter Write a program that asks the user... Ch. 9 - Sales Analysis The file SalesData.txt, in this... Ch. 9 - Prob. 12PC Ch. 9 - Alphabetic Telephone Number Translator Many... Ch. 9 - Word Separator Write a program that accepts as... Ch. 9 - Pig Latin Write a program that reads a sentence as... Ch. 9 - Prob. 16PC Ch. 9 - Lottery Statistics To play the PowerBall lottery,... Ch. 9 - Gas Prices In the student sample program files for...
Knowledge Booster
Background pattern image
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
    SEE MORE QUESTIONS
    Recommended textbooks for you
    Text book image
    EBK JAVA PROGRAMMING
    Computer Science
    ISBN:9781337671385
    Author:FARRELL
    Publisher:CENGAGE LEARNING - CONSIGNMENT
    Text book image
    Microsoft Visual C#
    Computer Science
    ISBN:9781337102100
    Author:Joyce, Farrell.
    Publisher:Cengage Learning,
    Text book image
    EBK JAVA PROGRAMMING
    Computer Science
    ISBN:9781305480537
    Author:FARRELL
    Publisher:CENGAGE LEARNING - CONSIGNMENT
    Text book image
    Programming Logic & Design Comprehensive
    Computer Science
    ISBN:9781337669405
    Author:FARRELL
    Publisher:Cengage
    Text book image
    C++ Programming: From Problem Analysis to Program...
    Computer Science
    ISBN:9781337102087
    Author:D. S. Malik
    Publisher:Cengage Learning
    Text book image
    C++ for Engineers and Scientists
    Computer Science
    ISBN:9781133187844
    Author:Bronson, Gary J.
    Publisher:Course Technology Ptr