Implement an immutable data type Rational for rational numbers that supports addition, subtraction, multiplication, and division. public class Rational: Rational(int numerator. int denominator) Rational plus(Rational b) sum of this number and b Rational minus(Rational b) difference of this number and b Rational times(Rational b) product of this number and b Rational divides(Rational b) quotient of this number and b boolean equals(Rational that) is this number equal to that ? String toString() string representation You do not have to worry about testing for overflow, but use as instance variables two long values that represent the numerator and denominator to limit the possibility of overflow. Use Euclid’s algorithm to ensure that the numerator and denominator never have any common factors. Include a test client that exercises all of your methods.

Implement an immutable data type Rational for rational numbers that supports addition, subtraction, multiplication, and division. public class Rational: Rational(int numerator. int denominator) Rational plus(Rational b) sum of this number and b Rational minus(Rational b) difference of this number and b Rational times(Rational b) product of this number and b Rational divides(Rational b) quotient of this number and b boolean equals(Rational that) is this number equal to that ? String toString() string representation You do not have to worry about testing for overflow, but use as instance variables two long values that represent the numerator and denominator to limit the possibility of overflow. Use Euclid’s algorithm to ensure that the numerator and denominator never have any common factors. Include a test client that exercises all of your methods.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 20PE

See similar textbooks

Similar questions

