Please code for me in JAVA Consider the following incomplete declaration of a Code class. Portions of the code may be hidden by changing the corresponding letter or digit to an X using the hide method. For example, suppose the following String object is • instantiated: String code = new String("ABCdef123ghi456jkIMNO*); The following code fragment results in the output indicated. Code Fragment String code2 = new String( hide(code, 2, 7) ); System.out.println ( code2); Output ABXXXXX23ghi456jkIMNO The Code class also has a wordTriangle method, which doesn't return anything but takes in a String parameter and prints out a "word triangle" based on that word. For example, the method call to wordTriangle( "triangle" ) would result in the following output: triangle triangl triang trian tria tri tr t public class Code { // precondition: p1 >= 0, p1 < p2 // p2 <= mCode.length // Replaces the characters in the code starting at // position p1 until p2-1, inclusive, with an X public String hide(String code, int p1, int p2) {

Please code for me in JAVA Consider the following incomplete declaration of a Code class. Portions of the code may be hidden by changing the corresponding letter or digit to an X using the hide method. For example, suppose the following String object is • instantiated: String code = new String("ABCdef123ghi456jkIMNO*); The following code fragment results in the output indicated. Code Fragment String code2 = new String( hide(code, 2, 7) ); System.out.println ( code2); Output ABXXXXX23ghi456jkIMNO The Code class also has a wordTriangle method, which doesn't return anything but takes in a String parameter and prints out a "word triangle" based on that word. For example, the method call to wordTriangle( "triangle" ) would result in the following output: triangle triangl triang trian tria tri tr t public class Code { // precondition: p1 >= 0, p1 < p2 // p2 <= mCode.length // Replaces the characters in the code starting at // position p1 until p2-1, inclusive, with an X public String hide(String code, int p1, int p2) {

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter3: Using Methods, Classes, And Objects

Section: Chapter Questions

Problem 1GZ

See similar textbooks

Similar questions

public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string. This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is, str = new StringBuilder(str).reverse().tostring(); A bit convoluted, but does what is needed without fuss or muss. Maybe one day the Java strings will come with the reverse method built in, just like the string data types of all sensible…
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
Define a class called StringFormatter. The purpose of an object of this class is to store a string variable (you may use the C++ string type or a char array). An object of this class can be created by calling a constructor that accepts one string argument. The string to be passed as argument will be a long line of text, such as “The world is indeed full of peril and in it there are many dark places. But still there is much that is fair. And though in all lands, love is now mingled with grief, it still grows, perhaps, the greater.” The object will also have a function called printRightAligned() which accepts one integer argument n. The value of the argument represents the maximum number of characters that can be displayed on a line. This function displays the string stored in the object’s attribute on the screen, right aligned and with no more than n characters per line. Similarly, there should be a function called printLeftAlgigned() which displays the text left aligned, again, with no…
T/F A Java main method uses the parameter (String[ ] variable) so that a user can run the program and supply“command-line” parameters. Since the parameter is a String array, however, the user does not have to supply anyparameters.
Write a C# program to perform the following: Create an object of StringBuilder class:StringBuilder sb = new StringBuilder("Department of "); Write code to demonstrate the usage of Append, Insert, Remove & Replace methods of StringBuilder class on the above object
Computer Science This is a codingbat problem. Please answer in Java and do not change the starter code. You have been asked to write the game of tic tac toe. In the first version of the game, we will only be comparing horizontally for a win. A win is determine by all of the elements in a row either being an X or an O. You need to return a String with the winner or TIE if there is no winner. ticTacToe(["X", "O", "O"], ["X", "O", "O"], ["X", "X", "X"]) → "X"ticTacToe(["X", "O", "X"], ["X", "X", "O"], ["O", "O", "O"]) → "O"ticTacToe(["X", "O", "X"], ["X", "X", "O"], ["O", "X", "O"]) → "TIE" public String ticTacToe(String[] top, String[] middle, String[] bottom) { }
// Application allows user to enter a series of words // and displays them in reverse order import java.util.*; public class DebugEight4 { publicstaticvoidmain(String[] args) { Scanner input =newScanner(System.in); int x =0, y; String array[] =newString[100]; String entry; finalString STOP =XXX; StringBuffer message =new StringBuffer("The words in reverse order are\n"); System.out.println("Enter any word\n" + "Enter + STOP + when you want to stop"); entry = input.next(); while(!(entry.equals(STOP))) { array[x] = entry; ++x; System.out.println("Enter another word\n" + "Enter "+STOP+" when you want to stop"); entry = input.next(); } for(y = x -1; y >0; ++y) { message.append(array[y]); message.append("\n"); } System.out.println(message) }
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 "…
Code with comments and output screenshot. Thank you!! Write a java method that receives a string containing letters of the English alphabet and then prints the Letters having unique frequencies. Notes: 1) Ignore letter case; Uppercase and lowercase letters are considered the same. 2) Do not use methods from the Arrays class.
Which XXX will complete the code to calculate c = a2 + b2 + 2ab ? public class MyCalc { public int powerSq(int num) { return num * num; } public int mult(int a, int b) { return a * b; } public static void main(String [] args) { int a = 1; int b = 2; int c; MyCalc myCalc = new MyCalc(); XXX }} answers: 1) c = powerSq(a) + powerSq(b) + 2 * mult(a); 2) c = powerSq(a, b) + powerSq(a, b) + 2 * mult(a, b); 3) c = myCalc.powerSq(a) + myCalc.powerSq(b) + 2 * myCalc.mult(a); 4) c = myCalc.powerSq(a) + myCalc.powerSq(b) + 2 * myCalc.mult(a, b);
Problem 2: Complete the seperateDuplicateChars () method in Seperate Duplicates.java as follows: The method takes a String str as a parameter and returns a new String. The returned String should be exactly like str, but any identical characters that appear in a consecutive way must be separated by hyphens "-". You may ONLY use the following methods from the String class: charAt(), substring() and length(). Other than uncommenting the code, do not modify the main method in Seperate Duplicates.java. Sample runs provided below. Argument String str "Hello" "Bookkeeper" "Yellowwood door" "Chicago Cubs" Return String "Hel-lo" "Bo-ok-ke-eper" "Yel-low-wo-od do-or" "Chicago Cubs"
1. Divisors: In a class Divisors.java, read in a maximum integer n and use nested loops to print a list of divisors for each of 1 through n as shown in the following transcript. Sample transcript (input underlined): Largest integer? 100 1: 1 2: 1 2 3: 1 3 4: 1 2 4 95: 1 5 19 95 96: 1 2 3 4 6 8 12 16 24 32 48 96 97: 1 97 98: 1 2 7 14 49 98 99: 1 3 9 11 33 99 100: 1 2 4 5 10 20 25 50 100