Change the java code below to handle interrupted exceptions, and also to input the integer to multiply by sleeptime. public class SleepUtilities { /** * Nap between zero and NAP_TIME seconds. */ public static void nap() { nap(NAP_TIME); } /** * Nap between zero and duration seconds. */ public static void nap(int duration) { int sleeptime = (int) (NAP_TIME * Math.random() ); try { Thread.sleep(sleeptime*1000); } catch (InterruptedException e) {} } private static final int NAP_TIME = 5;

Code 16-1 /** This class has a recursive method. */ public class EndlessRecursion { public static void message() { System.out.println("This is a recursive method."); message(); } } Code 16.2 /** This class has a recursive method message, which displays a message n times. */ public class Recursive { public static void messge (int n) { if (n>0) { System.out.println (" This is a recursive method."); message(n-1); } } } Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println("Method call -- " + "calculating " + "Factorial of: " + n); Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return...

This is a debugging question - 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. Code - // This class determines the logarithm of a number public class DebugTwelve1 { public static void main(String[] args) throws ArithmeticException { double num = -8.8, result. try { if(num <= 0) throw(new ArithmeticException()); result = Math.log(num); System.out.println("Result is " + result); } catch() { System.out.println("Can't take logarithm for value of zero or lower"); } } }

(3) public static void test_b(int n) { if (n>0) test_b(n-2); System.out.println(n + " "); Consider the following method: What is printed by the call test_b(4)? A. 0 2 4 B. 0 2 C. 2 4 D. 4 2 E. 4 20 3 (4) What is the efficacy class of +? n 3 A: ©(1) B: O (log n) C: O (n) D: O (n log n) E: Θ n)

In Java,thank you.

Hello, can someone please help me refactor this without going past 100 lines. Here is the code. import java.util.Scanner;/*** This class contains the entire program to print out a yearly calendar.** @author Jim Williams* @author TODO add your name here when you contribute*/public class Calendar {public static void tc(char c3, int c4) {for (int pie = 0; pie < c4; pie++) {System.out.print(c3);}}public static boolean yr(int yr2) {/* TODO this really should be in a method header JavaDoc comment rather than hidden in the method.Every year that is exactly divisible by four is a leap year, except for years that are exactly divisibleby 100, but these centurial years are leap years if they are exactly divisible by 400. For example,the years 1700, 1800, and 1900 are not leap years, but the years 1600 and 2000 are.https://en.wikipedia.org/wiki/Leap_year*/boolean yri = false;if (yr2 % 4 == 0) {if (yr2 % 100 == 0) {if (yr2 % 400 == 0) {yri = true;} else {yri = false;}} else {yri = true;}}...

Using the code in the image provided: Implement a method called summation which adds two integers and returns their sum. INPUT: The first line of input contains an integer a. The Second Line of input containes and integer b. OUTPUT: Print the result which is the sum of a and b.

Java Script

Fix the code below so that there is a function that calculate the height of the triangle. package recursion; import javax.swing.*;import java.awt.*; /** * Draw a Sierpinski Triangle of a given order on a JPanel. * * */public class SierpinskiPanel extends JPanel { private static final int WIDTH = 810; private static final int HEIGHT = 830; private int order; /** * Construct a new SierpinskiPanel. */ public SierpinskiPanel(int order) { this.order = order; this.setMinimumSize(new Dimension(WIDTH, HEIGHT)); this.setMaximumSize(new Dimension(WIDTH, HEIGHT)); this.setPreferredSize(new Dimension(WIDTH, HEIGHT)); } public static double height(double size) { double h = (size * Math.sqrt(3)) / 2.0; return h; } /** * Draw an inverted triangle at the specified location on this JPanel. * * @param x the x coordinate of the upper left corner of the triangle * @param y the y...

6. What is the output of the following code? class A { public int i; void display () { System.out.println (i); } class B extends A { public int j; void display () { System.out.println (j); } class TestDriver { public static void main (String args[]) { B obj obj.i = 1; obj.j = 2; obj.display (); new B(); А. 0 В. 1 С. 2 D. Compile error E. None of the above

public class utils { * Modify the method below. The method below, myMethod, will be called from a testing function in VPL. * write one line of Java code inside the method that adds one string * to another. It will look something like this: * Assume that 1. String theInput is 2. string mystring is ceorge неllo, пу nane is * we want to update mystring so that it is неllo, пу nane is Ceorge */ public static string mymethod(string theInput){ System.out.println("This method combines two strings."); Systen.out.println("we combined two strings to make mystring); return mystring;

Java coding question below: ***************************************************** (determining Big O) write a PerformanceTest class and compare the performance of mergesort and bubblesort. Use the following "PerfomanceTest" class example. Instead of the provided simpleLoop,method, use the mentioned sorting algorithms.A) Test with an unsorted array (call the random(n) method to create a random array)B) Test with a sorted array (call the sorted(n) method to create a sorted array) Example: Consider the time complexity for the following simple loop: for(int i= 1; i <= n; i++) k = k+5;The complexity for this loop is O(n). To see how this algorithm performs, we run the perofmanceTest class to obtain the execution time for n = 1000, 10000, 100000, 100000 public class PerfomanceTest{ public static void main(String[] args) { // getTime(100000); getTime(1000000);} public static void getTime(int n) { //int[] list = random(n);...

Java Questions - (Has 2 Parts). Based on each code, which answer out of the choices "A, B, C, D, E" is correct. Each question has one correct answer. Thank you. Part 1 - Given the following code, the output is __. class Sample{ public static void main (String[] args){ try{ System.out.println(5/0);}catch(ArithmeticException e){ System.out.print("Divide by zero????");}finally{ System.out.println("5/0"); } }} A. Divide by zero????B. 5/0C. Divide by zero????5/0D. 5/0Divide by zero????E. "5/0" Part 2 - Given the following code, the output is __. try{ Integer number = new Integer("1"); System.out.println("An Integer instance.");}catch (Exception e){ System.out.println("An Exception.");} A. An Integer instance.B. An Exception.C. 1D. Error: ExceptionE. None of the options