Can you create diagrams using Visual Paradigm or equivalent UML software to create Class and Object Diagrams showing their relationship using the program that I uploaded? Main.java ximport java. lang.*;public class Main{ I2//Add various methods to perform different arithme tic operationspublic int add(int a, int b){return a * b;7public int sub(int a, int b) {return a - b;1011public int mul(int a, int b) {return a * b;1213}public int div(int a, int b){if(b == 0){System.out.println("Dividing value can not be zero! ") ;14151617return 0;1819else{20return a/ b;2122}2324public int exp(int base, int expo){2526int pow = 1;//increase the value of i for each iteration27for (int i = 1; i <= expo; i++)//power calculation282930pow = pow * base;//returns power3132return po;}3334public double cuberoot (int a) {return Math.cbrt(a);3536373839// Declare main class to create object of the class and call its methods40public static oid main(String[] args){//Create object or the Cal classMain c = new Main();414243// Call one by one methods of the class and print the resultsSystem.out.println("Addition: "+c.add(5,10));System.out.println("Subtraction: "+c.sub(10,5));System.out.println("Multiplication : "+c.mul(5, 19));System.out.println("Division: "+c.div(10,5));System.out.println("Exponent: "+c.exp(7,6));System.out.println("Cube root: "+c.cuberoot (1090));444546474849505152

The class name is Main There are no instance variables There are few methods along with main

Answered: Can you create diagrams using Visual…

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter2: Using Data

Section: Chapter Questions

Problem 14RQ

See similar textbooks

Similar questions

JAVA Program ASAP Please modify this program and take out the main method from the program so it passes the test cases in Hypergrade. I have provided the failed test cases. import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.ArrayList;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Scanner;public class FileSorting { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (true) { System.out.println("Please enter the file name or type QUIT to exit:"); String fileName = scanner.nextLine(); if (fileName.equalsIgnoreCase("QUIT")) { break; } try { ArrayList<String> lines = readFile(fileName); if (lines.isEmpty()) { System.out.println("File " + fileName + " is empty."); } else { performSorting(lines);…
Java code: final static Scanner cin = new Scanner(System.in); public static void main(String[] args) { out.println("CPS 151 In-class assignment 3 by ___ your name here ___\n"); out.print("Enter n: "); int n = cin.nextInt(); long f = fib(n); out.println("\nfib(" + n + ") = " + f); out.println("\nCPS 151 In-class assignment 3 complete"); } // end main // standard fibonacci number computation using recursion static long fib(int n) { if (n < 0) terminate("Negative argument value not allowed, program ended"); if (n <= 1) return n; else return fib(n - 1) + fib (n - 2); } // end fib private static void indent(int level) { for(int Lcv = 1; Lcv <= level; Lcv++) out.print(" "); } // end indent private static void terminate(String errorMessage) { out.println(errorMessage); System.exit(1); } // end terminate
***********************Answer question below:****** Write code in Java: - Make sure code is recursive. - Do not change code other than where it says you can. import java.util.*; import java.lang.*; import java.io.*; class DecimalToBinary { public static String decimalToBinary(int value) { //*Code goes here* } } class DriverMain { public static void main(String args[]) { Scanner input = new Scanner(System.in); System.out.print(DecimalToBinary.decimalToBinary(input.nextInt())); } }
Write code in Java: - Make sure code is recursive. - Do not change any other part of code. import java.util.*; import java.lang.*; import java.io.*; class DecimalToBinary { public static String decimalToBinary(int value) { //*Code goes here* } } class DriverMain { public static void main(String args[]) { Scanner input = new Scanner(System.in); System.out.print(DecimalToBinary.decimalToBinary(input.nextInt())); } }
PART B: JUnit Testing Write a Java program according to the following: Create a Multiple.java class. Create the following two static methods (with return type float): SquareRoot() and CubeRoot(). SquareRoot) method should take two arguments and return the float value at the end. CubeRoot() method should take three arguments and return the float value at the end. Create a test class with the name MultipleTest.java. In this class, import the following libraries at the top of this file import org.junit. Before; import org.junit. Test; import static org.junit.Assert.assertEquals; Create an object of Calculator.java class by writing the following code in CalculatorTest.java class: private Multiple multiple; @Before public void setup() {this.multiple new Multiple():) 4. Generate the JUnit test classes for both the methods one by one. Declare and initialize the required variables to pass those to the methods. Store the expected result in one of the variables and then compare it with the…
convert or translate this Java Code to ( C PROGRAMMING)(STDIO.H) //import java util class import java.util.*; //import staement to import ThreadLocalRandom class import java.util.concurrent.ThreadLocalRandom; //main class public class Main { //main method public static void main(String[] args) { //create a scanner class object Scanner sc = new Scanner(System.in); //declaring an integer variables int userInput = 0, i; // create an array with a size of 10 elements int[] IntArray = new int[10]; //initiating random class ThreadLocalRandom NumRandom = ThreadLocalRandom.current(); //using for loop to store the value in array created by random class for(i = 0; i < 10; i++) { //assigning random values to array IntArray[i] = NumRandom.nextInt(1, 31); } //Display output…
Create a Java class RecursiveMethods.java and create the following methods inside: ALL THE METHODS NEED TO BE COMPLETED RECURSIVLY. NO LOOPS ALLOWED. - oddEvenMatchRec: the method takes an integer array as a parameter and returns a boolean. The method returns true if every odd index contains an odd integer AND every even index contains an even integer(0 is even). Otherwise it returns false. - sumNRec: The method takes an integer array A and returns the sum of all integers in the parameter array. - nDownToOne: Takes an integer n and prints out the numbers from n down to 1, each number on its own line. - inputAndPrintReverse: Inputs integers from the user until the user enters 0, then prints the integers in reverse order. For this method, you may NOT use an array or any type of array structure, in other words, you may not use any structure to store the user input.
Math 130 Java Programming Does my code pass the requirements? May I have more explanation? Does my code compile correctly? Is my code readable? Is my code well commented? How may I better organize my code? Are there whitespaces to appropriate help separate distinct parts? My code: import java.util.Scanner; public class TicketSale { public static void main(String[] args) { Scanner keyboard = new Scanner(System.in); //Prompt user to input the number of Adult tickets to purchase System.out.print("Please enter number of adults:"); //Prompt user to input the number of Adult tickets to purchase int adults = keyboard.nextInt(); //Prompt user to input the number of Children tickets to purchase System.out.print("Please enter number of children:"); //Prompt user to input the number of Children tickets to purchase int children = keyboard.nextInt(); //Calculate and display the total cost for adults and children System.out.print("Your total cost for " + adults +…
*************Question below: ------------------------ Code in Java. Code must be recursive. *DriverMain.java: import java.util.*; import java.lang.*; import java.io.*; //Program is to be evaluated by the DriverMain class and test cases. public class DriverMain { public static void main (String[] args) { Scanner s = new Scanner(System.in); int N = s.nextInt(); int A[] = new int[N]; for (int i = 0; i < N; i++) { A[i] = s.nextInt(); } ProblemSolution problemSolution = new ProblemSolution(); System.out.print(problemSolution.findMagicIndex(A, N)); } } *ProblemSolution.java: import java.util.*; import java.lang.*; import java.io.*; class ProblemSolution { public static int findMagicIndex(int[] a, int n) { //CODE GOES HERE } } *entrypoint.cz: DriverMain.java
Write code in Java: - Code must be recursive. import java.util.*; import java.lang.*; import java.io.*; class BinaryToDecimal { // *More methods can be added* public static int binaryToDecimal(String binaryString) { // *Code goes here* } } class DriverMain { public static void main(String args[]) { Scanner input = new Scanner(System.in); System.out.print(BinaryToDecimal.binaryToDecimal(input.nextLine())); } }
Rewrite the private static int recurseMax method without using Java API public class Recursion{ public static void main(String[] args){ // My tests (DO NOT MODIFY!) int[] a = {3,2,6,4,15,7,9,8,6}; p(recurseSum(a)); // Sum should be 60 p(recurseMax(a)); // Max should be 15 // End of tests! } // Recursive methods below here... public static int recurseSum(int[] a){ // TODO: This is the wrapper method. You must complete this AND implement helper method int total = recurseSum(a, a.length); return total; } private static int recurseSum(int[] a, int i){ if (i <= 0) return 0; return (recurseSum(a, i - 1) + a[i - 1]); } public static int recurseMax(int[] a){ int max = recurseMax(a, a.length); return max; } private static int recurseMax(int[] a, int i){ if(i == 1) return a[0]; return Math.max(a[i-1], recurseMax(a, i-1)); } //…
ITERATORS IN JAVA Re-write this program using Java Iterators but without changing the meaning and consequently producing the same output. class TwoDArray { public static void main(String args[]) { int i, j, k = 0, twoD[][] = new int[4][5]; for(i = 0; i < 4; i++) for (j = 0; j < 5; j++) twoD[i][j] = k++; for(i = 0; i < 4; i++) { for(j = 0; j < 5; j++) System.out.print(twoD[i][j] + " "); System.out.println(); } } }

SEE MORE QUESTIONS

Recommended textbooks for you

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

SEE MORE TEXTBOOKS