String class: The “String” class provides a number of methods that examines for a string inside of a string. The term “substring” refers to a string that denotes another string’s part. The “startsWith” method would determine whether calling string of object begins with a specific substring. The method returns “true” if string begins with specified substring, it returns “false” otherwise. The “endsWith” method would determine whether calling string would end with a specified substring. The method returns “true” if string ends with specified substring, it returns “false” otherwise. The “regionMatches” method would determine whether specified regions for two strings match. The first argument of this method can be “true” or “false” that indicates whether a case-insensitive comparison could be performed. StringBuilder class: The “StringBuilder” class is same as “String” class except that contents of “StringBuilder” objects could be changed. It provides several methods that “String” class does not have. The “append” method accepts an argument that might be a primitive data type. It appends a string representation to contents of calling object. The “insert” method accepts two arguments, an integer that specifies position in string of calling object as well as value to be inserted. The “replace” method replaces the occurrences of one character with another character. The “toString” method converts a “StringBuilder” object in to a regular string.

Question

Want to see the full answer?

Answer 1

Question

Chapter 9.4, Problem 9.20CP

Program Plan Intro

String class:

The “String” class provides a number of methods that examines for a string inside of a string.

The term “substring” refers to a string that denotes another string’s part.

The “startsWith” method would determine whether calling string of object begins with a specific substring.

The method returns “true” if string begins with specified substring, it returns “false” otherwise.

The “endsWith” method would determine whether calling string would end with a specified substring.

The method returns “true” if string ends with specified substring, it returns “false” otherwise.

The “regionMatches” method would determine whether specified regions for two strings match.

The first argument of this method can be “true” or “false” that indicates whether a case-insensitive comparison could be performed.

StringBuilder class:

The “StringBuilder” class is same as “String” class except that contents of “StringBuilder” objects could be changed.

It provides several methods that “String” class does not have.

The “append” method accepts an argument that might be a primitive data type.

It appends a string representation to contents of calling object.

The “insert” method accepts two arguments, an integer that specifies position in string of calling object as well as value to be inserted.

The “replace” method replaces the occurrences of one character with another character.

The “toString” method converts a “StringBuilder” object in to a regular string.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Design a dynamic programming algorithm for the Longest Alternating Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest subsequence where the numbers alternate between being larger and smaller than their predecessor The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4] Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4]) Example 2: Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8] Output: 8 ([4, 7, 2, 5, 3, 8, 0,4]) (Take your time with this for the subproblem for this one)

Design a dynamic programming algorithm for the Coin-change problem described below: Input: An amount of money C and a set of n possible coin values with an unlimited supply of each kind of coin. Output: The smallest number of coins that add up to C exactly, or output that no such set exists. The algorithm must take O(n C) time. You must also write and explain the recurrence. Example 1: Input: C24, Coin values = = [1, 5, 10, 25, 50] Output: 6 (since 24 = 10+ 10+1+1 +1 + 1) Example 2: Input: C = 86, Coin values = [1, 5, 6, 23, 35, 46, 50] Output: 2 (since 86 = 46+35+5)

Design a dynamic programming algorithm for the Longest Common Subsequence problem de- scribed below Input: Two strings x = x1x2 xm and y = Y1Y2... Yn Output: The length of the longest subsequence that is common to both x and y. . The algorithm must take O(m n) time. You must also write and explain the recurrence. (I want the largest k such that there are 1 ≤ i₁ < ... < ik ≤ m and 1 ≤ j₁ < ... < jk ≤ n such that Xi₁ Xi2 Xik = Yj1Yj2 ··· Yjk) Example 1: Input: x = 'abcdefghijklmnopqrst' and y = 'ygrhnodsh ftw' Output: 6 ('ghnost' is the longest common subsequence to both strings) Example 2: Input: x = 'ahshku' and y = ‘asu' Output: 3 ('asu' is the longest common subsequence to both strings)