Implement a new class that implements Comparatorof GregorianCalendar class to be able sort the calendar in increasingorder based on day, month, and year, in that order. Write a method to displaythe GregorianCalendar instance in “dd-MMM-yyyy” format usingSimpleDateFormatclass. Write a test program with 10 GregorianCalendarinstances and display the results after the sort.
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
in java Re-implement the Rational class : class Rational {private int numerator;private int denominator;public Rational(int num, int den) {numerator = num;denominator = den;}public Rational add(Rational o) {int NumResult = numerator * o.denominator + denominator * o.numerator;int DenResult = denominator * o.denominator;return simplify(NumResult, DenResult);}public Rational sub(Rational o) {int NumResult = numerator * o.denominator - denominator * o.numerator;int DenResult = denominator * o.denominator;return simplify(NumResult, DenResult);}public Rational mul(Rational o) {int NumResult = numerator * o.numerator;int DenResult = denominator * o.denominator;return simplify(NumResult, DenResult);}public Rational div(Rational o) {int NumResult = numerator * o.denominator;int DenResult = denominator * o.numerator;return simplify(NumResult, DenResult);}private int gcd(int a, int b) {if (b == 0)return a;return gcd(b, a % b);}private Rational simplify(int num, int den) {int gcdValue =…
Consider the following class PrimeNumbers, which has three methods. The first, computePrimes() takes one integer input and calculates that many prime numbers. Iterator() returns an Iterator object that will iterate through the primes, and toString() returns a string representation. public class PrimeNumbers implements Iterable<Integer> { private List<Integer> primes = new ArrayList<Integer>(); public void computePrimes (int n) { int count = 1; // count of primes int number = 2; // number tested for primeness boolean isPrime; // is this number a prime while (count <= n) { isPrime = true; for (int divisor = 2; divisor <= number / 2; divisor++) { if (number % divisor == 0) { isPrime = false; break; // for loop } } if (isPrime && (number % 10 != 9)) // FAULT { primes.add (number); count++; } number++; } } @Override public Iterator<Integer> iterator() { return primes.iterator(); } 2 @Override public String toString() { return primes.toString();…
1 IN JAVA ----- Write a method of public class called "isInputOneValid" that verifies if a string parameter called "inputOne" is included inside an array called "tableOne". Return as a boolean (if valid, return true, if not, false)
Implement the Solver class. In doing so, you are allowed to define other classes to help you (as well as use “built-in” Java classes or the book’s classes). The point of the solver class is the solve method which takes a board/puzzle configuration represented as a 2D array of booleans and returns a char array containing a minimal sequence of moves that will lead to the solved board (all the cells around the edges being filled). The board configuration is passed in as a 5-by-5 boolean array of Booleans with exactly 16 true cells (filled) and 9 false cells (empty). The solve method then returns an array of characters representing a minimal sequence of moves that solves the puzzle. In other words, if the characters from the returned array are used in order as input to the move method on the Board object representing the initial configuration, the resulting board configuration represents the solved board. Furthermore, the solution must be minimal in the sense that there are no solutions…
Implement the Solver class. In doing so, you are allowed to define other classes to help you (as well as use “built-in” Java classes or the book’s classes). The point of the solver class is the solve method which takes a board/puzzle configuration represented as a 2D array of booleans and returns a char array containing a minimal sequence of moves that will lead to the solved board (all the cells around the edges being filled). The board configuration is passed in as a 5-by-5 boolean array of Booleans with exactly 16 true cells (filled) and 9 false cells (empty). The solve method then returns an array of characters representing a minimal sequence of moves that solves the puzzle. In other words, if the characters from the returned array are used in order as input to the move method on the Board object representing the initial configuration, the resulting board configuration represents the solved board. Furthermore, the solution must be minimal in the sense that there are no solutions…
Implement the Solver class. In doing so, you are allowed to define other classes to help you (as well as use “built-in” Java classes or the book’s classes). The point of the solver class is the solve method which takes a board/puzzle configuration represented as a 2D array of booleans and returns a char array containing a minimal sequence of moves that will lead to the solved board (all the cells around the edges being filled). The board configuration is passed in as a 5-by-5 boolean array of Booleans with exactly 16 true cells (filled) and 9 false cells (empty). The solve method then returns an array of characters representing a minimal sequence of moves that solves the puzzle. In other words, if the characters from the returned array are used in order as input to the move method on the Board object representing the initial configuration, the resulting board configuration represents the solved board. Furthermore, the solution must be minimal in the sense that there are no solutions…
Call your class BigFraction.java and implement it according to this specification. You will note that BigFraction is composed of BigInteger numerator and BigInteger denominator. Like BigInteger and BigDecimal, BigFraction is immutable. Also, take care to simplify all fractions during construction using the BigInteger gcd method and dividing both numerator and denominator by their greatest common divisor, noting that BigInteger has its own given gcd method. In our specification, the denominator is always positive; only the numerator can be either positive or negative. For a refresher on fraction arithmetic, see here. Field Detail ONE public static final BigFraction ONE ZERO public static final BigFraction ZERO Constructor Detail BigFraction public BigFraction(java.math.BigInteger numerator, java.math.BigInteger denominator) Given a BigInteger numerator and denominator, simplify the fraction by dividing both numerator and denominator by their greatest common…
public class Soru32{ // Returns length of LCS for X[0..m-1], Y[0..n-1] static void lcs(String X, String Y, int m, int n) { int[][] L = new int[m+1][n+1]; // Following steps build L[m+1][n+1] in bottom up fashion. Note // that L[i][j] contains length of LCS of X[0..i-1] and Y[0..j-1] for (int i=0; i<=m; i++) { for (int j=0; j<=n; j++) { if (i == 0 || j == 0) L[i][j] = 0; else if (X.charAt(i-1) == Y.charAt(j-1)) L[i][j] = L[i-1][j-1] + 1; else L[i][j] = Math.max(L[i-1][j], L[i][j-1]); } } // Following code is used to print LCS int index = L[m][n]; int temp = index; // Create a character array to store the lcs string char[] lcs = new char[index+1]; lcs[index] = '\u0000'; // Set the terminating character // Start from the right-most-bottom-most…
public class Soru32{ // Returns length of LCS for X[0..m-1], Y[0..n-1] static void lcs(String X, String Y, int m, int n) { int[][] L = new int[m+1][n+1]; // Following steps build L[m+1][n+1] in bottom up fashion. Note // that L[i][j] contains length of LCS of X[0..i-1] and Y[0..j-1] for (int i=0; i<=m; i++) { for (int j=0; j<=n; j++) { if (i == 0 || j == 0) L[i][j] = 0; else if (X.charAt(i-1) == Y.charAt(j-1)) L[i][j] = L[i-1][j-1] + 1; else L[i][j] = Math.max(L[i-1][j], L[i][j-1]); } } // Following code is used to print LCS int index = L[m][n]; int temp = index; // Create a character array to store the lcs string char[] lcs = new char[index+1]; lcs[index] = '\u0000'; // Set the terminating character // Start from the right-most-bottom-most…
Suppose that we have created a class called Car by which we have created the objects below: Car herCar = new Car();Car hisCar = new Car(); Car myCar = hisCar;hisCar = null;myCar = herCar;herCar = hisCar; You may find it easier to solve this problem if you use memory model.