Question

CIS25-C++ Programming; Homework #5-Page 6 of 9 Wrong option! which Point to be checked against (1 or 2)? 1 with respective to Point #1, Point #2 is in Quadrant #41 MENU - Hw #5 1. Initializing (2 Points) *2. Placement 3. Moving * 4. Flipping 5. Displaying 6. Quit select an option (use integer value only)2 Placement option The given Point objects are as follows, 1I Assuming the Point objects are as below Point Point #2 : (4/ 1, 1/1) #1: (1/2, 2/1) which Point to be checked against (1 or 2)? 3 Wrong option! which Point to be checked against (1 or 2)? 2 with respective to Point #2, point #1 is in Quadrant #21 MENU - Hw #5 *1. Initializing (2 Points) * *2. Placement 3. Moving * 4. Flipping *5. Displaying itt 6. Quit Select an option (use integer value only): 3 Moving option -- which Point to be moved (1 or 2)? 3 Wrong option! Which Point to be moved (1 or 2)? 1 * Sub MENU MovingPoint* *1. By (frX, frY) *2. By fr *3. Printing

Answer 1

ANS:-

Ex1.java

public class Ex1 {
    public static void main(String[] args) {
        FractionUtilityZhiyingL.menuHw5();
    }
}

FractionZhiyingL.java

class FractionZhiyingL {
    private int num;
    private int denom;
  
    public FractionZhiyingL() {
        num = 0;
        denom = 1;
    }

    public FractionZhiyingL(int n, int d) {
        int gcd;

        if (n != 0) {
            num = n;
            denom = d;

            gcd = getGCD();

            if (d < 0) {
                num = -n / gcd;
                denom = -d / gcd;
            }
            else {
                num = n / gcd;
                denom = d / gcd;
            }
        }
        else {
            num = 0;
            denom = 1;
        }
    }

    public FractionZhiyingL add(FractionZhiyingL f) {
        return new FractionZhiyingL(num * f.denom + denom * f.num,
            denom * f.denom);
    }

    public FractionZhiyingL subtract(FractionZhiyingL f) {
        return new FractionZhiyingL(num * f.denom - denom * f.num,
            denom * f.denom);
    }

    public FractionZhiyingL multiply(FractionZhiyingL f) {
        return new FractionZhiyingL(num * f.num, denom * f.denom);
    }

    public FractionZhiyingL divide(FractionZhiyingL f) {
        return new FractionZhiyingL(num * f.denom, denom * f.num);
    }

    public int getNum() {
        return num;
    }

    public int getDenom() {
        return denom;
    }

    public void setNum(int n) {
        int gcd;

        if (n != 0) {
            num = n;
            gcd = getGCD();
            num /= gcd;
            denom /= gcd;
        }
        else {
            num = 0;
            denom = 1;
        }

    }

    public void setDenom(int d) {
        int gcd;

        if (num != 0) {
            denom = d;

            gcd = getGCD();

            if (denom < 0) {
                num = -num / gcd;
                denom = -denom / gcd;
            }
            else {
                num = num / gcd;
                denom = denom / gcd;
            }
        }
        else {
            denom = 1;
        }
    }

    public void print() {
        System.out.println(" num: " + num + "\n denom: " + denom);
    }

    public void update(int n, int d) {
        int gcd;

        if (n != 0) {
            num = n;
            denom = d;

            gcd = getGCD();

            if (d < 0) {
                num = -n / gcd;
                denom = -d / gcd;
            }
            else {
                num = n / gcd;
                denom = d / gcd;
            }
        }
        else {
            num = 0;
            denom = 1;
        }
    }

    public int[] getCommonDigit() {
        int[] returnAry;
        int[] numDigitAry;
        int[] denomDigitAry;
        int tmp;
        int size = 0;

        tmp = num < 0 ? -num : num;
        numDigitAry = new int[10];
        do {
            numDigitAry[tmp % 10] = 1;
            tmp /= 10;
        } while (tmp != 0);

        tmp = denom;
        denomDigitAry = new int[10];
        do {
            denomDigitAry[tmp % 10] = 1;
            tmp /= 10;
        } while (tmp != 0);

        for (int i = 0; i < 10; i++) {
            if (numDigitAry[i] == 1 && denomDigitAry[i] == 1) {
                size++;
            }
        }

        returnAry = new int[size];

        if (size != 0) {
            for (int i = 0, j = 0; i < 10; i++) {
                if (numDigitAry[i] == 1 && denomDigitAry[i] == 1) {
                    returnAry[j] = i;
                    j++;
                }
            }
        }

        return returnAry;
    }

    protected final int getGCD(int a, int b) {
        if (b != 0)
            return getGCD(b, a % b);
        else
            return a;
    }

    protected final int getGCD() {
        int a = num < 0 ? -num : num;
        int b = denom < 0 ? -denom : denom;
        int tmp;

        while (b != 0) {
            tmp = a % b;
            a = b;
            b = tmp;
        }

        return a;
    }
}

note:
due to limited character i cant able to post this file FractionUtilityZhiyingL.java

R-Problems @Javadoc E., Declaration Console G. Coverage Exd [Java Application] C:\Program FilesJava\jdk1.8.0_131\bin\javaw.exe (Nov 22, 2017, 9:21:24 PM Java Programming MENU - Hw #5 * 1. Initializing * * 2. Adding *3. Subtracting* * 4. Multiplying * * 5. Dividing * 6. Printing * 7. Quit Enter your option (use integer value only): 1 INITIALIZING Option -- * 1. Initialize * *2. Update* 3. Cancel Enter your option (1, 2 or 3): 1 Initializing Left Fraction Enter the Numerator: 4 Enter the Denominator (cannot be 0): 6 Left Fraction-- num: 2 denom: 3 Initializing Right Fraction Enter the Numerator: