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 particular 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.17CP

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 particular 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

7. Long-Distance CallsA long-distance provider charges the following rates for telephone calls: Rate Category Rate per MinuteDaytime (6:00 a.m. through 5:59 p.m.) $0.07Evening (6:00 p.m. through 11:59 p.m.) $0.12Off-Peak (midnight through 5:59 a.m.) $0.05Write a GUI application that allows the user to select a rate category (from a set of radio buttons), and enter the number of minutes of the call into an Entry widget. An info dialog box should display the charge for the call.

Name and Address The Name and Address Problem Write a GUI program that displays your name and address when a button is clicked. The program’s window should appear as the sketch on the left side of Figure 13-61 when it runs. When the user clicks the Show Info button, the program should display your name and address, as shown in the sketch on the right of the figure.

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…