Declare and implement a class named MyString. This class will have a string data members and the following methods: A constructor: initialize s with the null string("" is the null string). setMyString(): get a string as input parameter and assign it to s. getMyString(): return s. getMode (): returns the word in s that repeats the most times. Ifs= "You are braver than you believe, and stronger than you seem, and smarter than you think. ", this method will return "You". When there are more than one such word, return the first one. Note: The string methods length(), toLowerCase(), charAt(), indexOf(), and substring() are the only built-in methods allowed

Implement a sorting algorithm of your choice in Java and What are some factors to consider when determining which sorting algorithm would be best to utilize? In your answer, specifically think of and give a real-life scenario where: A given sorting algorithm is used One algorithm outperforms the other Please and Thank you

THIS IS MEANT TO BE IN JAVA. What we've learned so far is variables, loops, and we just started learning some array today. The assignment is to get an integer from input, and output that integer squared, ending with newline. But i've been given some instructions that are kind of confusing to me. Please explain why and please show what the end result is. Here are some extra things i've been told to do with the small amount of code i've already written... Type 2 in the input box, then run the program so I can note that the answer is 4 Type 3 in the input box instead, run, and note the output is 6. Change the output statement to output a newline: System.out.println(userNumSquared);. Type 2 in the input box Change the program to use * rather than +, and try running with input 2 (output is 4) and 3 (output is now 9, not 6 as before). This is what I have so far... import java.util.Scanner; public class NumSquared {public static void main(String[] args) {Scanner scnr = new...

Write a Java program that will use while loops. The while loop will show the cards currently in the hand and ask the user to accept a card (Hit) or to stop (Stand). Within the while loop the program should print the card that was just added, all the cards in the hand, and the new value of the hand. If the value of the hand exceeds 21, the game should end (the while loop should stop). Write out the algorithm for the while loop. Turn in a printout of the algorithm, the code and a printout of a sample run. Place the algorithm and the sample run inside comment blocks in the code. "The sample runs of such a program are on the attached image."

Java utilises the terms counter controlled loop, flag while loop, instance methods, inner classes, shallow copying, and deep copying.

Write a Java program to take nth number from the user. So your code have to print the Fibonacci Number using Iteration. You have to handle all the base cases in your code

Help writing a Java program (please provide photos it works so I'm not studying a nonworking program) Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. Include appropriate tests for ‘special case’ conditions. Instead of "WritePixel" write to the screen the coordinates of the pixel that would be drawn. Your program must implement the algorithm given in class with modifications to handle the special cases. Different slope values: m = 0, m = 1, m = > 1, m = infinity (needs special test case) , m < 0 (swap x and y) The user should be able to enter coordinates and it should output the coordinates it takes to draw from the first point to the last point

Write a java recursive method called printNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12

TASK 8. Repeat TASKs 4-7. Change Summation Integers problem to Finding the minimumproblem. Make sure you properly wrote/updated all text messages, method names,and math calculations.Hint: You can use java.lang.Math.min() method.Example: System.out.printf("The min of the integers %4d and %4d and %4dis %7d\n", a, b, c, MinTest(a, b, c));Submit the source code files (.java files) and the console output screenshots

Find out about Java’s switch-case statement. What is its -purpose? How is it used? Write an example. (This is also a control flow -statement, so you will find information in similar locations as for the do-while loop.)

Please help me solve this with java .... just the HangMan HangMan instruction class : • HangMan is a game in which a player tries to guess a word based on a given hint. For example, if the given hint is "movie", then the player must guess a movie name. If the given hint is a "country", then the player must guess a country name, and so on.• The game starts by showing a message on the screen that shows the hint and all letters in the word but obscured as dashes (-). Then, the game will allow the player to guess 5 letters. If the player gives a letter that actually exists in the word, then this letter will be revealed. Afterwards, the game will ask the player to give the answer. If the given answer is correct, then the game will show a message that the player has won 5 points. Otherwise, the game will show a message that the player has lost. Below is one possible game scenario, in which the word is "iron man", and the hint is "movie". Note that the text in green color is the...

I have two questions: Is my programs code the most effective way at finding recursion or is there a much better and cleaner way? Why is the program showing 0 when I implement a number that depth is greater than 100? Shouldn't it show the number 1? Source code: package recursiveModule; public class RecursiveMethod { public static long calculateFactorial(int n, int depth) { if (depth > 100 || n <= 1) { return 1; } return n * calculateFactorial(n - 1, depth + 1); } public static void main(String[] args) { System.out.println("Factorial of 1 is " + RecursiveMethod.calculateFactorial(1, 0)); System.out.println("Factorial of 8 is " + RecursiveMethod.calculateFactorial(8, 0)); System.out.println("Factorial of 101 is " + RecursiveMethod.calculateFactorial(101, 0)); } }

Write a recursive Java method that takes a String as a parameter and returns true if the String is a palindrome. You may assume that the string only contains lower case characters (i.e. no numbers, spaces, punctuation, etc).