In netbeans, Write a method named findLastTwoLetters that is passed a String parameter and that prints the last two letters of the string. For example, “ta” is returned if the parameter is “Roberta”. You are guaranteed as a precondition that the parameter will have a length greater than 1. This method can be completed using substring().

There is an error for type in ProgramNode.java. Please fix the error and show the fixed code for ProgramNode.java with the screenshot of the working code.

Java allows for methods to be chained together. Consider the following message from the captain of a pirate ship: String msg1 = " Maroon the First Mate with a flagon of water and a pistol! ";   We want to change the message to read the message msg1:   String msg2= “Maroon the Quartermaster with a flagon of water.”   Three changes need to be made to adjust the string as desired:   Trim the leading and trailing whitespace. Replace the substring First Mate with Quartermaster. Remove "and a pistol!" Add a period at the end of the sentence. A “chaining1” method which will apply in sequence 4 operations to perform the above. We will use the trim, replace, and substring methods, in this order. Thus the chaining1 method will receive a string msg1 and return a string msg2. Make sure msg2 is printed. A “chaining2” method which will apply the 4 operations above in one single statement. Thus the chaining2 method will receive a string msg1 and return as string msg2. Make sure msg2 is printed

The play method in the Player class of the craps game plays an entire game without interaction with the user. Revise the Player class so that its user can make individual rolls of the dice and view the results after each roll. The Player class no longer accumulates a list of rolls, but saves the string representation of each roll after it is made. Add new methods rollDice, getNumberOfRolls, isWinner, and isLoser to the Player class. The last three methods allow the user to obtain the number of rolls and to determine whether there is a winner or a loser. The last two methods are associated with new Boolean instance variables (winner and loser respectively). Two other instance variables track the number of rolls and the string representation of the most recent roll (rollsCount and roll). Another instance variable (atStartup) tracks whether or not the first roll has occurred. At instantiation, the roll, rollsCount, atStartup, winner, and loser variables are set to their appropriate…

Hello! I am having a problem trying to code a addNode method implementation to my program. I am trying to only get it to sort the lines alphabetically and then the categories will be sorted from the way it is first read in the input text file.So an input file would look like this: Name Clovis Bagwell Interesting The quick brown fox jumped over the lazy dog. Interesting Shake rattle and roll. Name Archibald Beechcroft   and the output file should look like this: Name               Archibald Beechcroft Clovis Bagwell Interesting Shake rattle and roll. The quick brown fox jumped over the lazy dog.   My addNode code keeps organizing all of the categories and the lines in alphabetical order when categories is supposed to be organized by the way they are first read in the text file, and the lines under it are alphabetical.

"000" is a string commonly found in weak passwords. Count the number of occurrences of "000" in keyWord and remove all instances of "000" from keyword. Ex: If the input is 000kgnklv$L#x000, then the output is: Number of violations: 2 Remaining string: kgnklv$L#X Note: string.find(item) returns the index of the first occurrence of item in string. If no occurrence is found, then the function returns string:npos. • string.replace(indx, num, subStr) replaces characters at indices indx to indx+num-1 with a copy of subStr. 3 using namespace std; 4 5 int main() { 6 7 8 9 10 11 count = 0; 218H15 16 18 19 string keyword; int count; int index; 12 index = 0; 13 cin >> keyword; 17 14 /* Your code goes here */ cout << "Number of violations: " << count << endl; cout << "Remaining string: " << keyword << endl; return 0; D

Computer Programming Java  Write a method named FirstHalf that receives a String parameter named word and then returns the first half of the string. You are guaranteed as a precondition that word has an even length greater than 1.

Implement a “To Do” list. Tasks have a priority between 1 and 9, and a description (which you can come up with on your own, say, “wash dishes”). The program is going to prompt the user to enter the tasks by running the method add_priority_description, the program adds a new task and prints the current list with priority 1 tasks on the top, and priority 9 tasks at the bottom. The program will continue to ask the user if they want to add another tasks, and repeat the add_priority_description method, or enters Q to run the quit method to quit the program. Sample output (not limited to) 1. Study for the final 1. Take the final 2. Watch Justice League with friends 3. Play ball 9. Wash Dishes 9. Clean room. There is a possibility of two tasks having the same priority. If so, the last task that was entered gets to be printed first. Use HEAP in your solution.

!Java on Eclpise

A person has a name (just a first name for simplicity)/and friends. Store the string, separated by spaces. Provide a constructor that constructs a person with a given name and no friends. Provide methods