The Double.parseDouble() method requires a String argument, but it fails if the String cannot be converted to a floating-point number. Write an application in which you try accepting a double input from a user and catch a NumberFormatException if one is thrown. The catch block forces the number to 0 and displays Value entered cannot be converted to a floating-point number. Following the catch block, display the number. import java.util.*; public class TryToParseDouble { public static void main(String[] args) { // Write your code here } }

1.  Given the following code, determine its output.StringTokenizer st = new StringTokenizer(“ABC 55*975/%”, “ +-*/%” , true);while (st.hasMoreTokens( )){System.out.println(st.nextToken( ));}   2.  Write the Java statements to split the string:May I ask , , , , , , , has anyone altered the algorithm today?into tokens using the letter a as a delimeter.Print each token on a separate line. Use the String class split method, not Stringtokenizer.Show what the output is.

PrimeAA.java Write a program that will tell a user if their number is prime or not. Your code will need to run in a loop (possibly many loops) so that the user can continue to check numbers. A prime is a number that is only divisible by itself and the number 1. This means your code should loop through each value between 1 and the number entered to see if it’s a divisor. If you only check for a small handful of numbers (such as 2, 3, and 5), you will lose most of the credit for this project. Include a try/catch to catch input mismatches and include a custom exception to catch negative values. If the user enters 0, the program should end. Not only will you tell the user if their number is prime or not, you must also print the divisors to the screen (if they exist) on the same line as shown below AND give a count of how many divisors there are. See examples below. Your program should run the test case exactly as it appears below, and should work on any other case in general. Output…

JAVA PPROGRAM   Please Modify this program with further modifications as listed below: ALSO, take out and change the following in the program:  System.out.println("Program terminated."); because the test case does not need it And change this in the program: Please enter the file name or type QUIT to exit:\n so it reperats once for every test case because it repeats twice in every case as shown in the screenshot. I only need it once. I have provided the failed the test cases and the inputs as a screenshot.  The program must pass the test case when uploaded to Hypergrade.   import java.io.*;import java.util.ArrayList;import java.util.Scanner;public class SymmetricalNameMatcher {    public static void main(String[] args) {        Scanner scanner = new Scanner(System.in);        String fileName;        do {            // Prompt the user to enter a file name or 'QUIT' to exit.            System.out.print("Please enter the file name or type QUIT to exit:\n");            fileName =…

Write an application that counts by five from 5 through 500 inclusive and that starts a new line after every multiple of 50 (50,100,150 and so on).Save the file as CountByAnything.java

For a Turing machine M, (M) refers to the binary representation of M. For a Turing machine M, L(M) contains the set of all strings accepted by M. For a Turing machine M and an input x = {0,1}*, Steps(M, x) refers to the number of steps taken by M to execute on x before it halts. Here, one step of execution of M on x = one movement (left or right) of the tape head. For a Turing machine M and an input x = {0,1}*, we define the following: ReachCells(M,x) = {i : M reaches ith tape cell when M is executed on x} Informally, it contains all locations on the tape that are visited when M is ecuted on x. The leftmost location on the tape is the first tape cell, the location next to it is the second tape cell, and so on. A string w₁ is an anagram of w2 if w₁ can be obtained by rearranging the alphabets of w2. Formally, if w₁ is an n length string, wê is called an anagram of w₁ if there exists a permutation à on n elements such that π(w₁) = W2.

1 # Write a program that reads a single integer N from the user. 2 # It then prints the string: "Is N your favorite number?"

Java programming : I can’t figure question 9 out. Help would be appreciated of any input or output. Thanks!

Write a java code that does the following: Opens a file named NumberList.txt, uses a loop to write the numbers 1 through 100 to the file, and then closes the file. Opens the NumberList.txt file and reads all of the numbers from the file and displays them, and then closes the file. Opens the NumberList.txt file and reads all of the numbers from the file, calculate the sum of these numbers and displays their total. Opens a file named NumberList.txt for writing, but does not erase the contents of the file if it already exists.

Write a value returning method that accepts two integer values as arguments and returns the value that is the greater of the two. For example, if 6 and 10 are passed as arguments to the method, the method should return 10. Your program should firstly prompt the user to enter two integers, and display the value that is the greater of the two. using Java programming