In Java: The program extends the representation for rational numbers Add a test class TestSimplifiedRational Define the simplified rationals r1..r4 and initialize them with 1/2, -3/9, 10/12 and 1 Compute sum=r1+r2 and diff=r4-r3 Simplify both results Check if they are equal, using equals and comparing their numerators and denominators. What do you observe? Compare r1 with r2, r3 and r4. Print all the rational numbers and partial results.

Create a one dimension array in java for class number (i.e. COMSCI101), class description (i.e. introduction to Java), class units (i.e. 3 grade points), grade (i.e. A, A-, B+, B, B-, C+, C, C-, D, F), and grade points (i.e. 12.0 for an A). I also have to ask the user to input the class number, description, units, grade, and grade points obtained. Then I have to convert the grade to a number (i.e. A = 4.0 and so on).

JAVA Given class Triangle , complete main() to read and set the base and height of triangle1 and of triangle2, determine which triangle's area is smaller, and output that triangle's info, making use of Triangle's relevant methods. /**************************************************************** import java.util.Scanner;class TriangleArea { public static void main(String[] args) { Scanner in = new Scanner(System.in); **************************************************************************************/ finish code in Java.

Write a java method that receives a reference to an array of integers and then sorts only the non-perfect numbers. if a number is perfect then it must remain in its current location in the array. Notes: 1) You are not allowed to use the Arrays.sort() method or any other ready-made sorting method. 2) You can not define new arrays. Your sorting must be in-place. 3) A number if perfect if the some of its divisors is equal to the number itself. For example the number 6 is perfect because the sum of its divisors is 1+2+3 = 6 while 8 is not perfect because the sum of its divisors is 1+2+4 = 7 which is not equal to 8.

Write the following programs in Java: In the Converter class write the static method, bin2decimal(String bin). The parameter for this method is an unsigned (nonnegative) binary number represented by a string. The method returns the decimal equivalent for the binary parameter, as an integer.If the binary string is invalid (contains characters other than ‘0’ and ‘1’), the method returns -1. Convert from a binary (b) string with up to 16 digits to decimal (d) using the following formula:? = ?0 + ?1 ×ばつ 2 + ?2 ×ばつ 22 +⋯+ ?7 ×ばつ 215where b0, b1, ?2, ... ?7 are the binary digits in order of increasing significance. For example, 1101 is: 1 +たす 0×ばつかける2 +たす 1×ばつかける22 +たす 1×ばつかける23 =わ 13 in decimal. Side note: You may NOT use the decode method of the Long wrapper class instead of this formula. In the Converter class write another static method, english2encrypted(String english). The parameter for this method is a word or sentence represented by a string. The word or sentence should only contain letters (no digits,...

I need help with this code in Java

Use java and correctly indent code.

Java. Please use the template

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.

The factorial of a positive integer n —which we denote as n!—is the product of n and the factorial of n 1. The factorial of 0 is 1. Write two different recursive methods in Java that each return the factorial of n. Analyze your algorithm in Big-Oh notation and provide the appropriate analysis, ensuring that your program has a test class.

Write a Java method (do not write a class, only the method) with the following signature: Return type: void Parameters: 2D integer array Name: printDiagonal Implement the method code that will print out the values of the 2D array along the Diagonal from left to right. For example, if the array had the following values: 56 78 98 21 33 55 98 44 11 The method should print to the console: 56,33,11 The above 2D array example is only given for you to understand the problem Do not hard code the values in your solution or assume the array is the same as the given data. Your method should work for all 2D integer arrays.

Use java.

Please complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Using quicksort to sort an array of car objects by various criteria. Define a class Car as follows: class Car { public String make; public String model; public int mpg; // Miles per gallon } b) Implement a comparator called CompareCarsByDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByDescendingMPG should return a value that will cause quicksort to sort an array of cars in descending order (from largest to smallest) by mpg.