AnswerNote Provided code shows several bugs, hence I implemented.pdf
•
0 likes•2 views
Answer: Note: Provided code shows several bugs, hence I implemented a separate code as per the given program specifications Program code: import java.util.Scanner; //declares fraction class class Fraction { //private data members for the class private int numerators,denominators; //default constructor public Fraction() { } //parameterised constructor for the class public Fraction(int numerators, int denominators) { //assigns numerator this.numerators = numerators; //checks the denominator if(denominators == 0) { System.out.println(\"denominator Shouldn\'t be ZERO \"); System.out.println(\"Program Exiting.....\"); System.exit(0); } this.denominators = denominators; } //parameterised constructor public Fraction(int numerators) { this.numerators = numerators; } //method TO string public String toString() { return \"\"+numerators+\" / \"+denominators; } //methods Equals() @Override public boolean equals(Object obj) { if (obj == null) { return false; } if (getClass() != obj.getClass()) { return false; } final Fraction other = (Fraction) obj; if (this.numerators != other.numerators) { return false; } if (this.denominators != other.denominators) { return false; } return true; } //method GCD declaration public int GCD(int a, int b) { //declares local variables int x = 0, GCD = 0; int max = a > b ? a : b; int min = a < b ? a : b; for(int i = 1; i <= min; i++) { x = max * i; if(x % min == 0) { GCD = x; break; } } //returns GCD return GCD; } //Method to read public static Fraction read() { Scanner sc1 = new Scanner(System.in); System.out.print(\"Enter Fraction numerators : \"); int num1 = sc1.nextInt(); System.out.print(\"Enter Fraction denominators : \"); int den1 = sc1.nextInt(); System.out.println(); Fraction f1 = new Fraction(num1,den1); return f1; } //Method definition to add() public Fraction add(Fraction other1) { int GCD = GCD(this.denominators,other.denominators); int numb1 = this.numerators * (GCD/this.denominators); int numb2 = other1.numerators *(GCD/other.denominators); int num1 = 0, den1 = 0; num1 = numb1 + numb2; den1 = GCD; return new Fraction(num1,den1); } //method definition to add() public Fraction add(int temp1) { //defines the number variable int num1 = this.denominators * temp1 + this.numerators; return new Fraction(num1,this.denominators); } //method definition to subract public Fraction subtract(Fraction other1) { int GCD = GCD(this.denominators,other.denominators); int numb1 = this.numerators *(GCD/this.denominators); int numb2 = other1.numerators *(GCD/other1.denominators); int num1 = 0, den1 = 0; num1 = numb1 - numb2; den1 = GCD; return new Fraction(num1,den1); } //Method definition to multiply public Fraction multiply(Fraction other1) { int num1 = 0, den1 = 0; num1 = this.numerators * other1.numerators; den1 = this.denominators * other1.denominators; return new Fraction(num1,den1); } //method definition to Multiply public Fraction multiply(int temp1) { int num 1= this.numerators * temp1; return new Fraction(num1,this.denomina.
Report
Share
Report
Share
Download to read offline
Recommended
PROGRAM 2 – Fraction Class Problem For this programming as.pdf
PROGRAM 2 – Fraction Class
Problem For this programming assignment, you are to implement the Fraction class design
given below (and discussed in class). You are also to develop an appropriate test driver that
thoroughly tests the class.
Fraction Class Design Implement the following class design. Make sure to use implement the
methods to have the same names as given below, with the same number and types of parameters.
public class Fraction {
private int numer;
private int denom;
// alternate constructor
public Fraction(int numer, int denom)
throws InvalidDenominatorException {
}
// copy constructor
public Fraction(Fraction otherFrac) {
}
// getters
public int getNumer() {
}
public int getDenom() {
}
// standard methods
public String toString() {
}
public boolean equals(Fraction rFrac) {
}
// fraction operators
public Fraction add(Fraction rFrac) {
}
public Fraction sub(Fraction rFrac) {
}
public Fraction mult(Fraction rFrac) {
}
public Fraction div(Fraction rFrac) {
}
public boolean isSimplestForm() {
}
public Fraction reduce() {
}
public boolean properFrac() {
}
public Fraction abs() {
}
public boolean lessThan(Fraction rFrac) {
}
public boolean greaterThan(Fraction rFrac) {
}
public double convertToDecimal() {
}
public Fraction invert() {
}
}
Note that objects of type Fraction are immutable. Also, the alternate constructor throws an
InvalidDenominatorException if passed a denominator value of 0. This exception type is not
predefined in Java, so you must define it as follow as another class in your Java project files:
public class InvalidDenominatorException extends RuntimeException { } // nothing to
implement
This creates an exception of type RuntimeException. RuntimeExceptions do not need to be
caught when thrown. However, your test driver should have the code for catching this exception
where appropriate.
For example, if your test driver excutes the following,
Fraction frac1 = new Fraction(1,2);
then there is no need to catch the possible exception, since it is clear that the denominator is not
0. However, if the value are input by the user, then there is a chance that a denominator vaue of 0
could be entered, and therefore the code for catching the possible exception is needed,
int numer, denom;
Fraction frac1;
Scanner input = new Scanner(System.in);
Boolean valid_input = false;
while (!valid_input) try {
System.out.print(“Enter numerator denominator: “);
numer = input.nextInt();
denom = input.nextInt();
frac1 = new Fraction(numer,denom);
valid_input = true;
}
catch (InvalidDenominatorException e) {
System.out.println(“Denominator of Zero found – Please reenter”);
}
catch (InputMismatchException e) {
System.out.println(“Non-digit character found – Please reenter”);
} etc.
Considerations
Makes sure the equals method returns true for any two fractions that are arithmetically equal.
Make sure that the equals, lessThan and greaterThan methods do not alter the values of the
fractions being compared. You may consider the use of private methods .
Java Programpublic class Fraction { instance variablesin.pdf
Java Program
public class Fraction {
//instance variables
int num;
int den;
//default construtcor
Fraction()
{
num=0;
den=1;
}
//parametrized constructor
Fraction(int n,int d)
{
num=n;
den=d;
}
//print fraction object
public void print()
{
System.out.println(num+\"/\"+den);
}
//return double value of fraction
public void printAsDouble()
{
try
{
double div=(double)num/(double)den;
System.out.println(div);
}
catch(ArithmeticException e)
{
System.out.println(\"infinity\");
}
catch(Exception e)
{
System.out.println(e);
}
}
//add two fractions
public Fraction add(Fraction param)
{
int tnum=(this.num *param.den)+(this.den*param.num);
int tden=this.den*param.den;
this.num=tnum;
this.den=tden;
return this;
}
//multiply two fractions
public Fraction multiply(Fraction param)
{
int tnum=(this.num *param.num);
int tden=this.den*param.den;
this.num=tnum;
this.den=tden;
return this;
}
}
public static void main(String[] args)
{
Scanner stdIn = new Scanner(System.in);
Fraction c, d, x; // Fraction objects
System.out.println(\"Enter numerator; then denominator.\");
c = new Fraction(stdIn.nextInt(), stdIn.nextInt());
c.print();
System.out.println(\"Enter numerator; then denominator.\");
d = new Fraction(stdIn.nextInt(), stdIn.nextInt());
d.print();
x = new Fraction(); // create a fraction for number 0
System.out.println(\"Sum:\");
x.add(c).add(d);
x.print();
x.printAsDouble();
x = new Fraction(1, 1); // create a fraction for number 1
System.out.println(\"Product:\");
x.multiply(c).multiply(d);
x.print();
x.printAsDouble();
System.out.println(\"Enter numerator; then denominator.\");
x = new Fraction(stdIn.nextInt(), stdIn.nextInt());
x.printAsDouble();
} //end main Modify the code so that it can handle negative numerators and negative
denominators, and provide a helping method that performs fraction reduction. Sample session
using negative numbers and reduction Enter numerator, then denominator. -5 -8 5/8 Enter
numerator, then denominator. 4 -10 2/5 Sum: 9/40 0.225 Product: 0.25 Enter numerator, then
denominator. 0 -0 indeterminate
Solution
//Fraction.java
import java.util.Scanner;
public class Fraction {
//instance variables
int num;
int den;
//default construtcor
Fraction()
{
num=0;
den=1;
}
// greatest common divisor to reduce fraction
int gcd(int n1, int n2)
{
if (n2 != 0)
return gcd(n2, n1 % n2);
else
return n1;
}
//parametrized constructor
Fraction(int n,int d)
{
num=n;
den=d;
if(d == 0)
{
System.out.println(\"indeterminate\");
System.exit(1);
}
int hcf = gcd(num,den);
num = num/hcf;
den = den/hcf;
}
//print fraction object
public void print()
{
if( (num < 0 && den > 0))
System.out.println(num+\"/\"+den);
else if((num > 0 && den < 0))
System.out.println(\"-\" + num+\"/\"+ (-1*den));
else if(num < 0 && den < 0)
System.out.println( (-1*num)+\"/\"+ (-1*den));
else
System.out.println(num+\"/\"+den);
}
//return double value of fraction
public void printAsDouble()
{
try
{
double div=(double)num/(double)den;
System.out.println(div);
}
catch(ArithmeticException e.
can someone fix the errors in this code- the name needs to be Fraction.pdf
can someone fix the errors in this code? the name needs to be FractionDemo.java
//author: Jazmine Tapia
//date: 20 February 2023
//file: FractionDemo.java
/*
Lab 13 will also be using demonstation the
the multiplication of two factors.
*/
//import statements for Scanner class
import java.util.Scanner;
// Define a public class called Fraction
public class FractionDemo
{
// Define private instance variables for the numerator and denominator
private int numerator;
private int denominator;
// Define a constructor for the Fraction class that takes a numerator and denominator as
arguments
public FractionDemo(int numerator, int denominator)
{
// Set the denominator using the setDenominator() method defined below
setDenominator(denominator);
// Set the numerator
this.numerator = numerator;
// Reduce the fraction
reduce();
// Adjust the signs of the numerator and denominator if necessary
adjustSigns();
}
// Define a getter method for the numerator
public int getNumerator()
{
return numerator;
}
// Define a setter method for the numerator
public void setNumerator(int numerator)
{
this.numerator = numerator;
}
// Define a getter method for the denominator
public int getDenominator()
{
return denominator;
}
// Define a setter method for the denominator
public void setDenominator(int denominator)
{
// Set the denominator using the setDenominator() method defined below
setDenominator(denominator);
// Reduce the fraction
reduce();
// Adjust the signs of the numerator and denominator if necessary
adjustSigns();
}
// Define a private method to set the denominator
private void setDenominator(int denominator)
{
// If the denominator is zero, throw an exception
if (denominator == 0)
{
throw new IllegalArgumentException("Denominator cannot be zero");
}
// Set the denominator
this.denominator = denominator;
}
// Define a private method to calculate the greatest common divisor of two integers
private int gcd(int a, int b)
{
if (b == 0)
{
return a;
} else {
return gcd(b, a % b);
}
}
// Define a public method to reduce the fraction
public void reduce()
{
// Calculate the greatest common divisor of the numerator and denominator
int gcd = gcd(numerator, denominator);
// Divide both the numerator and denominator by the greatest common divisor to reduce the
fraction
numerator /= gcd;
denominator /= gcd;
}
// Define a private method to adjust the signs of the numerator and denominator if necessary
private void adjustSigns()
{
// If the denominator is negative, multiply both the numerator and denominator by -1 to adjust
the signs
if (denominator < 0)
{
numerator *= -1;
denominator *= -1;
}
}
// Define a public method to add two fractions
public FractionDemo add(FractionDemo other)
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
// Get the numerator and denominator for the first fraction
System.out.print("Enter the numerator of the first fraction: ");
int num1 = input.nextInt();
System.out.print("Enter the denominator of the first fraction.
Here is the code with comments to solve the question. Please do rate.pdf
Here is the code with comments to solve the question. Please do rate the answer if it helped.
Thank you very much.
Fraction.java
class Fraction
{
private int numerator; //where store the fraction datas
private int denominator;
//data members to store the reduced form of the fraction
//For ex: 6/3 can be stored in reduced form as 2/1.
//How to calculate the reduced form? We need the GCD of the 2 numbers and divide both
numerator and denominator
// by that GCD to give the reduced form
// for ex: 12/8 the GCD for 12 and 8 is 4 . so the numerator in reduced form is 12/4=3
//and denominator of reduced form is 8/4 = 2. So the reduced form of the fracton is 3/2
//GCD stands for greatest common divisor i.e the largest integer less than or equal to the 2
numbers
//which divides the numbers such that their remainder is 0
private int reducedNumerator;
private int reducedDenominator;
public Fraction(){ //default constructure
this(0,1);
}
public Fraction(int num, int denom){ //initialize the fraction
numerator = num;
denominator = denom;
computeReducedForm();
}
private void computeReducedForm()
{
//calculate the reduced form of the fraction
int gcd=GCD(); //compute gcd
reducedNumerator=numerator /gcd;
reducedDenominator=denominator/gcd;
}
//compares the reduced forms of the 2 fractions and returns true if they are equal and false
otherwise
public boolean equals(Fraction other){
return (reducedNumerator==other.reducedNumerator &&
reducedDenominator==other.reducedDenominator); //both numerator and denominator
should match
}
public void setNumerator(int num){
numerator=num;
computeReducedForm();
}
public void setDenominator(int denom){
denominator=denom;
computeReducedForm();
}
public int getNumerator(){
return numerator;
}
public int getDenominator(){
return denominator;
}
public String toString()
{
return reducedNumerator+\"/\"+reducedDenominator;
}
private int GCD()
{
int gcd=1;
for(int i=1;i<=numerator && i<=denominator;i++)
{
if(numerator % i ==0 && denominator % i==0) //should divide both with 0 remainder
gcd=i;
}
return gcd;
}
}
FractionCounter.java
public class FractionCounter
{
private Fraction theFraction;
private int counter;
public FractionCounter(Fraction frac) {
theFraction=frac;
counter=1;
}
public Fraction getFraction()
{
return theFraction;
}
public void incrementCount()
{
counter++;
}
public int getCount()
{
return counter;
}
public boolean compareFraction(Fraction other)
{
return theFraction.equals(other);
}
public String toString()
{
return theFraction+\" has a count of \"+counter;
}
}
Driver.java
import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;
public class Driver {
public static void main(String[] args) {
Scanner scanner;
try {
scanner = new Scanner(new File(\"fractions.txt\"));
} catch (FileNotFoundException e) {
System.out.println(e.getMessage());
return;
}
String line,nums[];
int numerator,denominator;
Fraction fraction;
ArrayList countersList=new ArrayList(); //a list o.
import java.util.Scanner;public class Fraction { instan.pdf
import java.util.Scanner;
public class Fraction {
/**
* instance variable
*/
private int numerator;
/**
* instance variable
*/
private int denominator;
/**
* param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
final Fraction f1 = new Fraction();
final Fraction f2 = new Fraction(10, 15);
final Fraction f3 = new Fraction();
Fraction f4 = new Fraction();
Fraction f5;
f3.setNumerator(14);
f3.setDenominator(16);
f1.print();
f2.print();
f3.print();
// f1.get();
// f1.print();
f4.assign(12, 50);
f4.print();
f5 = Fraction.multiply(f2, f4);
f5.print();
System.out.println(\"\ f2: \");
f2.print();
f2.multiply(f4);
System.out.println(\"\ f2: \");
f2.print();
}
/**
* default constructor
* initlizing numerator with 0 and denominator with 1
*/
public Fraction() {
// System.out.println(\"In default construction\");
numerator = 0;
denominator = 1;
}
/**
* param n
* param d
*/
public Fraction(final int n, final int d) {
// System.out.println(\"In Parameter construction\");
numerator = n;
denominator = d;
}
/**
* return numerator
*/
public int getNumerator() {
return numerator;
}
/**
* param numerator
*/
public void setNumerator(final int numerator) {
this.numerator = numerator;
}
/**
* return denominator
*/
public int getDenominator() {
return denominator;
}
/**
* param denominator
*/
public void setDenominator(final int denominator) {
this.denominator = denominator;
}
/**
* print fraction
*/
public void print() {
System.out.print(numerator + \"/\" + denominator + \" \");
}
/**
*
*/
public void get() {
final Scanner kb = new Scanner(System.in);
System.out.print(\"\ Enter numerator: \");
numerator = kb.nextInt();
System.out.print(\"Enter denominator: \");
denominator = kb.nextInt();
kb.close();
}
/**
* param n
* param d
*/
public void assign(final int n, final int d) {
if (d == 0) {
throw new IllegalArgumentException(\"denominator can not be 0\");
}
if (n < 0 || d < 0) {
throw new IllegalArgumentException(\"values must be positive\");
}
numerator = n;
denominator = d;
reduce();
}
/**
* it reduce numerator and denominator by GCD of numerator and denominator
*/
private void reduce() {
int min = numerator;
int gcd;
if (numerator > denominator) {
min = denominator;
}
for (gcd = min; gcd > 1; gcd--) {
if (numerator % gcd == 0 && denominator % gcd == 0) {
break;
}
}
numerator = numerator / gcd;
denominator = denominator / gcd;
}
/**
* param f1
* param f2
* return f
*/
public static Fraction multiply(Fraction f1, Fraction f2) {
Fraction f = new Fraction();
int num;
int den;
num = f1.getNumerator() * f2.getNumerator();
den = f1.getNumerator() * f2.getDenominator();
f.assign(num, den);
f.reduce();
return f;
}
/**
* param f
*/
public void multiply(Fraction f) {
this.numerator = this.numerator * f.getNumerator();
this.denominator = this.denominator * f.getDenominator();
this.reduce();
return;
}
}
Solution
import java.util.Scanner;
public class Fraction {
/**
* instance variable
*/
private int numerator;
/**
* instance variable
*/
priv.
The following is the (incomplete) header file for the class Fracti.pdf
The following comparative income statement (in thousands of dollars) for the two recent fiscal
years was adapted from the annual report of Speedway Motorsports, Inc., owner and operator of
several major motor speedways, such as the Atlanta, Texas, and Las Vegas Motor Speedways.
Current Year Previous Year 2 Revenues: 3 Admissions 4Event-related revenue $104,312.00
$116,644.00 131,164.00 170,368.00 65,824.00 $472,000.00 $484,000.00 42,544.00 180,304.00
44,840.00 NASCAR broadcasting revenue Other operating revenue 7 Total revenue 8 Expenses
and other: 9 Direct expense of events 10 NASCAR purse and sanction fees 91,568.00
$101,640.00 117,612.00 20,328.00 220,220.00 424800.00 $459,800.00 $24,200.00 118,000.00
19,352.00 195,880.00 11 Other direct expenses 2 General and administrative 13 Total expenses
and other Income from continuing operations $47,200.00 14 Required A. Prepare a comparative
income statement for these two years in vertical form, stating each item as a percent of revenues.
Enter all amounts as positive numbers. Rounding instructions
Solution
VERTICAL ANALYSIS OF INCOME STATEMENT Particulars Current Year
Amount Current Year Percentage Previous Year Amount Previous Year Percentage
Admissions $ 1,04,312.00 22.10% $ 1,16,644.00 24.10% Event Related revenue $ 1,42,544.00
30.20% $ 1,31,164.00 27.10% NASCAR Broadcasting Revenue $ 1,80,304.00 38.20% $
1,70,368.00 35.20% Other Operating Income $ 44,840.00 9.50% $ 65,824.00 13.60%
Total Revenue $ 4,72,000.00 100.00% $ 4,84,000.00 100.00% Expenses and others
Direct expenses of events $ 91,568.00 19.40% $ 1,01,640.00 21.00% NASCAR purse and
sanction fees $ 1,18,000.00 25.00% $ 1,17,612.00 24.30% Other direct expenses $ 19,352.00
4.10% $ 20,328.00 4.20% General and adminstrative $ 1,95,880.00 41.50% $ 2,20,220.00
45.50% Total Expenses and others $ 4,24,800.00 90.00% $ 4,59,800.00 95.00% Income
from continuing operation $ 47,200.00 10.00% $ 24,200.00 5.00%.
Interfacepackage PJ1; public interface SimpleFractionInterface.pdf
Interface
package PJ1;
public interface SimpleFractionInterface
{
/** Task: Sets a fraction to a given value.
* @param num is the integer numerator
* @param den is the integer denominator
* @throw ArithmeticException if denominator is 0 */
public void setSimpleFraction(int num, int den);
/** Task: convert a fraction to double value
* @return the double floating point value of a fraction */
public double toDouble();
/** Task: Adds two fractions.
* @param secondFraction is a fraction that is the second operand of the addition
* @return a fraction which is the sum of the invoking fraction and the secondFraction */
public SimpleFractionInterface add(SimpleFractionInterface secondFraction);
/** Task: Subtracts two fractions.
* @param secondFraction a fraction that is the second operand of the subtraction
* @return a fraction which is the difference of the invoking fraction and the second operand */
public SimpleFractionInterface subtract(SimpleFractionInterface secondFraction);
/** Task: Multiplies two fractions.
* @param secondFraction a fraction that is the second operand of the multiplication
* @return a fraction which is the product of the invoking fraction and the secondFraction*/
public SimpleFractionInterface multiply(SimpleFractionInterface secondFraction);
/** Task: Divides two fractions.
* @param secondFraction a fraction that is the second operand of the division
* @return a fraction which the quotient of the invoking fraction and the secondFraction
* @throw FractionException if secondFraction is 0 */
public SimpleFractionInterface divide(SimpleFractionInterface secondFraction);
/** Task: Get\'s the fraction\'s reciprocal
* @return the reciprocal of the invoking fraction
* @throw FractionException if the new number with denominator is 0*/
public SimpleFractionInterface getReciprocal();
}
exception class
package PJ1;
public class SimpleFractionException extends RuntimeException
{
public SimpleFractionException()
{
this(\"\");
}
public SimpleFractionException(String errorMsg)
{
super(errorMsg);
}
}
class with main method
package PJ1;
public class SimpleFraction implements SimpleFractionInterface, Comparable
{
// integer numerator and denominator
private int num;
private int den;
public SimpleFraction()
{
setSimpleFraction(0,1);// default numbers
} // end of the default constructor
public SimpleFraction(int num, int den)
{
setSimpleFraction(num, den);//
} // end constructor
public void setSimpleFraction(int num, int den)
{
if (den == 0)
throw new SimpleFractionException(\"denominator cannot be 0\");
else{
this.num= num;
this.den= den;
}
reduceSimpleFractionToLowestTerms();
} // end setSimpleFraction
public double toDouble()
{
// return double floating point value
return (double) num/den;
} // end toDouble
public SimpleFractionInterface add(SimpleFractionInterface secondFraction)
{
SimpleFraction secondFraction2;
secondFraction2 = (SimpleFraction) secondFraction;
// a/b + c/d is (ad + cb)/(bd)
int newNum = num*secondFraction2.getDen() + sec.
Recommended
PROGRAM 2 – Fraction Class Problem For this programming as.pdf
PROGRAM 2 – Fraction Class
Problem For this programming assignment, you are to implement the Fraction class design
given below (and discussed in class). You are also to develop an appropriate test driver that
thoroughly tests the class.
Fraction Class Design Implement the following class design. Make sure to use implement the
methods to have the same names as given below, with the same number and types of parameters.
public class Fraction {
private int numer;
private int denom;
// alternate constructor
public Fraction(int numer, int denom)
throws InvalidDenominatorException {
}
// copy constructor
public Fraction(Fraction otherFrac) {
}
// getters
public int getNumer() {
}
public int getDenom() {
}
// standard methods
public String toString() {
}
public boolean equals(Fraction rFrac) {
}
// fraction operators
public Fraction add(Fraction rFrac) {
}
public Fraction sub(Fraction rFrac) {
}
public Fraction mult(Fraction rFrac) {
}
public Fraction div(Fraction rFrac) {
}
public boolean isSimplestForm() {
}
public Fraction reduce() {
}
public boolean properFrac() {
}
public Fraction abs() {
}
public boolean lessThan(Fraction rFrac) {
}
public boolean greaterThan(Fraction rFrac) {
}
public double convertToDecimal() {
}
public Fraction invert() {
}
}
Note that objects of type Fraction are immutable. Also, the alternate constructor throws an
InvalidDenominatorException if passed a denominator value of 0. This exception type is not
predefined in Java, so you must define it as follow as another class in your Java project files:
public class InvalidDenominatorException extends RuntimeException { } // nothing to
implement
This creates an exception of type RuntimeException. RuntimeExceptions do not need to be
caught when thrown. However, your test driver should have the code for catching this exception
where appropriate.
For example, if your test driver excutes the following,
Fraction frac1 = new Fraction(1,2);
then there is no need to catch the possible exception, since it is clear that the denominator is not
0. However, if the value are input by the user, then there is a chance that a denominator vaue of 0
could be entered, and therefore the code for catching the possible exception is needed,
int numer, denom;
Fraction frac1;
Scanner input = new Scanner(System.in);
Boolean valid_input = false;
while (!valid_input) try {
System.out.print(“Enter numerator denominator: “);
numer = input.nextInt();
denom = input.nextInt();
frac1 = new Fraction(numer,denom);
valid_input = true;
}
catch (InvalidDenominatorException e) {
System.out.println(“Denominator of Zero found – Please reenter”);
}
catch (InputMismatchException e) {
System.out.println(“Non-digit character found – Please reenter”);
} etc.
Considerations
Makes sure the equals method returns true for any two fractions that are arithmetically equal.
Make sure that the equals, lessThan and greaterThan methods do not alter the values of the
fractions being compared. You may consider the use of private methods .
Java Programpublic class Fraction { instance variablesin.pdf
Java Program
public class Fraction {
//instance variables
int num;
int den;
//default construtcor
Fraction()
{
num=0;
den=1;
}
//parametrized constructor
Fraction(int n,int d)
{
num=n;
den=d;
}
//print fraction object
public void print()
{
System.out.println(num+\"/\"+den);
}
//return double value of fraction
public void printAsDouble()
{
try
{
double div=(double)num/(double)den;
System.out.println(div);
}
catch(ArithmeticException e)
{
System.out.println(\"infinity\");
}
catch(Exception e)
{
System.out.println(e);
}
}
//add two fractions
public Fraction add(Fraction param)
{
int tnum=(this.num *param.den)+(this.den*param.num);
int tden=this.den*param.den;
this.num=tnum;
this.den=tden;
return this;
}
//multiply two fractions
public Fraction multiply(Fraction param)
{
int tnum=(this.num *param.num);
int tden=this.den*param.den;
this.num=tnum;
this.den=tden;
return this;
}
}
public static void main(String[] args)
{
Scanner stdIn = new Scanner(System.in);
Fraction c, d, x; // Fraction objects
System.out.println(\"Enter numerator; then denominator.\");
c = new Fraction(stdIn.nextInt(), stdIn.nextInt());
c.print();
System.out.println(\"Enter numerator; then denominator.\");
d = new Fraction(stdIn.nextInt(), stdIn.nextInt());
d.print();
x = new Fraction(); // create a fraction for number 0
System.out.println(\"Sum:\");
x.add(c).add(d);
x.print();
x.printAsDouble();
x = new Fraction(1, 1); // create a fraction for number 1
System.out.println(\"Product:\");
x.multiply(c).multiply(d);
x.print();
x.printAsDouble();
System.out.println(\"Enter numerator; then denominator.\");
x = new Fraction(stdIn.nextInt(), stdIn.nextInt());
x.printAsDouble();
} //end main Modify the code so that it can handle negative numerators and negative
denominators, and provide a helping method that performs fraction reduction. Sample session
using negative numbers and reduction Enter numerator, then denominator. -5 -8 5/8 Enter
numerator, then denominator. 4 -10 2/5 Sum: 9/40 0.225 Product: 0.25 Enter numerator, then
denominator. 0 -0 indeterminate
Solution
//Fraction.java
import java.util.Scanner;
public class Fraction {
//instance variables
int num;
int den;
//default construtcor
Fraction()
{
num=0;
den=1;
}
// greatest common divisor to reduce fraction
int gcd(int n1, int n2)
{
if (n2 != 0)
return gcd(n2, n1 % n2);
else
return n1;
}
//parametrized constructor
Fraction(int n,int d)
{
num=n;
den=d;
if(d == 0)
{
System.out.println(\"indeterminate\");
System.exit(1);
}
int hcf = gcd(num,den);
num = num/hcf;
den = den/hcf;
}
//print fraction object
public void print()
{
if( (num < 0 && den > 0))
System.out.println(num+\"/\"+den);
else if((num > 0 && den < 0))
System.out.println(\"-\" + num+\"/\"+ (-1*den));
else if(num < 0 && den < 0)
System.out.println( (-1*num)+\"/\"+ (-1*den));
else
System.out.println(num+\"/\"+den);
}
//return double value of fraction
public void printAsDouble()
{
try
{
double div=(double)num/(double)den;
System.out.println(div);
}
catch(ArithmeticException e.
can someone fix the errors in this code- the name needs to be Fraction.pdf
can someone fix the errors in this code? the name needs to be FractionDemo.java
//author: Jazmine Tapia
//date: 20 February 2023
//file: FractionDemo.java
/*
Lab 13 will also be using demonstation the
the multiplication of two factors.
*/
//import statements for Scanner class
import java.util.Scanner;
// Define a public class called Fraction
public class FractionDemo
{
// Define private instance variables for the numerator and denominator
private int numerator;
private int denominator;
// Define a constructor for the Fraction class that takes a numerator and denominator as
arguments
public FractionDemo(int numerator, int denominator)
{
// Set the denominator using the setDenominator() method defined below
setDenominator(denominator);
// Set the numerator
this.numerator = numerator;
// Reduce the fraction
reduce();
// Adjust the signs of the numerator and denominator if necessary
adjustSigns();
}
// Define a getter method for the numerator
public int getNumerator()
{
return numerator;
}
// Define a setter method for the numerator
public void setNumerator(int numerator)
{
this.numerator = numerator;
}
// Define a getter method for the denominator
public int getDenominator()
{
return denominator;
}
// Define a setter method for the denominator
public void setDenominator(int denominator)
{
// Set the denominator using the setDenominator() method defined below
setDenominator(denominator);
// Reduce the fraction
reduce();
// Adjust the signs of the numerator and denominator if necessary
adjustSigns();
}
// Define a private method to set the denominator
private void setDenominator(int denominator)
{
// If the denominator is zero, throw an exception
if (denominator == 0)
{
throw new IllegalArgumentException("Denominator cannot be zero");
}
// Set the denominator
this.denominator = denominator;
}
// Define a private method to calculate the greatest common divisor of two integers
private int gcd(int a, int b)
{
if (b == 0)
{
return a;
} else {
return gcd(b, a % b);
}
}
// Define a public method to reduce the fraction
public void reduce()
{
// Calculate the greatest common divisor of the numerator and denominator
int gcd = gcd(numerator, denominator);
// Divide both the numerator and denominator by the greatest common divisor to reduce the
fraction
numerator /= gcd;
denominator /= gcd;
}
// Define a private method to adjust the signs of the numerator and denominator if necessary
private void adjustSigns()
{
// If the denominator is negative, multiply both the numerator and denominator by -1 to adjust
the signs
if (denominator < 0)
{
numerator *= -1;
denominator *= -1;
}
}
// Define a public method to add two fractions
public FractionDemo add(FractionDemo other)
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
// Get the numerator and denominator for the first fraction
System.out.print("Enter the numerator of the first fraction: ");
int num1 = input.nextInt();
System.out.print("Enter the denominator of the first fraction.
Here is the code with comments to solve the question. Please do rate.pdf
Here is the code with comments to solve the question. Please do rate the answer if it helped.
Thank you very much.
Fraction.java
class Fraction
{
private int numerator; //where store the fraction datas
private int denominator;
//data members to store the reduced form of the fraction
//For ex: 6/3 can be stored in reduced form as 2/1.
//How to calculate the reduced form? We need the GCD of the 2 numbers and divide both
numerator and denominator
// by that GCD to give the reduced form
// for ex: 12/8 the GCD for 12 and 8 is 4 . so the numerator in reduced form is 12/4=3
//and denominator of reduced form is 8/4 = 2. So the reduced form of the fracton is 3/2
//GCD stands for greatest common divisor i.e the largest integer less than or equal to the 2
numbers
//which divides the numbers such that their remainder is 0
private int reducedNumerator;
private int reducedDenominator;
public Fraction(){ //default constructure
this(0,1);
}
public Fraction(int num, int denom){ //initialize the fraction
numerator = num;
denominator = denom;
computeReducedForm();
}
private void computeReducedForm()
{
//calculate the reduced form of the fraction
int gcd=GCD(); //compute gcd
reducedNumerator=numerator /gcd;
reducedDenominator=denominator/gcd;
}
//compares the reduced forms of the 2 fractions and returns true if they are equal and false
otherwise
public boolean equals(Fraction other){
return (reducedNumerator==other.reducedNumerator &&
reducedDenominator==other.reducedDenominator); //both numerator and denominator
should match
}
public void setNumerator(int num){
numerator=num;
computeReducedForm();
}
public void setDenominator(int denom){
denominator=denom;
computeReducedForm();
}
public int getNumerator(){
return numerator;
}
public int getDenominator(){
return denominator;
}
public String toString()
{
return reducedNumerator+\"/\"+reducedDenominator;
}
private int GCD()
{
int gcd=1;
for(int i=1;i<=numerator && i<=denominator;i++)
{
if(numerator % i ==0 && denominator % i==0) //should divide both with 0 remainder
gcd=i;
}
return gcd;
}
}
FractionCounter.java
public class FractionCounter
{
private Fraction theFraction;
private int counter;
public FractionCounter(Fraction frac) {
theFraction=frac;
counter=1;
}
public Fraction getFraction()
{
return theFraction;
}
public void incrementCount()
{
counter++;
}
public int getCount()
{
return counter;
}
public boolean compareFraction(Fraction other)
{
return theFraction.equals(other);
}
public String toString()
{
return theFraction+\" has a count of \"+counter;
}
}
Driver.java
import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;
public class Driver {
public static void main(String[] args) {
Scanner scanner;
try {
scanner = new Scanner(new File(\"fractions.txt\"));
} catch (FileNotFoundException e) {
System.out.println(e.getMessage());
return;
}
String line,nums[];
int numerator,denominator;
Fraction fraction;
ArrayList countersList=new ArrayList(); //a list o.
import java.util.Scanner;public class Fraction { instan.pdf
import java.util.Scanner;
public class Fraction {
/**
* instance variable
*/
private int numerator;
/**
* instance variable
*/
private int denominator;
/**
* param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
final Fraction f1 = new Fraction();
final Fraction f2 = new Fraction(10, 15);
final Fraction f3 = new Fraction();
Fraction f4 = new Fraction();
Fraction f5;
f3.setNumerator(14);
f3.setDenominator(16);
f1.print();
f2.print();
f3.print();
// f1.get();
// f1.print();
f4.assign(12, 50);
f4.print();
f5 = Fraction.multiply(f2, f4);
f5.print();
System.out.println(\"\ f2: \");
f2.print();
f2.multiply(f4);
System.out.println(\"\ f2: \");
f2.print();
}
/**
* default constructor
* initlizing numerator with 0 and denominator with 1
*/
public Fraction() {
// System.out.println(\"In default construction\");
numerator = 0;
denominator = 1;
}
/**
* param n
* param d
*/
public Fraction(final int n, final int d) {
// System.out.println(\"In Parameter construction\");
numerator = n;
denominator = d;
}
/**
* return numerator
*/
public int getNumerator() {
return numerator;
}
/**
* param numerator
*/
public void setNumerator(final int numerator) {
this.numerator = numerator;
}
/**
* return denominator
*/
public int getDenominator() {
return denominator;
}
/**
* param denominator
*/
public void setDenominator(final int denominator) {
this.denominator = denominator;
}
/**
* print fraction
*/
public void print() {
System.out.print(numerator + \"/\" + denominator + \" \");
}
/**
*
*/
public void get() {
final Scanner kb = new Scanner(System.in);
System.out.print(\"\ Enter numerator: \");
numerator = kb.nextInt();
System.out.print(\"Enter denominator: \");
denominator = kb.nextInt();
kb.close();
}
/**
* param n
* param d
*/
public void assign(final int n, final int d) {
if (d == 0) {
throw new IllegalArgumentException(\"denominator can not be 0\");
}
if (n < 0 || d < 0) {
throw new IllegalArgumentException(\"values must be positive\");
}
numerator = n;
denominator = d;
reduce();
}
/**
* it reduce numerator and denominator by GCD of numerator and denominator
*/
private void reduce() {
int min = numerator;
int gcd;
if (numerator > denominator) {
min = denominator;
}
for (gcd = min; gcd > 1; gcd--) {
if (numerator % gcd == 0 && denominator % gcd == 0) {
break;
}
}
numerator = numerator / gcd;
denominator = denominator / gcd;
}
/**
* param f1
* param f2
* return f
*/
public static Fraction multiply(Fraction f1, Fraction f2) {
Fraction f = new Fraction();
int num;
int den;
num = f1.getNumerator() * f2.getNumerator();
den = f1.getNumerator() * f2.getDenominator();
f.assign(num, den);
f.reduce();
return f;
}
/**
* param f
*/
public void multiply(Fraction f) {
this.numerator = this.numerator * f.getNumerator();
this.denominator = this.denominator * f.getDenominator();
this.reduce();
return;
}
}
Solution
import java.util.Scanner;
public class Fraction {
/**
* instance variable
*/
private int numerator;
/**
* instance variable
*/
priv.
The following is the (incomplete) header file for the class Fracti.pdf
The following comparative income statement (in thousands of dollars) for the two recent fiscal
years was adapted from the annual report of Speedway Motorsports, Inc., owner and operator of
several major motor speedways, such as the Atlanta, Texas, and Las Vegas Motor Speedways.
Current Year Previous Year 2 Revenues: 3 Admissions 4Event-related revenue $104,312.00
$116,644.00 131,164.00 170,368.00 65,824.00 $472,000.00 $484,000.00 42,544.00 180,304.00
44,840.00 NASCAR broadcasting revenue Other operating revenue 7 Total revenue 8 Expenses
and other: 9 Direct expense of events 10 NASCAR purse and sanction fees 91,568.00
$101,640.00 117,612.00 20,328.00 220,220.00 424800.00 $459,800.00 $24,200.00 118,000.00
19,352.00 195,880.00 11 Other direct expenses 2 General and administrative 13 Total expenses
and other Income from continuing operations $47,200.00 14 Required A. Prepare a comparative
income statement for these two years in vertical form, stating each item as a percent of revenues.
Enter all amounts as positive numbers. Rounding instructions
Solution
VERTICAL ANALYSIS OF INCOME STATEMENT Particulars Current Year
Amount Current Year Percentage Previous Year Amount Previous Year Percentage
Admissions $ 1,04,312.00 22.10% $ 1,16,644.00 24.10% Event Related revenue $ 1,42,544.00
30.20% $ 1,31,164.00 27.10% NASCAR Broadcasting Revenue $ 1,80,304.00 38.20% $
1,70,368.00 35.20% Other Operating Income $ 44,840.00 9.50% $ 65,824.00 13.60%
Total Revenue $ 4,72,000.00 100.00% $ 4,84,000.00 100.00% Expenses and others
Direct expenses of events $ 91,568.00 19.40% $ 1,01,640.00 21.00% NASCAR purse and
sanction fees $ 1,18,000.00 25.00% $ 1,17,612.00 24.30% Other direct expenses $ 19,352.00
4.10% $ 20,328.00 4.20% General and adminstrative $ 1,95,880.00 41.50% $ 2,20,220.00
45.50% Total Expenses and others $ 4,24,800.00 90.00% $ 4,59,800.00 95.00% Income
from continuing operation $ 47,200.00 10.00% $ 24,200.00 5.00%.
Interfacepackage PJ1; public interface SimpleFractionInterface.pdf
Interface
package PJ1;
public interface SimpleFractionInterface
{
/** Task: Sets a fraction to a given value.
* @param num is the integer numerator
* @param den is the integer denominator
* @throw ArithmeticException if denominator is 0 */
public void setSimpleFraction(int num, int den);
/** Task: convert a fraction to double value
* @return the double floating point value of a fraction */
public double toDouble();
/** Task: Adds two fractions.
* @param secondFraction is a fraction that is the second operand of the addition
* @return a fraction which is the sum of the invoking fraction and the secondFraction */
public SimpleFractionInterface add(SimpleFractionInterface secondFraction);
/** Task: Subtracts two fractions.
* @param secondFraction a fraction that is the second operand of the subtraction
* @return a fraction which is the difference of the invoking fraction and the second operand */
public SimpleFractionInterface subtract(SimpleFractionInterface secondFraction);
/** Task: Multiplies two fractions.
* @param secondFraction a fraction that is the second operand of the multiplication
* @return a fraction which is the product of the invoking fraction and the secondFraction*/
public SimpleFractionInterface multiply(SimpleFractionInterface secondFraction);
/** Task: Divides two fractions.
* @param secondFraction a fraction that is the second operand of the division
* @return a fraction which the quotient of the invoking fraction and the secondFraction
* @throw FractionException if secondFraction is 0 */
public SimpleFractionInterface divide(SimpleFractionInterface secondFraction);
/** Task: Get\'s the fraction\'s reciprocal
* @return the reciprocal of the invoking fraction
* @throw FractionException if the new number with denominator is 0*/
public SimpleFractionInterface getReciprocal();
}
exception class
package PJ1;
public class SimpleFractionException extends RuntimeException
{
public SimpleFractionException()
{
this(\"\");
}
public SimpleFractionException(String errorMsg)
{
super(errorMsg);
}
}
class with main method
package PJ1;
public class SimpleFraction implements SimpleFractionInterface, Comparable
{
// integer numerator and denominator
private int num;
private int den;
public SimpleFraction()
{
setSimpleFraction(0,1);// default numbers
} // end of the default constructor
public SimpleFraction(int num, int den)
{
setSimpleFraction(num, den);//
} // end constructor
public void setSimpleFraction(int num, int den)
{
if (den == 0)
throw new SimpleFractionException(\"denominator cannot be 0\");
else{
this.num= num;
this.den= den;
}
reduceSimpleFractionToLowestTerms();
} // end setSimpleFraction
public double toDouble()
{
// return double floating point value
return (double) num/den;
} // end toDouble
public SimpleFractionInterface add(SimpleFractionInterface secondFraction)
{
SimpleFraction secondFraction2;
secondFraction2 = (SimpleFraction) secondFraction;
// a/b + c/d is (ad + cb)/(bd)
int newNum = num*secondFraction2.getDen() + sec.
Help in JAVAThis program should input numerator and denominator f.pdf
Help in JAVA:
This program should input numerator and denominator from a file, create a Fraction object
(reducing the fraction if necessary) and then save the fraction to an ArrayList. This list will then
be sorted, and output.
Make one method to input, create, and add to the ArrayList. Another method call to sort. And the
third method to output the contents of the (sorted) ArrayList.
The input file will consist of an (unknown) quantity of ints representing numerator denominator
pairs, which may be negative or zero.
You will need to think about your constructor - you will find it easier if you follow these rules
1. If both numerator and denominator are negative make them both positive
2. if the numerator is positive but the denominator is negative switch both so that the numerator
is negative and the denominator positive
3. any other case leave as is.
what I have so far:
public static class Fraction {
private int numerator;
private int denominator;
public Fraction() {
numerator = 0;
denominator = 1;
}
public Fraction(int n, int d) {
int g = gcd(n, d);
numerator = n/g;
denominator = d/g;
}
public int getNumerator() {
return numerator;
}
public void setNumerator(int n) {
int d = denominator;
int g = gcd(n, d);
numerator = n / g;
denominator= d/g;
}
public int getDenominator() {
return denominator;
}
public void setDenominator(int d) {
int n = numerator;
int g = gcd(n, d);
denominator = d / g;
numerator= n/g;
}
public Fraction add(Fraction g) {
int a = this.numerator;
int b = this.denominator;
int c = g.numerator;
int d = g.denominator;
Fraction v = new Fraction(a * d + b * c, b * d);
return v;
}
public Fraction subtract(Fraction g) {
int a = this.numerator;
int b = this.denominator;
int c = g.numerator;
int d = g.denominator;
Fraction v = new Fraction(a * d - b * c, b * d);
return v;
}
public Fraction multiply(Fraction g) {
int a = this.numerator;
int b = this.denominator;
int c = g.numerator;
int d = g.denominator;
Fraction v = new Fraction(a * c, b * d);
return v;
}
public Fraction divide(Fraction g) {
int a = this.numerator;
int b = this.denominator;
int c = g.numerator;
int d = g.denominator;
Fraction v = new Fraction(a * d, b * c);
return v;
}
public String toString() {
return numerator + \"/\" + denominator;
}
private int gcd(int int1, int int2) {
int i = 0;
int smallest=0;
if (int2>0){
if (int1 < int2) {
smallest=int1;
}
else{
smallest= int2;
}
for (i = smallest; i > 0; i--) {
if ((int1 % i == 0) && (int2 % i == 0)) {
break;
}
}
}
return i;
}
public int input(){
File inFile = new File(\"h7.txt\");
Scanner fileInput = null;
try {
fileInput = new Scanner(inFile);
} catch (FileNotFoundException ex) {
}
fileInput.nextInt();
}
public int sort(int input){
Collections.sort();
}
public int output(){
System.out.println();
}
}
public static void main(String[] args) {
}
}
Solution
Fraction class is used to represents fractions. It is always used to reduced to lowest terms.If
fraction is negative then the numerator will always be negative and all op.
Functions
This for the students of computer science and for those who want to learn about the concepts
#ifndef RATIONAL_H if this compiler macro is not defined #def.pdf
#ifndef RATIONAL_H // if this compiler macro is not defined
#define RATIONAL_H // then define it so this file will not be processed again
#include \"stdafx.h\" // use only for Microsoft Visual Studio C++
#include
using namespace std;
class Rational
{
// Friend functions are actually declared outside the scope of the
// class but have the right to access public and private data and
// member function members that belong to the class. The friend
// function below gives the << operator for ostreams (including cout)
// the ability to output a Rational object by accessing its member data.
friend ostream &operator<< (ostream &out, Rational const &r);
public:
Rational(int num = 0, int denom = 1); // also provides default constructor
Rational add(Rational right);
Rational operator+ (Rational right); // + addition operator
Rational operator+= (Rational right); // += addition assignment operator
Rational operator- (Rational right); // + addition operator
Rational operator-= (Rational right); // += addition assignment operator
void display();
operator double() const; // convert Rational to double
private:
int numerator;
int denominator;
// helper functions are private and not accessible by the main program
int LCD(int v1, int v2);
Rational setRational(int n, int d);
};
#endif
#include \"stdafx.h\"
#include
#include \"Rational.h\"
using namespace std;
// By using the default parameter settings in Rational.h, this
// constructor also provides the default constructor Rational()
Rational::Rational(int num, int denom)
{
setRational(num, denom); // set numerator and denominator, reduce fraction, fix the sign
}
// Helper function to fix a zero denominator and fix the sign if denominator is negative
Rational Rational::setRational(int n, int d) // helper function
{
numerator = n;
denominator = d;
// if denominator == 0 then set it = 1
if (denominator == 0)
denominator = 1;
if (denominator < 0) // if denominator is neg, multiply num and denom by -1
{
numerator = -numerator; // fix sign of numerator +/-
denominator = -denominator; // denominator always +
}
int lcd = LCD(numerator, denominator);
if (denominator != 0)
{
numerator /= lcd;
denominator /= lcd;
}
return *this; // return the current object
}
// find the lowest common divisor using a recursive function
int Rational::LCD(int v1, int v2)
{
if (v2 == 0) return v1;
else return LCD(v2, v1%v2);
}
Rational Rational::add(Rational right)
{
int newNumerator;
int newDenominator;
newNumerator = numerator*right.denominator + right.numerator*denominator;
newDenominator = denominator * right.denominator;
// create a new Rational object and return it
return setRational(newNumerator, newDenominator);
}
// the operator+ method does the same thing as the add method
Rational Rational::operator+ (Rational right)
{
int newNumerator;
int newDenominator;
newNumerator = numerator*right.denominator + right.numerator*denominator;
newDenominator = denominator * right.denominator;
// create a new Rational object and return it
return .
When we test your Fraction.java we will use the given FractionTester.pdf
When we test your Fraction.java we will use the given FractionTester.java file.
Add the following methods to the given Fraction.java file
-public Fraction add( Fraction other) returns a Fraction that is the sum of the two Fractions.
-public Fraction subtract( Fraction other) returns a Fraction that is the difference between this
Fraction minus the other Fraction.
-public Fraction multiply( Fraction other) returns a Fraction that is the product of the two
Fractions.
-public Fraction divide( Fraction other) returns a Fraction that is the quotient of the two
Fractions.
-public Fraction reciprocal() returns a Fraction that is the reciprocal of this Fractions.
-private void reduce() Does not return a Fraction. It just modifies this Fraction by reducing it to
its lowest form.
Every Fraction must reduce at all times. Every new fraction constructed it must be reduced
before the constructor exits. No Fraction at any time may be stored in a form other than its
reduced form.
/* Fraction.java A class (data type) definition file
This file just defines what a Fraction is
This file is NOT a program
** data members are PRIVATE
** method members are PUBLIC
*/
public class Fraction
{
private int numer;
private int denom;
// ACCESSORS
public int getNumer()
{
return numer;
}
public int getDenom()
{
return denom;
}
public String toString()
{
return numer + \"/\" + denom;
}
// MUTATORS
public void setNumer( int n )
{
numer = n;
}
public void setDenom( int d )
{
if (d!=0)
denom=d;
else
{
// error msg OR exception OR exit etc.
}
}
// DEFAULT CONSTRUCTOR - no args passed in
public Fraction( )
{
this( 0, 1 ); // \"this\" means call a fellow constructor
}
// 1 arg CONSTRUCTOR - 1 arg passed in
// assume user wants whole number
public Fraction( int n )
{
this( n, 1 ); // \"this\" means call a fellow constructor
}
// FULL CONSTRUCTOR - an arg for each class data member
public Fraction( int n, int d )
{
setNumer(n);
setDenom(d);
// call your reduce here
}
// COPY CONSTRUCTOR - takes ref to some already initialized Fraction object
public Fraction( Fraction other )
{
this( other.numer, other.denom ); // call my full C\'Tor with other Fraction\'s data
}
private void reduce()
{
// reduces this fraction to lowest form
}
}// EOF
JavaTester file
Solution
/* Fraction.java A class (data type) definition file
This file just defines what a Fraction is
This file is NOT a program
** data members are PRIVATE
** method members are PUBLIC
*/
public class Fraction {
private int numer;
private int denom;
// ACCESSORS
public int getNumer() {
return numer;
}
public int getDenom() {
return denom;
}
public String toString() {
return numer + \"/\" + denom;
}
// MUTATORS
public void setNumer(int n) {
numer = n;
}
public void setDenom(int d) {
if (d != 0)
denom = d;
else {
// error msg OR exception OR exit etc.
}
}
// DEFAULT CONSTRUCTOR - no args passed in
public Fraction() {
this(0, 1); // \"this\" means call a fellow constructor
}
// 1 arg CONSTRUCTOR - 1 arg passed in
// assume user wants who.
Hi,I have updated your code. It is working fine now. Highllighted .pdf
Hi,
I have updated your code. It is working fine now. Highllighted all code changes below.
Shapes.java
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3));
System.out.println();
System.out.printf( \"Square perimeter, area:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2 *Math.E * 1.);
System.out.println();
System.out.printf( \" area : \" + Math.E * 1.* 1);
System.out.println();
}
public static void main( String[] args )
{
//System.out.printf( \"Radius (as integer) of bounding sphere?\ %s!\ \", getradius() );
Scanner input = new Scanner( System.in );
System.out.println(\"Enter the radius:\");
int radius = input.nextInt();
Shapes s = new Shapes(radius);
s.report();
}
}
Output:
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3));
System.out.println();
System.out.printf( \"Square perimeter, area:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2 *Math.E * 1.);
System.out.println();
System.out.printf( \" area : \" + Math.E * 1.* 1);
System.out.println();
}
public static void main( String[] args )
{
//System.out.printf( \"Radius (as integer) of bounding sphere?\ %s!\ \", getradius() );
Scanner input = new Scanner( System.in );
System.out.println(\"Enter the radius:\");
int radius = input.nextInt();
Shapes s = new Shapes(radius);
s.report();
}
}
Solution
Hi,
I have updated your code. It is working fine now. Highllighted all code changes below.
Shapes.java
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3).
write the To Dos to get the exact outputNOte A valid Fraction .pdf
write the To Do\'s to get the exact output:
NOte: A valid Fraction number has a non-negative numerator and a positive denominator.
Default constructor initializes the object to safe empty state (an object with denom equals -1).
The two-argument constructor also validates the parameters and sets the object to the safe empty
state if the parameters are not valid.
Write the definitions and prototypes of following functions in Fraction.cpp and Fraction.h
respectively (They are indicated in the files by //TODO tag):
Define isEmpty function as a member function, which returns true if the object is in safe empty
state (an object is in the safe empty state if denominator (denom) equals -1).
Define display function, which sends a Fraction number to the output stream (with the
“Numerator/denominator” format). This function just prints \"Invalid Fraction Object!\" in the
screen if the object is in the safe empty state. In case that object denominator equals 1, it just
print the numerator.
Define the operator functions for the following operators:
“+=”, “+”, “*”
The overload of the above operators should make the following code possible:
The member operator+ : Adds two Fraction numbers and returns a Fraction number as the result.
This function returns an object with the safe empty state if either of Fraction numbers (operands)
is in safe empty state. It makes following code possible:
A+B ( where A and B are Fraction objects)
The member operator+= : Adds two Fraction numbers and assigns the result to the left operand,
then returns a reference to the left operand. If either of Fraction numbers (operands) is in safe
empty state, it initializes the left operand to the safe empty state, then returns a reference to the
left operand. It makes following code possible:
A+=B ( where A and B are Fraction objects)
The member operator* : Multiplies two Fraction numbers and returns a Fraction number as the
result. This function returns an object with the safe empty state if either of Fraction numbers
(operands) is in safe empty state. It makes following code possible:
A*B ( where A and B are Fraction objects)
fraction.cpp
#include \"Fraction.h\"
using namespace std;
namespace sict{
Fraction::Fraction(){
denom =-1; // safe empty state
}
Fraction::Fraction(int n, int d) // n: numerator, d: denominator
{
if(n >= 0 && d > 0){
num = n;
denom = d;
reduce();
}
else
denom =-1; // set to safe empty state
}
int Fraction::gcd() // returns the greatest common divisor of num and
denom
{
int mn = min(); // min of num and denom
int mx = max(); // mX of num and denom
for (int x=mn ; x > 0 ; x--) // find the greatest common divisor
if( mx % x == 0 && mn % x == 0)
return x;
return 1;
}
void Fraction::reduce() // simplify the Fraction number
{
int tmp = gcd();
num /= tmp;
denom /= tmp;
}
int Fraction::max ()
{
return (num >= denom) ? num : denom;
}
int Fraction::min()
{
return (num >= denom) ? denom : num;
}
// in_lab
// TODO: write the implementation of display function HERE
// TODO: w.
Keep getting a null pointer exception for some odd reasonim creati.pdf
Keep getting a null pointer exception for some odd reason
im creating the variable and the object but it still isnt working
My code is below please help
package classes;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
import java.io.*;
import java.util.*;
import java.text.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class NewClass4
{
private class Node
{
private String text;
private int Hit;
private int Miss;
private Node next;
public Node(String text, int Hit, int Miss, Node next)
{
this.text=text;
this.Hit=Hit;
this.Miss=Miss;
this.next=next;
}
public void incrementHit()
{
this.Hit = this.Hit+1;
}
public void incrementMiss()
{
this.Miss = this.Miss+1;
}
public String getText()
{
return this.text;
}
public int getHit()
{
return this.Hit;
}
public int getMiss()
{
return this.Miss;
}
}//end of node
private class LL
{
public Node head;
public LL()
{
head=null;
}
public void insert(String text2, boolean isHit)
{
System.out.println(\"entered insert method\");
Node temp=this.head;
System.out.println(\"sent temp node to head\");
while((temp!=null) && (!temp.text.equals(text2)) )
{
temp=temp.next;
}
if(temp==null)
{
// we did not find the string
if(isHit)
{
this.head=new Node(text2,1, 0, this.head );
}
else
{
this.head=new Node(text2,0, 1, this.head );
}
}
else
{
if(isHit)
{
temp.incrementHit();
}
else
{
temp.incrementMiss();
}
}
}//end of insert
public void printList()
{
Node temp=this.head;
while(temp!=null)
{
int Hit=temp.getHit();
int Miss=temp.getMiss();
double sucRate=Hit*100/(Hit+Miss);
System.out.println(temp.getText() + \" \" + sucRate);
}
}
}// end of LL
private static LL myLL;
public NewClass4()
{
this.myLL = new LL();
}
public static void main(String[] args)
{
SimpleDateFormat sdf = new
SimpleDateFormat(\"dd/MMM/yyyy:HH:mm:ss\",Locale.ENGLISH);
String myString = null;
Pattern a = Pattern.compile(\"[0-9]{2}\\\\/?[A-Za-z]{3,4}\\\\/?[0-9]{4}[.,-:]{1}[0-9.,-
:]{1,}\\\\s+\");
Pattern d= Pattern.compile(\"\\\\s+\\\\/+[0-9.]{3}\\\\/+[A-Za-z]{1,}\\\\/+[A-Za-z.,-:%]{1,}\");
Pattern f= Pattern.compile(\"\\\\s+[0-9]{3}\\\\s+\");
String newLine;
try {
File file = new File(\"myFile.txt\");
FileReader fileReader = new FileReader(file);
BufferedReader bufferedReader = new BufferedReader(fileReader);
String line;
while ((line = bufferedReader.readLine()) != null)
{
myString = line;
System.out.println(myString);
Matcher m1 = a.matcher(myString);
Matcher m2 = d.matcher(myString);
Matcher m3 = f.matcher(myString);
if (m1.find() && m2.find()&& m3.find())
try {
Date parsedDate = sdf.parse(m1.group());
SimpleDateFormat print = new SimpleDateFormat(\"yyyy-MM-dd\'T\'HH:mm\");
int responseCode = Integer.parseInt(m3.group().trim());
System.out.println(print.format(parsedDate)+ \" \"+m2.group()+\" \"+responseCode);
newLine = print.format(parsedDate)+ \" \"+m2.group();
// decide true or false
if (responseC.
C++ AssignmentPlease read all the requirements and the overloading.pdf
C++ Assignment
Please read all the requirements and the overloading requiremets.
Here is what i have so far,
#include
using namespace std;
class ComplexNumbers
{
private:
double real;
double imaginary;
public:
void input ();
void output();
void setReal ( int );
int getReal ();
void setImaginary ( int );
int getImaginary();
ComplexNumbers();
ComplexNumbers(int);
ComplexNumbers(int, int);
friend bool operator == (ComplexNumbers , ComplexNumbers);
friend ComplexNumbers operator + (ComplexNumbers , ComplexNumbers);
friend ComplexNumbers operator - (ComplexNumbers , ComplexNumbers);
friend ComplexNumbers operator * (ComplexNumbers , ComplexNumbers);
friend ComplexNumbers operator - (ComplexNumbers);
};
void ComplexNumbers::setReal(int x)
{
real=x;
}
void ComplexNumbers::setImaginary(int y)
{
imaginary=y;
}
int ComplexNumbers::getReal()
{
return real;
}
int ComplexNumbers::getImaginary()
{
return imaginary;
}
//default constructor
ComplexNumbers::ComplexNumbers()
{
real=0;
imaginary=0;
}
//single parameterized constructor
ComplexNumbers:: ComplexNumbers(int z)
{
real=z;
}
//two parameterized constructor
ComplexNumbers::ComplexNumbers(int r,int u)
{
real = r;
imaginary= u;
}
void ComplexNumbers::input ()
{
int aReal(0),bImaginary(0);
cout<<\"enter real no\"<>aReal;
cout<<\"enter imaginary\"<>bImaginary;
real = aReal;
imaginary = bImaginary;
}
/* int real,imaginary;
cout<<\"enter real no\"<>real;
cout<<\"enter imaginary\"<>imaginary;*/
void ComplexNumbers::output()
{
cout<<\"the complex no is\"<
Solution
Your program is well-written. Apart from overloading the binary and unary operators. I have
modified your code and changed \"int\" to \"double\" in Constructors, and some methods.
FYI. Accessors are nothing but \"get\" methods in a class
Mutators are overloaded operators +,-,*. Means these operators are mutated over your
\"ComplexNumbers\" class.
The following is the modified program:
#include
using namespace std;
class ComplexNumbers
{
private:
double real;
double imaginary;
public:
void input ();
void output();
void setReal ( double );
double getReal ();
void setImaginary ( double );
double getImaginary();
ComplexNumbers();
ComplexNumbers(double);
ComplexNumbers(double,double);
bool operator == (ComplexNumbers&);
ComplexNumbers operator + (ComplexNumbers&);
ComplexNumbers operator - (ComplexNumbers&);
ComplexNumbers operator * (ComplexNumbers&);
ComplexNumbers operator - ();//unary minus
};
void ComplexNumbers::setReal(double x)
{
real=x;
}
void ComplexNumbers::setImaginary(double y)
{
imaginary=y;
}
double ComplexNumbers::getReal()
{
return real;
}
double ComplexNumbers::getImaginary()
{
return imaginary;
}
//default constructor
ComplexNumbers::ComplexNumbers()
{
real=0;
imaginary=0;
}
//single parameterized constructor
ComplexNumbers:: ComplexNumbers(double z)
{
real=z;
}
//two parameterized constructor
ComplexNumbers::ComplexNumbers(double r,double u)
{
real = r;
imaginary= u;
}
void ComplexNumbers::input ()
{
int aReal(0),bImaginary(0);
cout<<\.
C# Program. Create a Windows application that has the functionality .pdf
C# Program. Create a Windows application that has the functionality of a calculator and works
with integral values. Allow the user to select buttons representing numeric values. If the user
attempts to divide by zero, throw and handle an exception.
Solution
below is the code from the windows application in visual studio:
Form1.cs
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Windows.Forms;
namespace SimpleCalculator
{
public partial class frmCalculator : Form
{
string operand1 = string.Empty;
string operand2 = string.Empty;
string result;
char operation;
public frmCalculator()
{
InitializeComponent();
}
private void frmCalculator_Load(object sender, EventArgs e)
{
btnOne.Click += new EventHandler(btn_Click);
btnTwo.Click += new EventHandler(btn_Click);
btnThree.Click += new EventHandler(btn_Click);
btnFour.Click += new EventHandler(btn_Click);
btnFive.Click += new EventHandler(btn_Click);
btnSix.Click += new EventHandler(btn_Click);
btnSeven.Click += new EventHandler(btn_Click);
btnEight.Click += new EventHandler(btn_Click);
btnNine.Click += new EventHandler(btn_Click);
btnZero.Click += new EventHandler(btn_Click);
btnDot.Click += new EventHandler(btn_Click);
}
void btn_Click(object sender, EventArgs e)
{
try
{
Button btn = sender as Button;
switch (btn.Name)
{
case \"btnOne\":
txtInput.Text += \"1\";
break;
case \"btnTwo\":
txtInput.Text += \"2\";
break;
case \"btnThree\":
txtInput.Text += \"3\";
break;
case \"btnFour\":
txtInput.Text += \"4\";
break;
case \"btnFive\":
txtInput.Text += \"5\";
break;
case \"btnSix\":
txtInput.Text += \"6\";
break;
case \"btnSeven\":
txtInput.Text += \"7\";
break;
case \"btnEight\":
txtInput.Text += \"8\";
break;
case \"btnNine\":
txtInput.Text += \"9\";
break;
case \"btnZero\":
txtInput.Text += \"0\";
break;
case \"btnDot\":
if(!txtInput.Text.Contains(\".\"))
txtInput.Text += \".\";
break;
}
}
catch(Exception ex)
{
MessageBox.Show(\"Sorry for the inconvenience, Unexpected error occured. Details:
\" +
ex.Message);
}
}
private void txtInput_KeyPress(object sender, KeyPressEventArgs e)
{
switch (e.KeyChar)
{
case \'1\':
case \'2\':
case \'3\':
case \'4\':
case \'5\':
case \'6\':
case \'7\':
case \'8\':
case \'9\':
case \'0\':
//case \'+\':
//case \'-\':
//case \'*\':
//case \'/\':
//case \'.\':
break;
default:
e.Handled = true;
MessageBox.Show(\"Only numbers, +, -, ., *, / are allowed\");
break;
}
}
private void txtInput_TextChanged(object sender, EventArgs e)
{
}
private void btnPlus_Click(object sender, EventArgs e)
{
operand1 = txtInput.Text;
operation = \'+\';
txtInput.Text = string.Empty;
}
private void btnMinus_Click(object sender, EventArgs e)
{
operand1 = txtInput.Text;
operation = \'-\';
txtInput.Text = string.Empty;
}
private void btnMulitply_Click(object sender, EventArgs e)
{
operand1 = txtInput.Text;
operation = \'*\';
txtInput.Text = string.Empty;
}
private void btnDivide_Click.
40+ examples of user defined methods in java with explanation
40+ examples of user defined methods in java with explanation,
advantages,
terms,
exercises,
pass arrays to methods,
return array from methods,
for each loop examples,
build complex programs using your defined methods
animation included
INDEX
Simple Programs using Methods
Add two numbers
Average of three numbers
Circle area
Fahrenheit to Celsius
Check number is even or not
Check number is prime or not
Reverse of a number
Check number is palindrome or not
Count number of digits in a number
Sum of digits
Pass Array to Methods
Print all elements of an array
Sum of an array
Average of an array
Maximum element of an array
Minimum element of an array
Returning Array From Methods
Reverse array
Reverse every element of an array
Decimal to binary, octal, hex
Binary to decimal, octal, hex
Octal to binary,decimal, hex
Hexadecimal to binary, octal, decimal
operating system ubuntu,linux,MacProgram will work only if you g.pdf
//operating system ubuntu,linux,Mac
Program will work only if you give command like
sum 2 3 or
sum 4 (sub 4 3)
#include
#include
#include
#include
/*Sum function implementation*/
int sum(int number1,int number2){
return number1+number2;
}
/*sub function implementation*/
int sub(int number1,int number2){
return number1-number2;
}
/*mul function implementation*/
int mul(int number1,int number2){
return number1*number2;
}
/*divide function implementation*/
float divide(int number1,int number2){
if(number2==0){
printf(\"We can not divide by 0 \ \");
return 0.0f;
}
return (float)(number1/number2);
}
char *substring(char *string, int position, int length)
{
char *pointer;
int c;
pointer = malloc(length+1);
if (pointer == NULL)
{
printf(\"Unable to allocate memory.\ \");
exit(1);
}
for (c = 0 ; c < length ; c++)
{
*(pointer+c) = *(string+position-1);
string++;
}
*(pointer+c) = \'\\0\';
return pointer;
}
/*Main Function start*/
int main(int argc, char *argv[]){
/*Variable declarations*/
int number1,number2;
char *operator,*str1,*str2;
char line[50];
char s[2] = \" \";
int errorFlag=0;// checking if user entered more then one operands
while(1){
/*User input*/
printf(\"Please Enter the command \");
gets(line);
int len=0;
for(int i=0; line[i]!=\'\\0\'; ++i){len++;}
if(len==0){
return 1;
}
/*Spliting into Tokens*/
operator = strtok(line, \" \");
if(strcmp(operator,\"bye\")==0){
break;
}
/*String to integer --- token1*/
number1=atoi(strtok(NULL, s));
/*Removing ( and ) from String*/
str2=strtok(NULL, s);
char *content;int length=0;
for(int i=0; str2[i]!=\'\\0\'; ++i){length++;}
if(str2[0]==\'(\'){
content=substring(str2,2,length-1);
char *opr=content;
int n1=atoi(strtok(NULL, s));
int n2=atoi(strtok(NULL, s));
/*If user entered more then two operands then it will return some token otherwise it will
return NULL pointer*/
if(strtok(NULL, s)!=NULL){
printf(\"You need to enter operator operand1 operand2 \ \");
errorFlag=1;
}else{
if(strcmp(opr,\"sum\")==0){
number2=sum(n1,n2);
}else if(strcmp(opr,\"sub\")==0){
number2=sub(n1,n2);
}else if(strcmp(opr,\"mul\")==0){
number2=mul(n1,n2);
} else if(strcmp(opr,\"div\")==0){
number2=divide(n1,n2);
}
}
}else{
number2=atoi(str2);
/*If user entered more then two operands then it will return some token otherwise it will return
NULL pointer*/
if(strtok(NULL, s)!=NULL){
printf(\"You need to enter operator operand1 operand2 \ \");
errorFlag=1;
}
}
if(errorFlag!=1){
/*Checking operator by strcmp function*/
if(strcmp(operator,\"sum\")==0){
printf(\"Result %d \ \",sum(number1,number2));
}else if(strcmp(operator,\"sub\")==0){
printf(\"Result %d \ \",sub(number1,number2));
}else if(strcmp(operator,\"mul\")==0){
printf(\"Result %d \ \",mul(number1,number2));
} else if(strcmp(operator,\"div\")==0){
printf(\"Result %.2f \ \",divide(number1,number2));
}
}
}
return 0;
}
/*******************Output***********************/
gopal@gopal:~/Desktop/chegg$ gcc Calculator.c
Calculator.c: In function ‘main’:
Calculator.c:67:3: warning: implici.
fraction_math.c for Project 5 Program Design fraction.pdf
/*fraction_math.c for Project 5
* Program Design
*/
//fraction_math.c
#include
#include
//function prototypes
void reduce(int numerator, int denominator, int*reduced_numerator, int*reduced_denominator);
int find_gcd(int m, int n);
//main function
int main(void)
{
int num1, denom1, num2, denom2, result_num, result_denom;
char operatorSymbol;
printf(\"Enter two fractions separated by a +, -, * or / sign: \");
scanf(\"%d/%d %c%d/%d\", &num1, &denom1, &operatorSymbol, &num2, &denom2);
switch (operatorSymbol)
{
case \'+\':
result_num = num1 * denom2 + num2 * denom1;
result_denom = denom1 * denom2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The sum is %d/%d\ \", result_num, result_denom);
break;
case \'-\':
result_num = num1 * denom2 - num2 * denom1;
result_denom = denom1 * denom2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The difference is %d/%d\ \", result_num, result_denom);
break;
case \'*\':
result_num = num1 * num2;
result_denom = denom1 * denom2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The product is %d/%d\ \", result_num, result_denom);
break;
case \'/\':
result_num = num1 * denom2;
result_denom = denom1 * num2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The quotient is %d/%d\ \", result_num, result_denom);
break;
default:
printf(\"Unrecognized operator: %c\ \", operatorSymbol);
}
getch();
return 0;
}
/*
The function reduce takes numberator and denominator and two pointers
and reduct the fraction by gcd
*/
void reduce(int numerator, int denominator, int*reduced_numerator, int*reduced_denominator)
{
//call find_gcd
int gcd=find_gcd(numerator,denominator);
//divide the value by gcd and set value at the pointer address
*reduced_numerator=numerator/gcd;
*reduced_denominator=denominator/gcd;
}
/*
The function find_gcd that takes m and n and returns
the gcd of two numbers
*/
int find_gcd(int m, int n)
{
if(n == 0)
return m;
return find_gcd(n, m%n);
}
----------------------------------------------------------------------------------
Sample output:
Enter two fractions separated by a +, -, * or / sign: 4/9-1/9
The difference is 1/3
Solution
/*fraction_math.c for Project 5
* Program Design
*/
//fraction_math.c
#include
#include
//function prototypes
void reduce(int numerator, int denominator, int*reduced_numerator, int*reduced_denominator);
int find_gcd(int m, int n);
//main function
int main(void)
{
int num1, denom1, num2, denom2, result_num, result_denom;
char operatorSymbol;
printf(\"Enter two fractions separated by a +, -, * or / sign: \");
scanf(\"%d/%d %c%d/%d\", &num1, &denom1, &operatorSymbol, &num2, &denom2);
switch (operatorSymbol)
{
case \'+\':
result_num = num1 * denom2 + num2 * denom1;
result_denom = denom1 * denom2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The sum is %d/%d\ \", re.
ANSimport java.util.Scanner; class Bina_node { Bina_node .pdf
ANS:
import java.util.Scanner;
class Bina_node
{
Bina_node l_1, r_1;
int dt;//here declare variables
public Bina_node()//constructor
{
l_1 = null;
r_1 = null;
dt = 0;
}
public Bina_node(int n)//here parameter constractor
{
l_1 = null;
r_1 = null;
dt = n;
}
public void nin_left(Bina_node n)//copy constractor
{
l_1 = n;
}
public void nin_right(Bina_node n)
{
r_1 = n;
}
public Bina_node get_lstf()
{
return l_1;
}
public Bina_node get_go()
{
return r_1;
}
public void set_data(int d)
{
dt = d;
}
public int get_data()
{
return dt;
}
}
class Bina_tree//class banary tree
{
private Bina_node rf;
public Bina_tree()
{
rf = null;
}
public boolean isEmpty()//here empty or not
{
return rf == null;
}
public void tee_insert(int dt)
{
rf = tee_insert(rf, dt);
}
private Bina_node tee_insert(Bina_node node, int dt)
{
if (node == null)
node = new Bina_node(dt);
else
{
if (node.get_go() == null)
node.r_1 = tee_insert(node.r_1, dt);
else
node.l_1 = tee_insert(node.l_1, dt);
}
return node;
}
public int cou_Node()
{
return cou_Node(rf);
}
private int cou_Node(Bina_node r)
{
if (r == null)
return 0;
else
{
int l = 1;
l += cou_Node(r.get_lstf());
l += cou_Node(r.get_go());
return l;
}
}
public boolean bin_serc(int tree_val)//function called
{
return bin_serc(rf, tree_val);
}
private boolean bin_serc(Bina_node r, int tree_val)
{
if (r.get_data() == tree_val)
return true;
if (r.get_lstf() != null)
if (bin_serc(r.get_lstf(), tree_val))
return true;
if (r.get_go() != null)
if (bin_serc(r.get_go(), tree_val))
return true;
return false;
}
public void in_order()
{
in_order(rf);
}
private void in_order(Bina_node r)
{
if (r != null)
{
in_order(r.get_lstf());
System.out.print(r.get_data() +\" \");
in_order(r.get_go());
}
}
public void pre_order()
{
pre_order(rf);
}
private void pre_order(Bina_node r)
{
if (r != null)
{
System.out.print(r.get_data() +\" \");
pre_order(r.get_lstf());
pre_order(r.get_go());
}
}
public void post_order()
{
post_order(rf);
}
private void post_order(Bina_node r)
{
if (r != null)
{
post_order(r.get_lstf());
post_order(r.get_go());
System.out.print(r.get_data() +\" \");
}
}
}
public class Bina_Tree//binary tree class
{
public static void main(String[] args)//here main methode
{
Scanner sc = new Scanner(System.in);//here scanner
Bina_tree bin_c = new Bina_tree();
System.out.println(\"Binary Tree \ \");
char ch;
do
{
System.out.println(\"\ here Binary Tree Operations\ \");
System.out.println(\"1 for insert 2 for search 3 for count 4 for check\");//here choice
numbers
int cho = sc.nextInt();
int k;
switch (cho)
{
k++;
case 1 :System.out.println(\"please enter insert ele\");
bin_c.tee_insert( sc.nextInt() );
break;
case 2 :System.out.println(\"enter bin_search\");//here search option
System.out.println(\"result\"+ bin_c.bin_serc( sc.nextInt() ));//result
break;
case 3 :System.out.println(\"Nodes\"+ bin_c.cou_Node());
break;
case 4 :System.out.println(\"Empty\"+ bin_c.isEmpty());
break;
default ://here default condition
System.out.println(\"enter 1 TO 4 only.
Write a program that works with fractions. You are first to implemen.pdf
Write a program that works with fractions. You are first to implement three methods, each to
perform a different calculation on a pair of fractions: subtract, multiply, and divide. For each of
these methods, you are supplied two fractions as arguments, each a two-element array (the
numerator is at index 0, the denominator is at index 1), and you are to return a resulting,
simplified fraction as a new two-element array (again, with the numerator at index 0, and
denominator at index 1). You have been provide an add method as an example. You must
compute the resulting fraction using fraction-based math (working with numerators and
denominators) – do not convert the fractions to double values (like 1.5), do the math, and convert
back to a fraction. You have been provided a method to simplify a fraction using the gcd method
from the previous lab.
Once the operation methods are complete and pass the JUnit tests, now focus your attention on
the main method. You first need to input the two fractions from the keyboard (numerator then
denominator for each; you can assume integers) as well as one of the four valid operations (+, -,
*, /). Then validate the inputs: make sure a valid operation was input, make sure neither of the
denominators are zero, and make sure that the numerator of the second fraction isn’t zero if the
operation is division (error messages have been provided for each of these situations). Finally,
compute the result of the operation and output the answer. Note that if the denominator of the
answer is 1, you should just output the numerator (this includes if the answer is 0).
Here is the outline code given:
public class LA5a {
/**
* Error to output if either denominator is zero
*/
static final String E_DEN_ZERO = \"Denominator cannot be zero.\";
/**
* Error to output if dividing by zero
*/
static final String E_DIV_ZERO = \"Cannot divide by zero.\";
/**
* Error to output if the operation is invalid
*/
static final String E_OP_INVALID = \"Invalid operation.\";
/**
* Returns the greatest common divisor (gcd) of two integers
*
* @param num1 integer 1
* @param num2 integer 2
* @return gcd of integers 1 and 2
*/
public static int gcd(int num1, int num2) {
int t;
while (num2 != 0) {
t = num2;
num2 = num1 % num2;
num1 = t;
}
return num1;
}
/**
* Returns the simplified form of a fraction
*
* @param f fraction (numerator=[0], denominator=[1])
* @return simplified fraction (numerator=[0], denominator=[1])
*/
public static int[] simplifyFraction(int[] f) {
final int gcd = gcd(f[0], f[1]);
int[] result = {f[0]/gcd, f[1]/gcd};
if ((result[0]<0 && result[1]<0) || (result[1]<0)) {
result[0] = -result[0];
result[1] = -result[1];
}
return result;
}
/**
* Adds two fractions
*
* @param f1 first fraction (numerator=[0], denominator=[1])
* @param f2 second fraction (numerator=[0], denominator=[1])
* @return result of adding parameters (numerator=[0], denominator=[1])
*/
public static int[] addFractions(int[] f1, int[] f2) {
int[] result = new int[2];
resu.
a. The alleles are as followsaa - AlbinismAa AA - Normal pigm.pdf
a. The alleles are as follows:
aa - Albinism
Aa / AA - Normal pigmentation
rr - Red hair
Rr / RR - Brown hair
b. The albino parent is homozygous recessive for hair color as her both parents had red hair. So
her genotype for hair color is \"rr\".
c. As the brown haired parent had one red haired parent, so he is heterozygous for hair color. So
his genotype for hair color is \"Rr\".
Since he had a child having albinism which is a recessive trait, this means he is heterozygous for
skin pigmentation too. So his genotype regarding skin pigmentation is \"Aa\".
d. The genotype of first child with respect to hair color is: \"Rr\" and with respect to skin
pigmentation is: \"Aa\".
Solution
a. The alleles are as follows:
aa - Albinism
Aa / AA - Normal pigmentation
rr - Red hair
Rr / RR - Brown hair
b. The albino parent is homozygous recessive for hair color as her both parents had red hair. So
her genotype for hair color is \"rr\".
c. As the brown haired parent had one red haired parent, so he is heterozygous for hair color. So
his genotype for hair color is \"Rr\".
Since he had a child having albinism which is a recessive trait, this means he is heterozygous for
skin pigmentation too. So his genotype regarding skin pigmentation is \"Aa\".
d. The genotype of first child with respect to hair color is: \"Rr\" and with respect to skin
pigmentation is: \"Aa\"..
More Related Content
Similar to AnswerNote Provided code shows several bugs, hence I implemented.pdf
Help in JAVAThis program should input numerator and denominator f.pdf
Help in JAVA:
This program should input numerator and denominator from a file, create a Fraction object
(reducing the fraction if necessary) and then save the fraction to an ArrayList. This list will then
be sorted, and output.
Make one method to input, create, and add to the ArrayList. Another method call to sort. And the
third method to output the contents of the (sorted) ArrayList.
The input file will consist of an (unknown) quantity of ints representing numerator denominator
pairs, which may be negative or zero.
You will need to think about your constructor - you will find it easier if you follow these rules
1. If both numerator and denominator are negative make them both positive
2. if the numerator is positive but the denominator is negative switch both so that the numerator
is negative and the denominator positive
3. any other case leave as is.
what I have so far:
public static class Fraction {
private int numerator;
private int denominator;
public Fraction() {
numerator = 0;
denominator = 1;
}
public Fraction(int n, int d) {
int g = gcd(n, d);
numerator = n/g;
denominator = d/g;
}
public int getNumerator() {
return numerator;
}
public void setNumerator(int n) {
int d = denominator;
int g = gcd(n, d);
numerator = n / g;
denominator= d/g;
}
public int getDenominator() {
return denominator;
}
public void setDenominator(int d) {
int n = numerator;
int g = gcd(n, d);
denominator = d / g;
numerator= n/g;
}
public Fraction add(Fraction g) {
int a = this.numerator;
int b = this.denominator;
int c = g.numerator;
int d = g.denominator;
Fraction v = new Fraction(a * d + b * c, b * d);
return v;
}
public Fraction subtract(Fraction g) {
int a = this.numerator;
int b = this.denominator;
int c = g.numerator;
int d = g.denominator;
Fraction v = new Fraction(a * d - b * c, b * d);
return v;
}
public Fraction multiply(Fraction g) {
int a = this.numerator;
int b = this.denominator;
int c = g.numerator;
int d = g.denominator;
Fraction v = new Fraction(a * c, b * d);
return v;
}
public Fraction divide(Fraction g) {
int a = this.numerator;
int b = this.denominator;
int c = g.numerator;
int d = g.denominator;
Fraction v = new Fraction(a * d, b * c);
return v;
}
public String toString() {
return numerator + \"/\" + denominator;
}
private int gcd(int int1, int int2) {
int i = 0;
int smallest=0;
if (int2>0){
if (int1 < int2) {
smallest=int1;
}
else{
smallest= int2;
}
for (i = smallest; i > 0; i--) {
if ((int1 % i == 0) && (int2 % i == 0)) {
break;
}
}
}
return i;
}
public int input(){
File inFile = new File(\"h7.txt\");
Scanner fileInput = null;
try {
fileInput = new Scanner(inFile);
} catch (FileNotFoundException ex) {
}
fileInput.nextInt();
}
public int sort(int input){
Collections.sort();
}
public int output(){
System.out.println();
}
}
public static void main(String[] args) {
}
}
Solution
Fraction class is used to represents fractions. It is always used to reduced to lowest terms.If
fraction is negative then the numerator will always be negative and all op.
Functions
This for the students of computer science and for those who want to learn about the concepts
#ifndef RATIONAL_H if this compiler macro is not defined #def.pdf
#ifndef RATIONAL_H // if this compiler macro is not defined
#define RATIONAL_H // then define it so this file will not be processed again
#include \"stdafx.h\" // use only for Microsoft Visual Studio C++
#include
using namespace std;
class Rational
{
// Friend functions are actually declared outside the scope of the
// class but have the right to access public and private data and
// member function members that belong to the class. The friend
// function below gives the << operator for ostreams (including cout)
// the ability to output a Rational object by accessing its member data.
friend ostream &operator<< (ostream &out, Rational const &r);
public:
Rational(int num = 0, int denom = 1); // also provides default constructor
Rational add(Rational right);
Rational operator+ (Rational right); // + addition operator
Rational operator+= (Rational right); // += addition assignment operator
Rational operator- (Rational right); // + addition operator
Rational operator-= (Rational right); // += addition assignment operator
void display();
operator double() const; // convert Rational to double
private:
int numerator;
int denominator;
// helper functions are private and not accessible by the main program
int LCD(int v1, int v2);
Rational setRational(int n, int d);
};
#endif
#include \"stdafx.h\"
#include
#include \"Rational.h\"
using namespace std;
// By using the default parameter settings in Rational.h, this
// constructor also provides the default constructor Rational()
Rational::Rational(int num, int denom)
{
setRational(num, denom); // set numerator and denominator, reduce fraction, fix the sign
}
// Helper function to fix a zero denominator and fix the sign if denominator is negative
Rational Rational::setRational(int n, int d) // helper function
{
numerator = n;
denominator = d;
// if denominator == 0 then set it = 1
if (denominator == 0)
denominator = 1;
if (denominator < 0) // if denominator is neg, multiply num and denom by -1
{
numerator = -numerator; // fix sign of numerator +/-
denominator = -denominator; // denominator always +
}
int lcd = LCD(numerator, denominator);
if (denominator != 0)
{
numerator /= lcd;
denominator /= lcd;
}
return *this; // return the current object
}
// find the lowest common divisor using a recursive function
int Rational::LCD(int v1, int v2)
{
if (v2 == 0) return v1;
else return LCD(v2, v1%v2);
}
Rational Rational::add(Rational right)
{
int newNumerator;
int newDenominator;
newNumerator = numerator*right.denominator + right.numerator*denominator;
newDenominator = denominator * right.denominator;
// create a new Rational object and return it
return setRational(newNumerator, newDenominator);
}
// the operator+ method does the same thing as the add method
Rational Rational::operator+ (Rational right)
{
int newNumerator;
int newDenominator;
newNumerator = numerator*right.denominator + right.numerator*denominator;
newDenominator = denominator * right.denominator;
// create a new Rational object and return it
return .
When we test your Fraction.java we will use the given FractionTester.pdf
When we test your Fraction.java we will use the given FractionTester.java file.
Add the following methods to the given Fraction.java file
-public Fraction add( Fraction other) returns a Fraction that is the sum of the two Fractions.
-public Fraction subtract( Fraction other) returns a Fraction that is the difference between this
Fraction minus the other Fraction.
-public Fraction multiply( Fraction other) returns a Fraction that is the product of the two
Fractions.
-public Fraction divide( Fraction other) returns a Fraction that is the quotient of the two
Fractions.
-public Fraction reciprocal() returns a Fraction that is the reciprocal of this Fractions.
-private void reduce() Does not return a Fraction. It just modifies this Fraction by reducing it to
its lowest form.
Every Fraction must reduce at all times. Every new fraction constructed it must be reduced
before the constructor exits. No Fraction at any time may be stored in a form other than its
reduced form.
/* Fraction.java A class (data type) definition file
This file just defines what a Fraction is
This file is NOT a program
** data members are PRIVATE
** method members are PUBLIC
*/
public class Fraction
{
private int numer;
private int denom;
// ACCESSORS
public int getNumer()
{
return numer;
}
public int getDenom()
{
return denom;
}
public String toString()
{
return numer + \"/\" + denom;
}
// MUTATORS
public void setNumer( int n )
{
numer = n;
}
public void setDenom( int d )
{
if (d!=0)
denom=d;
else
{
// error msg OR exception OR exit etc.
}
}
// DEFAULT CONSTRUCTOR - no args passed in
public Fraction( )
{
this( 0, 1 ); // \"this\" means call a fellow constructor
}
// 1 arg CONSTRUCTOR - 1 arg passed in
// assume user wants whole number
public Fraction( int n )
{
this( n, 1 ); // \"this\" means call a fellow constructor
}
// FULL CONSTRUCTOR - an arg for each class data member
public Fraction( int n, int d )
{
setNumer(n);
setDenom(d);
// call your reduce here
}
// COPY CONSTRUCTOR - takes ref to some already initialized Fraction object
public Fraction( Fraction other )
{
this( other.numer, other.denom ); // call my full C\'Tor with other Fraction\'s data
}
private void reduce()
{
// reduces this fraction to lowest form
}
}// EOF
JavaTester file
Solution
/* Fraction.java A class (data type) definition file
This file just defines what a Fraction is
This file is NOT a program
** data members are PRIVATE
** method members are PUBLIC
*/
public class Fraction {
private int numer;
private int denom;
// ACCESSORS
public int getNumer() {
return numer;
}
public int getDenom() {
return denom;
}
public String toString() {
return numer + \"/\" + denom;
}
// MUTATORS
public void setNumer(int n) {
numer = n;
}
public void setDenom(int d) {
if (d != 0)
denom = d;
else {
// error msg OR exception OR exit etc.
}
}
// DEFAULT CONSTRUCTOR - no args passed in
public Fraction() {
this(0, 1); // \"this\" means call a fellow constructor
}
// 1 arg CONSTRUCTOR - 1 arg passed in
// assume user wants who.
Hi,I have updated your code. It is working fine now. Highllighted .pdf
Hi,
I have updated your code. It is working fine now. Highllighted all code changes below.
Shapes.java
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3));
System.out.println();
System.out.printf( \"Square perimeter, area:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2 *Math.E * 1.);
System.out.println();
System.out.printf( \" area : \" + Math.E * 1.* 1);
System.out.println();
}
public static void main( String[] args )
{
//System.out.printf( \"Radius (as integer) of bounding sphere?\ %s!\ \", getradius() );
Scanner input = new Scanner( System.in );
System.out.println(\"Enter the radius:\");
int radius = input.nextInt();
Shapes s = new Shapes(radius);
s.report();
}
}
Output:
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3));
System.out.println();
System.out.printf( \"Square perimeter, area:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2 *Math.E * 1.);
System.out.println();
System.out.printf( \" area : \" + Math.E * 1.* 1);
System.out.println();
}
public static void main( String[] args )
{
//System.out.printf( \"Radius (as integer) of bounding sphere?\ %s!\ \", getradius() );
Scanner input = new Scanner( System.in );
System.out.println(\"Enter the radius:\");
int radius = input.nextInt();
Shapes s = new Shapes(radius);
s.report();
}
}
Solution
Hi,
I have updated your code. It is working fine now. Highllighted all code changes below.
Shapes.java
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3).
write the To Dos to get the exact outputNOte A valid Fraction .pdf
write the To Do\'s to get the exact output:
NOte: A valid Fraction number has a non-negative numerator and a positive denominator.
Default constructor initializes the object to safe empty state (an object with denom equals -1).
The two-argument constructor also validates the parameters and sets the object to the safe empty
state if the parameters are not valid.
Write the definitions and prototypes of following functions in Fraction.cpp and Fraction.h
respectively (They are indicated in the files by //TODO tag):
Define isEmpty function as a member function, which returns true if the object is in safe empty
state (an object is in the safe empty state if denominator (denom) equals -1).
Define display function, which sends a Fraction number to the output stream (with the
“Numerator/denominator” format). This function just prints \"Invalid Fraction Object!\" in the
screen if the object is in the safe empty state. In case that object denominator equals 1, it just
print the numerator.
Define the operator functions for the following operators:
“+=”, “+”, “*”
The overload of the above operators should make the following code possible:
The member operator+ : Adds two Fraction numbers and returns a Fraction number as the result.
This function returns an object with the safe empty state if either of Fraction numbers (operands)
is in safe empty state. It makes following code possible:
A+B ( where A and B are Fraction objects)
The member operator+= : Adds two Fraction numbers and assigns the result to the left operand,
then returns a reference to the left operand. If either of Fraction numbers (operands) is in safe
empty state, it initializes the left operand to the safe empty state, then returns a reference to the
left operand. It makes following code possible:
A+=B ( where A and B are Fraction objects)
The member operator* : Multiplies two Fraction numbers and returns a Fraction number as the
result. This function returns an object with the safe empty state if either of Fraction numbers
(operands) is in safe empty state. It makes following code possible:
A*B ( where A and B are Fraction objects)
fraction.cpp
#include \"Fraction.h\"
using namespace std;
namespace sict{
Fraction::Fraction(){
denom =-1; // safe empty state
}
Fraction::Fraction(int n, int d) // n: numerator, d: denominator
{
if(n >= 0 && d > 0){
num = n;
denom = d;
reduce();
}
else
denom =-1; // set to safe empty state
}
int Fraction::gcd() // returns the greatest common divisor of num and
denom
{
int mn = min(); // min of num and denom
int mx = max(); // mX of num and denom
for (int x=mn ; x > 0 ; x--) // find the greatest common divisor
if( mx % x == 0 && mn % x == 0)
return x;
return 1;
}
void Fraction::reduce() // simplify the Fraction number
{
int tmp = gcd();
num /= tmp;
denom /= tmp;
}
int Fraction::max ()
{
return (num >= denom) ? num : denom;
}
int Fraction::min()
{
return (num >= denom) ? denom : num;
}
// in_lab
// TODO: write the implementation of display function HERE
// TODO: w.
Keep getting a null pointer exception for some odd reasonim creati.pdf
Keep getting a null pointer exception for some odd reason
im creating the variable and the object but it still isnt working
My code is below please help
package classes;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
import java.io.*;
import java.util.*;
import java.text.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class NewClass4
{
private class Node
{
private String text;
private int Hit;
private int Miss;
private Node next;
public Node(String text, int Hit, int Miss, Node next)
{
this.text=text;
this.Hit=Hit;
this.Miss=Miss;
this.next=next;
}
public void incrementHit()
{
this.Hit = this.Hit+1;
}
public void incrementMiss()
{
this.Miss = this.Miss+1;
}
public String getText()
{
return this.text;
}
public int getHit()
{
return this.Hit;
}
public int getMiss()
{
return this.Miss;
}
}//end of node
private class LL
{
public Node head;
public LL()
{
head=null;
}
public void insert(String text2, boolean isHit)
{
System.out.println(\"entered insert method\");
Node temp=this.head;
System.out.println(\"sent temp node to head\");
while((temp!=null) && (!temp.text.equals(text2)) )
{
temp=temp.next;
}
if(temp==null)
{
// we did not find the string
if(isHit)
{
this.head=new Node(text2,1, 0, this.head );
}
else
{
this.head=new Node(text2,0, 1, this.head );
}
}
else
{
if(isHit)
{
temp.incrementHit();
}
else
{
temp.incrementMiss();
}
}
}//end of insert
public void printList()
{
Node temp=this.head;
while(temp!=null)
{
int Hit=temp.getHit();
int Miss=temp.getMiss();
double sucRate=Hit*100/(Hit+Miss);
System.out.println(temp.getText() + \" \" + sucRate);
}
}
}// end of LL
private static LL myLL;
public NewClass4()
{
this.myLL = new LL();
}
public static void main(String[] args)
{
SimpleDateFormat sdf = new
SimpleDateFormat(\"dd/MMM/yyyy:HH:mm:ss\",Locale.ENGLISH);
String myString = null;
Pattern a = Pattern.compile(\"[0-9]{2}\\\\/?[A-Za-z]{3,4}\\\\/?[0-9]{4}[.,-:]{1}[0-9.,-
:]{1,}\\\\s+\");
Pattern d= Pattern.compile(\"\\\\s+\\\\/+[0-9.]{3}\\\\/+[A-Za-z]{1,}\\\\/+[A-Za-z.,-:%]{1,}\");
Pattern f= Pattern.compile(\"\\\\s+[0-9]{3}\\\\s+\");
String newLine;
try {
File file = new File(\"myFile.txt\");
FileReader fileReader = new FileReader(file);
BufferedReader bufferedReader = new BufferedReader(fileReader);
String line;
while ((line = bufferedReader.readLine()) != null)
{
myString = line;
System.out.println(myString);
Matcher m1 = a.matcher(myString);
Matcher m2 = d.matcher(myString);
Matcher m3 = f.matcher(myString);
if (m1.find() && m2.find()&& m3.find())
try {
Date parsedDate = sdf.parse(m1.group());
SimpleDateFormat print = new SimpleDateFormat(\"yyyy-MM-dd\'T\'HH:mm\");
int responseCode = Integer.parseInt(m3.group().trim());
System.out.println(print.format(parsedDate)+ \" \"+m2.group()+\" \"+responseCode);
newLine = print.format(parsedDate)+ \" \"+m2.group();
// decide true or false
if (responseC.
C++ AssignmentPlease read all the requirements and the overloading.pdf
C++ Assignment
Please read all the requirements and the overloading requiremets.
Here is what i have so far,
#include
using namespace std;
class ComplexNumbers
{
private:
double real;
double imaginary;
public:
void input ();
void output();
void setReal ( int );
int getReal ();
void setImaginary ( int );
int getImaginary();
ComplexNumbers();
ComplexNumbers(int);
ComplexNumbers(int, int);
friend bool operator == (ComplexNumbers , ComplexNumbers);
friend ComplexNumbers operator + (ComplexNumbers , ComplexNumbers);
friend ComplexNumbers operator - (ComplexNumbers , ComplexNumbers);
friend ComplexNumbers operator * (ComplexNumbers , ComplexNumbers);
friend ComplexNumbers operator - (ComplexNumbers);
};
void ComplexNumbers::setReal(int x)
{
real=x;
}
void ComplexNumbers::setImaginary(int y)
{
imaginary=y;
}
int ComplexNumbers::getReal()
{
return real;
}
int ComplexNumbers::getImaginary()
{
return imaginary;
}
//default constructor
ComplexNumbers::ComplexNumbers()
{
real=0;
imaginary=0;
}
//single parameterized constructor
ComplexNumbers:: ComplexNumbers(int z)
{
real=z;
}
//two parameterized constructor
ComplexNumbers::ComplexNumbers(int r,int u)
{
real = r;
imaginary= u;
}
void ComplexNumbers::input ()
{
int aReal(0),bImaginary(0);
cout<<\"enter real no\"<>aReal;
cout<<\"enter imaginary\"<>bImaginary;
real = aReal;
imaginary = bImaginary;
}
/* int real,imaginary;
cout<<\"enter real no\"<>real;
cout<<\"enter imaginary\"<>imaginary;*/
void ComplexNumbers::output()
{
cout<<\"the complex no is\"<
Solution
Your program is well-written. Apart from overloading the binary and unary operators. I have
modified your code and changed \"int\" to \"double\" in Constructors, and some methods.
FYI. Accessors are nothing but \"get\" methods in a class
Mutators are overloaded operators +,-,*. Means these operators are mutated over your
\"ComplexNumbers\" class.
The following is the modified program:
#include
using namespace std;
class ComplexNumbers
{
private:
double real;
double imaginary;
public:
void input ();
void output();
void setReal ( double );
double getReal ();
void setImaginary ( double );
double getImaginary();
ComplexNumbers();
ComplexNumbers(double);
ComplexNumbers(double,double);
bool operator == (ComplexNumbers&);
ComplexNumbers operator + (ComplexNumbers&);
ComplexNumbers operator - (ComplexNumbers&);
ComplexNumbers operator * (ComplexNumbers&);
ComplexNumbers operator - ();//unary minus
};
void ComplexNumbers::setReal(double x)
{
real=x;
}
void ComplexNumbers::setImaginary(double y)
{
imaginary=y;
}
double ComplexNumbers::getReal()
{
return real;
}
double ComplexNumbers::getImaginary()
{
return imaginary;
}
//default constructor
ComplexNumbers::ComplexNumbers()
{
real=0;
imaginary=0;
}
//single parameterized constructor
ComplexNumbers:: ComplexNumbers(double z)
{
real=z;
}
//two parameterized constructor
ComplexNumbers::ComplexNumbers(double r,double u)
{
real = r;
imaginary= u;
}
void ComplexNumbers::input ()
{
int aReal(0),bImaginary(0);
cout<<\.
C# Program. Create a Windows application that has the functionality .pdf
C# Program. Create a Windows application that has the functionality of a calculator and works
with integral values. Allow the user to select buttons representing numeric values. If the user
attempts to divide by zero, throw and handle an exception.
Solution
below is the code from the windows application in visual studio:
Form1.cs
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Windows.Forms;
namespace SimpleCalculator
{
public partial class frmCalculator : Form
{
string operand1 = string.Empty;
string operand2 = string.Empty;
string result;
char operation;
public frmCalculator()
{
InitializeComponent();
}
private void frmCalculator_Load(object sender, EventArgs e)
{
btnOne.Click += new EventHandler(btn_Click);
btnTwo.Click += new EventHandler(btn_Click);
btnThree.Click += new EventHandler(btn_Click);
btnFour.Click += new EventHandler(btn_Click);
btnFive.Click += new EventHandler(btn_Click);
btnSix.Click += new EventHandler(btn_Click);
btnSeven.Click += new EventHandler(btn_Click);
btnEight.Click += new EventHandler(btn_Click);
btnNine.Click += new EventHandler(btn_Click);
btnZero.Click += new EventHandler(btn_Click);
btnDot.Click += new EventHandler(btn_Click);
}
void btn_Click(object sender, EventArgs e)
{
try
{
Button btn = sender as Button;
switch (btn.Name)
{
case \"btnOne\":
txtInput.Text += \"1\";
break;
case \"btnTwo\":
txtInput.Text += \"2\";
break;
case \"btnThree\":
txtInput.Text += \"3\";
break;
case \"btnFour\":
txtInput.Text += \"4\";
break;
case \"btnFive\":
txtInput.Text += \"5\";
break;
case \"btnSix\":
txtInput.Text += \"6\";
break;
case \"btnSeven\":
txtInput.Text += \"7\";
break;
case \"btnEight\":
txtInput.Text += \"8\";
break;
case \"btnNine\":
txtInput.Text += \"9\";
break;
case \"btnZero\":
txtInput.Text += \"0\";
break;
case \"btnDot\":
if(!txtInput.Text.Contains(\".\"))
txtInput.Text += \".\";
break;
}
}
catch(Exception ex)
{
MessageBox.Show(\"Sorry for the inconvenience, Unexpected error occured. Details:
\" +
ex.Message);
}
}
private void txtInput_KeyPress(object sender, KeyPressEventArgs e)
{
switch (e.KeyChar)
{
case \'1\':
case \'2\':
case \'3\':
case \'4\':
case \'5\':
case \'6\':
case \'7\':
case \'8\':
case \'9\':
case \'0\':
//case \'+\':
//case \'-\':
//case \'*\':
//case \'/\':
//case \'.\':
break;
default:
e.Handled = true;
MessageBox.Show(\"Only numbers, +, -, ., *, / are allowed\");
break;
}
}
private void txtInput_TextChanged(object sender, EventArgs e)
{
}
private void btnPlus_Click(object sender, EventArgs e)
{
operand1 = txtInput.Text;
operation = \'+\';
txtInput.Text = string.Empty;
}
private void btnMinus_Click(object sender, EventArgs e)
{
operand1 = txtInput.Text;
operation = \'-\';
txtInput.Text = string.Empty;
}
private void btnMulitply_Click(object sender, EventArgs e)
{
operand1 = txtInput.Text;
operation = \'*\';
txtInput.Text = string.Empty;
}
private void btnDivide_Click.
40+ examples of user defined methods in java with explanation
40+ examples of user defined methods in java with explanation,
advantages,
terms,
exercises,
pass arrays to methods,
return array from methods,
for each loop examples,
build complex programs using your defined methods
animation included
INDEX
Simple Programs using Methods
Add two numbers
Average of three numbers
Circle area
Fahrenheit to Celsius
Check number is even or not
Check number is prime or not
Reverse of a number
Check number is palindrome or not
Count number of digits in a number
Sum of digits
Pass Array to Methods
Print all elements of an array
Sum of an array
Average of an array
Maximum element of an array
Minimum element of an array
Returning Array From Methods
Reverse array
Reverse every element of an array
Decimal to binary, octal, hex
Binary to decimal, octal, hex
Octal to binary,decimal, hex
Hexadecimal to binary, octal, decimal
operating system ubuntu,linux,MacProgram will work only if you g.pdf
//operating system ubuntu,linux,Mac
Program will work only if you give command like
sum 2 3 or
sum 4 (sub 4 3)
#include
#include
#include
#include
/*Sum function implementation*/
int sum(int number1,int number2){
return number1+number2;
}
/*sub function implementation*/
int sub(int number1,int number2){
return number1-number2;
}
/*mul function implementation*/
int mul(int number1,int number2){
return number1*number2;
}
/*divide function implementation*/
float divide(int number1,int number2){
if(number2==0){
printf(\"We can not divide by 0 \ \");
return 0.0f;
}
return (float)(number1/number2);
}
char *substring(char *string, int position, int length)
{
char *pointer;
int c;
pointer = malloc(length+1);
if (pointer == NULL)
{
printf(\"Unable to allocate memory.\ \");
exit(1);
}
for (c = 0 ; c < length ; c++)
{
*(pointer+c) = *(string+position-1);
string++;
}
*(pointer+c) = \'\\0\';
return pointer;
}
/*Main Function start*/
int main(int argc, char *argv[]){
/*Variable declarations*/
int number1,number2;
char *operator,*str1,*str2;
char line[50];
char s[2] = \" \";
int errorFlag=0;// checking if user entered more then one operands
while(1){
/*User input*/
printf(\"Please Enter the command \");
gets(line);
int len=0;
for(int i=0; line[i]!=\'\\0\'; ++i){len++;}
if(len==0){
return 1;
}
/*Spliting into Tokens*/
operator = strtok(line, \" \");
if(strcmp(operator,\"bye\")==0){
break;
}
/*String to integer --- token1*/
number1=atoi(strtok(NULL, s));
/*Removing ( and ) from String*/
str2=strtok(NULL, s);
char *content;int length=0;
for(int i=0; str2[i]!=\'\\0\'; ++i){length++;}
if(str2[0]==\'(\'){
content=substring(str2,2,length-1);
char *opr=content;
int n1=atoi(strtok(NULL, s));
int n2=atoi(strtok(NULL, s));
/*If user entered more then two operands then it will return some token otherwise it will
return NULL pointer*/
if(strtok(NULL, s)!=NULL){
printf(\"You need to enter operator operand1 operand2 \ \");
errorFlag=1;
}else{
if(strcmp(opr,\"sum\")==0){
number2=sum(n1,n2);
}else if(strcmp(opr,\"sub\")==0){
number2=sub(n1,n2);
}else if(strcmp(opr,\"mul\")==0){
number2=mul(n1,n2);
} else if(strcmp(opr,\"div\")==0){
number2=divide(n1,n2);
}
}
}else{
number2=atoi(str2);
/*If user entered more then two operands then it will return some token otherwise it will return
NULL pointer*/
if(strtok(NULL, s)!=NULL){
printf(\"You need to enter operator operand1 operand2 \ \");
errorFlag=1;
}
}
if(errorFlag!=1){
/*Checking operator by strcmp function*/
if(strcmp(operator,\"sum\")==0){
printf(\"Result %d \ \",sum(number1,number2));
}else if(strcmp(operator,\"sub\")==0){
printf(\"Result %d \ \",sub(number1,number2));
}else if(strcmp(operator,\"mul\")==0){
printf(\"Result %d \ \",mul(number1,number2));
} else if(strcmp(operator,\"div\")==0){
printf(\"Result %.2f \ \",divide(number1,number2));
}
}
}
return 0;
}
/*******************Output***********************/
gopal@gopal:~/Desktop/chegg$ gcc Calculator.c
Calculator.c: In function ‘main’:
Calculator.c:67:3: warning: implici.
fraction_math.c for Project 5 Program Design fraction.pdf
/*fraction_math.c for Project 5
* Program Design
*/
//fraction_math.c
#include
#include
//function prototypes
void reduce(int numerator, int denominator, int*reduced_numerator, int*reduced_denominator);
int find_gcd(int m, int n);
//main function
int main(void)
{
int num1, denom1, num2, denom2, result_num, result_denom;
char operatorSymbol;
printf(\"Enter two fractions separated by a +, -, * or / sign: \");
scanf(\"%d/%d %c%d/%d\", &num1, &denom1, &operatorSymbol, &num2, &denom2);
switch (operatorSymbol)
{
case \'+\':
result_num = num1 * denom2 + num2 * denom1;
result_denom = denom1 * denom2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The sum is %d/%d\ \", result_num, result_denom);
break;
case \'-\':
result_num = num1 * denom2 - num2 * denom1;
result_denom = denom1 * denom2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The difference is %d/%d\ \", result_num, result_denom);
break;
case \'*\':
result_num = num1 * num2;
result_denom = denom1 * denom2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The product is %d/%d\ \", result_num, result_denom);
break;
case \'/\':
result_num = num1 * denom2;
result_denom = denom1 * num2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The quotient is %d/%d\ \", result_num, result_denom);
break;
default:
printf(\"Unrecognized operator: %c\ \", operatorSymbol);
}
getch();
return 0;
}
/*
The function reduce takes numberator and denominator and two pointers
and reduct the fraction by gcd
*/
void reduce(int numerator, int denominator, int*reduced_numerator, int*reduced_denominator)
{
//call find_gcd
int gcd=find_gcd(numerator,denominator);
//divide the value by gcd and set value at the pointer address
*reduced_numerator=numerator/gcd;
*reduced_denominator=denominator/gcd;
}
/*
The function find_gcd that takes m and n and returns
the gcd of two numbers
*/
int find_gcd(int m, int n)
{
if(n == 0)
return m;
return find_gcd(n, m%n);
}
----------------------------------------------------------------------------------
Sample output:
Enter two fractions separated by a +, -, * or / sign: 4/9-1/9
The difference is 1/3
Solution
/*fraction_math.c for Project 5
* Program Design
*/
//fraction_math.c
#include
#include
//function prototypes
void reduce(int numerator, int denominator, int*reduced_numerator, int*reduced_denominator);
int find_gcd(int m, int n);
//main function
int main(void)
{
int num1, denom1, num2, denom2, result_num, result_denom;
char operatorSymbol;
printf(\"Enter two fractions separated by a +, -, * or / sign: \");
scanf(\"%d/%d %c%d/%d\", &num1, &denom1, &operatorSymbol, &num2, &denom2);
switch (operatorSymbol)
{
case \'+\':
result_num = num1 * denom2 + num2 * denom1;
result_denom = denom1 * denom2;
//calling reduce function
reduce(result_num,result_denom,&result_num,&result_denom);
printf(\"The sum is %d/%d\ \", re.
ANSimport java.util.Scanner; class Bina_node { Bina_node .pdf
ANS:
import java.util.Scanner;
class Bina_node
{
Bina_node l_1, r_1;
int dt;//here declare variables
public Bina_node()//constructor
{
l_1 = null;
r_1 = null;
dt = 0;
}
public Bina_node(int n)//here parameter constractor
{
l_1 = null;
r_1 = null;
dt = n;
}
public void nin_left(Bina_node n)//copy constractor
{
l_1 = n;
}
public void nin_right(Bina_node n)
{
r_1 = n;
}
public Bina_node get_lstf()
{
return l_1;
}
public Bina_node get_go()
{
return r_1;
}
public void set_data(int d)
{
dt = d;
}
public int get_data()
{
return dt;
}
}
class Bina_tree//class banary tree
{
private Bina_node rf;
public Bina_tree()
{
rf = null;
}
public boolean isEmpty()//here empty or not
{
return rf == null;
}
public void tee_insert(int dt)
{
rf = tee_insert(rf, dt);
}
private Bina_node tee_insert(Bina_node node, int dt)
{
if (node == null)
node = new Bina_node(dt);
else
{
if (node.get_go() == null)
node.r_1 = tee_insert(node.r_1, dt);
else
node.l_1 = tee_insert(node.l_1, dt);
}
return node;
}
public int cou_Node()
{
return cou_Node(rf);
}
private int cou_Node(Bina_node r)
{
if (r == null)
return 0;
else
{
int l = 1;
l += cou_Node(r.get_lstf());
l += cou_Node(r.get_go());
return l;
}
}
public boolean bin_serc(int tree_val)//function called
{
return bin_serc(rf, tree_val);
}
private boolean bin_serc(Bina_node r, int tree_val)
{
if (r.get_data() == tree_val)
return true;
if (r.get_lstf() != null)
if (bin_serc(r.get_lstf(), tree_val))
return true;
if (r.get_go() != null)
if (bin_serc(r.get_go(), tree_val))
return true;
return false;
}
public void in_order()
{
in_order(rf);
}
private void in_order(Bina_node r)
{
if (r != null)
{
in_order(r.get_lstf());
System.out.print(r.get_data() +\" \");
in_order(r.get_go());
}
}
public void pre_order()
{
pre_order(rf);
}
private void pre_order(Bina_node r)
{
if (r != null)
{
System.out.print(r.get_data() +\" \");
pre_order(r.get_lstf());
pre_order(r.get_go());
}
}
public void post_order()
{
post_order(rf);
}
private void post_order(Bina_node r)
{
if (r != null)
{
post_order(r.get_lstf());
post_order(r.get_go());
System.out.print(r.get_data() +\" \");
}
}
}
public class Bina_Tree//binary tree class
{
public static void main(String[] args)//here main methode
{
Scanner sc = new Scanner(System.in);//here scanner
Bina_tree bin_c = new Bina_tree();
System.out.println(\"Binary Tree \ \");
char ch;
do
{
System.out.println(\"\ here Binary Tree Operations\ \");
System.out.println(\"1 for insert 2 for search 3 for count 4 for check\");//here choice
numbers
int cho = sc.nextInt();
int k;
switch (cho)
{
k++;
case 1 :System.out.println(\"please enter insert ele\");
bin_c.tee_insert( sc.nextInt() );
break;
case 2 :System.out.println(\"enter bin_search\");//here search option
System.out.println(\"result\"+ bin_c.bin_serc( sc.nextInt() ));//result
break;
case 3 :System.out.println(\"Nodes\"+ bin_c.cou_Node());
break;
case 4 :System.out.println(\"Empty\"+ bin_c.isEmpty());
break;
default ://here default condition
System.out.println(\"enter 1 TO 4 only.
Write a program that works with fractions. You are first to implemen.pdf
Write a program that works with fractions. You are first to implement three methods, each to
perform a different calculation on a pair of fractions: subtract, multiply, and divide. For each of
these methods, you are supplied two fractions as arguments, each a two-element array (the
numerator is at index 0, the denominator is at index 1), and you are to return a resulting,
simplified fraction as a new two-element array (again, with the numerator at index 0, and
denominator at index 1). You have been provide an add method as an example. You must
compute the resulting fraction using fraction-based math (working with numerators and
denominators) – do not convert the fractions to double values (like 1.5), do the math, and convert
back to a fraction. You have been provided a method to simplify a fraction using the gcd method
from the previous lab.
Once the operation methods are complete and pass the JUnit tests, now focus your attention on
the main method. You first need to input the two fractions from the keyboard (numerator then
denominator for each; you can assume integers) as well as one of the four valid operations (+, -,
*, /). Then validate the inputs: make sure a valid operation was input, make sure neither of the
denominators are zero, and make sure that the numerator of the second fraction isn’t zero if the
operation is division (error messages have been provided for each of these situations). Finally,
compute the result of the operation and output the answer. Note that if the denominator of the
answer is 1, you should just output the numerator (this includes if the answer is 0).
Here is the outline code given:
public class LA5a {
/**
* Error to output if either denominator is zero
*/
static final String E_DEN_ZERO = \"Denominator cannot be zero.\";
/**
* Error to output if dividing by zero
*/
static final String E_DIV_ZERO = \"Cannot divide by zero.\";
/**
* Error to output if the operation is invalid
*/
static final String E_OP_INVALID = \"Invalid operation.\";
/**
* Returns the greatest common divisor (gcd) of two integers
*
* @param num1 integer 1
* @param num2 integer 2
* @return gcd of integers 1 and 2
*/
public static int gcd(int num1, int num2) {
int t;
while (num2 != 0) {
t = num2;
num2 = num1 % num2;
num1 = t;
}
return num1;
}
/**
* Returns the simplified form of a fraction
*
* @param f fraction (numerator=[0], denominator=[1])
* @return simplified fraction (numerator=[0], denominator=[1])
*/
public static int[] simplifyFraction(int[] f) {
final int gcd = gcd(f[0], f[1]);
int[] result = {f[0]/gcd, f[1]/gcd};
if ((result[0]<0 && result[1]<0) || (result[1]<0)) {
result[0] = -result[0];
result[1] = -result[1];
}
return result;
}
/**
* Adds two fractions
*
* @param f1 first fraction (numerator=[0], denominator=[1])
* @param f2 second fraction (numerator=[0], denominator=[1])
* @return result of adding parameters (numerator=[0], denominator=[1])
*/
public static int[] addFractions(int[] f1, int[] f2) {
int[] result = new int[2];
resu.
Similar to AnswerNote Provided code shows several bugs, hence I implemented.pdf (20)
Help in JAVAThis program should input numerator and denominator f.pdf
Help in JAVAThis program should input numerator and denominator f.pdf
#ifndef RATIONAL_H if this compiler macro is not defined #def.pdf
#ifndef RATIONAL_H if this compiler macro is not defined #def.pdf
When we test your Fraction.java we will use the given FractionTester.pdf
When we test your Fraction.java we will use the given FractionTester.pdf
Hi,I have updated your code. It is working fine now. Highllighted .pdf
Hi,I have updated your code. It is working fine now. Highllighted .pdf
write the To Dos to get the exact outputNOte A valid Fraction .pdf
write the To Dos to get the exact outputNOte A valid Fraction .pdf
Keep getting a null pointer exception for some odd reasonim creati.pdf
Keep getting a null pointer exception for some odd reasonim creati.pdf
C++ AssignmentPlease read all the requirements and the overloading.pdf
C++ AssignmentPlease read all the requirements and the overloading.pdf
C# Program. Create a Windows application that has the functionality .pdf
C# Program. Create a Windows application that has the functionality .pdf
40+ examples of user defined methods in java with explanation
40+ examples of user defined methods in java with explanation
operating system ubuntu,linux,MacProgram will work only if you g.pdf
operating system ubuntu,linux,MacProgram will work only if you g.pdf
fraction_math.c for Project 5 Program Design fraction.pdf
fraction_math.c for Project 5 Program Design fraction.pdf
ANSimport java.util.Scanner; class Bina_node { Bina_node .pdf
ANSimport java.util.Scanner; class Bina_node { Bina_node .pdf
Write a program that works with fractions. You are first to implemen.pdf
Write a program that works with fractions. You are first to implemen.pdf
More from anurag1231
a. The alleles are as followsaa - AlbinismAa AA - Normal pigm.pdf
a. The alleles are as follows:
aa - Albinism
Aa / AA - Normal pigmentation
rr - Red hair
Rr / RR - Brown hair
b. The albino parent is homozygous recessive for hair color as her both parents had red hair. So
her genotype for hair color is \"rr\".
c. As the brown haired parent had one red haired parent, so he is heterozygous for hair color. So
his genotype for hair color is \"Rr\".
Since he had a child having albinism which is a recessive trait, this means he is heterozygous for
skin pigmentation too. So his genotype regarding skin pigmentation is \"Aa\".
d. The genotype of first child with respect to hair color is: \"Rr\" and with respect to skin
pigmentation is: \"Aa\".
Solution
a. The alleles are as follows:
aa - Albinism
Aa / AA - Normal pigmentation
rr - Red hair
Rr / RR - Brown hair
b. The albino parent is homozygous recessive for hair color as her both parents had red hair. So
her genotype for hair color is \"rr\".
c. As the brown haired parent had one red haired parent, so he is heterozygous for hair color. So
his genotype for hair color is \"Rr\".
Since he had a child having albinism which is a recessive trait, this means he is heterozygous for
skin pigmentation too. So his genotype regarding skin pigmentation is \"Aa\".
d. The genotype of first child with respect to hair color is: \"Rr\" and with respect to skin
pigmentation is: \"Aa\"..
49) sensation is what we receive through senses and perception is wh.pdf
49) sensation is what we receive through senses and perception is what we review those senses
and come to a conclusion based on our review.
50) Usually, sodium, calcium, and potassium ions are transported across membranes against a
concentration gradient. The transport of water immediately after the sodium ion transport is to
balance the volume upon ion transport. The Oral dehydration therapy involves administration of
water along with salt and sugar. The aim is to supply the body with required water that was lost
by dehydration and salts helps increase the uptake of water molecules in the blood, based on the
above said principle. That is when an excess amount of salt is available, a concentration gradient
is created which initiates ion transport across the membrane and water is also transferred along
with the salt to maintain the volume deficit.
Solution
49) sensation is what we receive through senses and perception is what we review those senses
and come to a conclusion based on our review.
50) Usually, sodium, calcium, and potassium ions are transported across membranes against a
concentration gradient. The transport of water immediately after the sodium ion transport is to
balance the volume upon ion transport. The Oral dehydration therapy involves administration of
water along with salt and sugar. The aim is to supply the body with required water that was lost
by dehydration and salts helps increase the uptake of water molecules in the blood, based on the
above said principle. That is when an excess amount of salt is available, a concentration gradient
is created which initiates ion transport across the membrane and water is also transferred along
with the salt to maintain the volume deficit..
1. INTRODUCTIONWe are currently living in the so-called informatio.pdf
1. INTRODUCTION
We are currently living in the so-called information age which can be described as an era were
economic activities are mainly information based (an age of informationalization). This is due to
the development and use of technology. The main characteristics of this era can be summarized
as a rise in the number of knowledge workers, a world that has become more open - in the sense
of communication (global village/Gutenberg galaxy) and internationalization (trans-border flow
of data).
This paradigm shift brings new ethical and juridical problems which are mainly related to issues
such as the right of access to information, the right of privacy which is threatened by the
emphasis on the free flow of information, and the protection of the economic interest of the
owners of intellectual property.
In this paper the ethical questions related to the right to privacy of the individual which is
threatened by the use of technology will be discussed. Specific attention will be given to the
challenges these ethical problems pose to the information professional. A number of practical
guidelines, based on ethical norms will be laid down.
2. ETHICS
The ethical actions of a person can be described in general terms as those actions which are
performed within the criterium of what is regarded as good. It relates thus to the question of what
is good or bad in terms of human actions. According to Spinello (1995, p. 14) the purpose
of ethics is to help us behave honorably and attain those basic goods that make us more fully
human.
3. THE CONCEPT OF PRIVACY
3.1. Definition of Privacy
Privacy can be defined as an individual condition of life characterized by exclusion from
publicity (Neetling et al., 1996, p. 36). The concept follows from the right to be left alone (Stair,
1992, p. 635; Shank, 1986, p. 12)1 . Shank (1986, p. 13) states that such a perception of privacy
set the course for passing of privacy laws in the United States for the ninety years that followed.
As such privacy could be regarded as a natural right which provides the foundation for the legal
right. The right to privacy is therefore protected under private law.
The legal right to privacy is constitutionally protected in most democratic societies. This
constitutional right is expressed in a variety of legislative forms. Examples include the Privacy
Act (1974) in the USA, the proposed Open Democracy Act in South Africa (1996) and the Data
Protection Act in England. During 1994 Australia also accepted a Privacy Charter containing 18
privacy principles which describe the right of a citizen concerning personal privacy as effected
by handling of information by the state (Collier, 1994, p. 44-45). The Organization for Economic
and Coordination and Development (OECD) also accepted in 1980 the Guidelines for the
Protection of Privacy and Transborder Flow of Personal Data (Collier, 1994, p. 41).
Privacy is an important right because it is a necessary condition for other rights such as freedo.
1. d.) Organisms using oxygenic photosynthesis release oxygen into t.pdf
1. d.) Organisms using oxygenic photosynthesis release oxygen into the atmosphere, causing an
increase in the oxygen in the atmosphere and allowing for the development of aerobes.
3. Type of fermentation. Salmonella are methyl red positive, VP negative, positive for H2S
production, negative for gelatin liquefaction, whereas Serratia is methyl red negative, VP
positive, negative for H2S production, and positive for gelatin liquefaction.
4. Mycoplasmas are fastidious organisms that require nutrient supplementation in the medium.
They require fetal or now born calf serum, heart infusion, salts, glucose and/or arginine. Their
growth rate is slow. Since they lack a cell wall, they cannot take up typical Gram stain. Also,,
their extremely small size makes it difficult to visualize them.
Solution
1. d.) Organisms using oxygenic photosynthesis release oxygen into the atmosphere, causing an
increase in the oxygen in the atmosphere and allowing for the development of aerobes.
3. Type of fermentation. Salmonella are methyl red positive, VP negative, positive for H2S
production, negative for gelatin liquefaction, whereas Serratia is methyl red negative, VP
positive, negative for H2S production, and positive for gelatin liquefaction.
4. Mycoplasmas are fastidious organisms that require nutrient supplementation in the medium.
They require fetal or now born calf serum, heart infusion, salts, glucose and/or arginine. Their
growth rate is slow. Since they lack a cell wall, they cannot take up typical Gram stain. Also,,
their extremely small size makes it difficult to visualize them..
1. All RTKs have a similar molecular architecture, with a ligand-bin.pdf
1. All RTKs have a similar molecular architecture, with a ligand-binding region in the
extracellular domain, a single transmembrane helix, and a cytoplasmic region that contains the
protein tyrosine kinase (TK) domain plus additional carboxy (C-) terminal and juxtamembrane
regulatory regions. In general, growth factor binding activates RTKs by inducing receptor
dimerization, (Ullrich, 1990). Further, extracellular matrix proteins and certain surface proteins
on neighboring cells can also bind to and activate RTKs. The down stream effect is:molecules
direct cell differentiation by determining patterns of gene transcription.
2.The dominant negative receptor mutants which atlow concentrations, are capable of blocking
the intracellular activity of wild type e.g estrogen receptor (ER) mutants as reported by(Ince,
1993). Such mutants are useful in studying the pathway of signal transduction after receptor
activation.
3. Allostery is the process by which biological macromolecules (mostly proteins) transmit the
effect of binding at one site to another, often distal, functional site, allowing for regulation of
activity. Hence by allostery the components of the signal transduction pathway may be inhibited
or activated depending on the status of the cell i.e. regulated
Solution
1. All RTKs have a similar molecular architecture, with a ligand-binding region in the
extracellular domain, a single transmembrane helix, and a cytoplasmic region that contains the
protein tyrosine kinase (TK) domain plus additional carboxy (C-) terminal and juxtamembrane
regulatory regions. In general, growth factor binding activates RTKs by inducing receptor
dimerization, (Ullrich, 1990). Further, extracellular matrix proteins and certain surface proteins
on neighboring cells can also bind to and activate RTKs. The down stream effect is:molecules
direct cell differentiation by determining patterns of gene transcription.
2.The dominant negative receptor mutants which atlow concentrations, are capable of blocking
the intracellular activity of wild type e.g estrogen receptor (ER) mutants as reported by(Ince,
1993). Such mutants are useful in studying the pathway of signal transduction after receptor
activation.
3. Allostery is the process by which biological macromolecules (mostly proteins) transmit the
effect of binding at one site to another, often distal, functional site, allowing for regulation of
activity. Hence by allostery the components of the signal transduction pathway may be inhibited
or activated depending on the status of the cell i.e. regulated.
1)we can see the universe mostly in the form hydrogen and helium. .pdf
1)
we can see the universe mostly in the form hydrogen and helium. So it is protonic.
2)
a) Light from when the Universe became transparent very soon after the Big bang.
3)
The cosmological principle limits the faintness of distant objects.
4)
These group elementys are made by adding oxygen nuclei which is the third most commen
element in the universe.
Solution
1)
we can see the universe mostly in the form hydrogen and helium. So it is protonic.
2)
a) Light from when the Universe became transparent very soon after the Big bang.
3)
The cosmological principle limits the faintness of distant objects.
4)
These group elementys are made by adding oxygen nuclei which is the third most commen
element in the universe..
1)D. Bacteria.2)B. Nuclear envelope3)A. Similar in function and .pdf
1)D. Bacteria.
2)B. Nuclear envelope
3)A. Similar in function and evolved independently.
4)B. Prezygotic isolating mechanism.
Solution
1)D. Bacteria.
2)B. Nuclear envelope
3)A. Similar in function and evolved independently.
4)B. Prezygotic isolating mechanism..
1) Pen R contains penicillin resistance gene .Usually + or - is not .pdf
1) Pen R contains penicillin resistance gene .Usually + or - is not denoted for antibiotics.
therefore the answer is option e.
2) a) conjugation is the exchange of genetic material by cell-cell contact via sex-pili.
3)a) High-Frequency recombination bacteria have F plasmid integrated into its chromosome and
transfers part of the chromosome along with F+ gene ,thereby resulting in F\' cells.
4) e) an F\' lac- E.coli when mates with F- Lac cell, the result will be F+, Lac-(from F\'),
Lac+(already present in recipient cell)
5) a) true, transformation is the transfer of an exogenous genetic material(DNA).
Solution
1) Pen R contains penicillin resistance gene .Usually + or - is not denoted for antibiotics.
therefore the answer is option e.
2) a) conjugation is the exchange of genetic material by cell-cell contact via sex-pili.
3)a) High-Frequency recombination bacteria have F plasmid integrated into its chromosome and
transfers part of the chromosome along with F+ gene ,thereby resulting in F\' cells.
4) e) an F\' lac- E.coli when mates with F- Lac cell, the result will be F+, Lac-(from F\'),
Lac+(already present in recipient cell)
5) a) true, transformation is the transfer of an exogenous genetic material(DNA)..
UV radiation has shorter wavelength than visible .pdf
UV radiation has shorter wavelength than visible light
Solution
UV radiation has shorter wavelength than visible light.
(1) CA genetic model organism needs to have all the above features.pdf
(1) C
A genetic model organism needs to have all the above features to facilitate the genetic research
on it, like small genome, short generation time, large number of progeny, should adapt to lab
environment, propagation and maintaining them should be inexpensive.
(2) B
On chromosomes, we can find genes and these are nothing but long pieces of DNA associated
with histone. For every gene we will have two alleles and will be located on different
chromosomes but at the same place or loci and these are an alternate form of a gene.
(3) D
Blending inheritance theory is considered as the current theory of genetic inheritance as it states
that the egg and sperm from two parents will combine to form zygote and here the genetic
material from both parents will blend and will have an influence on genetic makeup of the
developing of offspring.
(4) C
C. elegans is traditionally considered as a classical genetic organism and it has been used to
study the gene function and variety mutagens were used on it to study the effect of different
mutations and their effect on protein function.
(5) A.
The number of chromosomes will be the same in the G1 phase, but in S phase only the number
of chromatids will double in its number.
Solution
(1) C
A genetic model organism needs to have all the above features to facilitate the genetic research
on it, like small genome, short generation time, large number of progeny, should adapt to lab
environment, propagation and maintaining them should be inexpensive.
(2) B
On chromosomes, we can find genes and these are nothing but long pieces of DNA associated
with histone. For every gene we will have two alleles and will be located on different
chromosomes but at the same place or loci and these are an alternate form of a gene.
(3) D
Blending inheritance theory is considered as the current theory of genetic inheritance as it states
that the egg and sperm from two parents will combine to form zygote and here the genetic
material from both parents will blend and will have an influence on genetic makeup of the
developing of offspring.
(4) C
C. elegans is traditionally considered as a classical genetic organism and it has been used to
study the gene function and variety mutagens were used on it to study the effect of different
mutations and their effect on protein function.
(5) A.
The number of chromosomes will be the same in the G1 phase, but in S phase only the number
of chromatids will double in its number..
The relation in partSolution The relation in part.pdf
The relation in part
Solution
The relation in part.
Step1 Concentration of hydroxide ion = 2x.00500=..pdf
Step1 Concentration of hydroxide ion = 2x.00500=.01000 Step2 pOH= -log[OH-]
=-log[.01] =2 Step3 pH= 14-pOH= 14-2=12
Solution
Step1 Concentration of hydroxide ion = 2x.00500=.01000 Step2 pOH= -log[OH-]
=-log[.01] =2 Step3 pH= 14-pOH= 14-2=12.
molality = (11258.5)1 = 1.914 m Percent mass =.pdf
molality = (112/58.5)/1 = 1.914 m Percent mass = 112/(112+ 1000) x100 = 10.07
%
Solution
molality = (112/58.5)/1 = 1.914 m Percent mass = 112/(112+ 1000) x100 = 10.07
%.
NADPH is a reducing agent that act as an electron.pdf
NADPH is a reducing agent that act as an electron donor and frequently as a
biochemical source of hydride (H-). so in the last step ketogroup reduce to alcohol with NADPH
(ketogroup to alcohol).
Solution
NADPH is a reducing agent that act as an electron donor and frequently as a
biochemical source of hydride (H-). so in the last step ketogroup reduce to alcohol with NADPH
(ketogroup to alcohol)..
moleculesions geometry hybridization ClF3 T-shap.pdf
molecules/ions geometry hybridization ClF3 T-shape sp3d AsF5 trigonal
bipyramidal sp3d ClF2+ V-shape sp3 AsF6- octahedral sp3d2
Solution
molecules/ions geometry hybridization ClF3 T-shape sp3d AsF5 trigonal
bipyramidal sp3d ClF2+ V-shape sp3 AsF6- octahedral sp3d2.
The major shortcoming was that the electrons were.pdf
The major shortcoming was that the electrons were thought to have fixed orbits like
planets around the sun. Now they are thought to occupy orbitals and have probabilities for being
within given distances from the nucleus. The orbitals (solutions to the Schroedinger Equation)
have shapes like hourglasses, spheres, hollowed out spheres, and more complicated shapes. As a
very distant side note Prof Carlos Stroud at the University of Rochester was able to excite atoms
and put their electrons into orbits much like those predicted by the Rutherford Model.
Solution
The major shortcoming was that the electrons were thought to have fixed orbits like
planets around the sun. Now they are thought to occupy orbitals and have probabilities for being
within given distances from the nucleus. The orbitals (solutions to the Schroedinger Equation)
have shapes like hourglasses, spheres, hollowed out spheres, and more complicated shapes. As a
very distant side note Prof Carlos Stroud at the University of Rochester was able to excite atoms
and put their electrons into orbits much like those predicted by the Rutherford Model..
The ball is an atom, the stick is a bond. You pu.pdf
The ball is an atom, the stick is a bond. You put a stick into two balls to signify a
bond between two atoms
Solution
The ball is an atom, the stick is a bond. You put a stick into two balls to signify a
bond between two atoms.
The anion is a good leaving group because it is p.pdf
The anion is a good leaving group because it is probably the most negative of the
anion. I assume the Xs represent an electronegative atom such as oxygen; therefore, it would
have the greatest repulision force (because it has so many electrons). Thus, it but be beneficial if
the most negative anion (the one with the most electrons) left because it would allow the
molecule to be under less stress and allow the remaining anions to spread out more (spread out
more spatially around the central C atom) (On the really long molecule with the bunch of Me
atoms) The most acidic hydrogen would be the one hanging off the second N from the left (it has
a think line pointing from the H to the N). It is the most acidic because the N is very
electronegative (more so than the carbons found in other molecules). The O atom is more
electronegative but it cannot lose the H because the OH is a polyatomic ion...u cannot split them
up! Thus the H hanging of the N is the most acidic!
Solution
The anion is a good leaving group because it is probably the most negative of the
anion. I assume the Xs represent an electronegative atom such as oxygen; therefore, it would
have the greatest repulision force (because it has so many electrons). Thus, it but be beneficial if
the most negative anion (the one with the most electrons) left because it would allow the
molecule to be under less stress and allow the remaining anions to spread out more (spread out
more spatially around the central C atom) (On the really long molecule with the bunch of Me
atoms) The most acidic hydrogen would be the one hanging off the second N from the left (it has
a think line pointing from the H to the N). It is the most acidic because the N is very
electronegative (more so than the carbons found in other molecules). The O atom is more
electronegative but it cannot lose the H because the OH is a polyatomic ion...u cannot split them
up! Thus the H hanging of the N is the most acidic!.
More from anurag1231 (20)
a. The alleles are as followsaa - AlbinismAa AA - Normal pigm.pdf
a. The alleles are as followsaa - AlbinismAa AA - Normal pigm.pdf
49) sensation is what we receive through senses and perception is wh.pdf
49) sensation is what we receive through senses and perception is wh.pdf
1. INTRODUCTIONWe are currently living in the so-called informatio.pdf
1. INTRODUCTIONWe are currently living in the so-called informatio.pdf
1. d.) Organisms using oxygenic photosynthesis release oxygen into t.pdf
1. d.) Organisms using oxygenic photosynthesis release oxygen into t.pdf
1. All RTKs have a similar molecular architecture, with a ligand-bin.pdf
1. All RTKs have a similar molecular architecture, with a ligand-bin.pdf
1)we can see the universe mostly in the form hydrogen and helium. .pdf
1)we can see the universe mostly in the form hydrogen and helium. .pdf
1)D. Bacteria.2)B. Nuclear envelope3)A. Similar in function and .pdf
1)D. Bacteria.2)B. Nuclear envelope3)A. Similar in function and .pdf
1) Pen R contains penicillin resistance gene .Usually + or - is not .pdf
1) Pen R contains penicillin resistance gene .Usually + or - is not .pdf
UV radiation has shorter wavelength than visible .pdf
UV radiation has shorter wavelength than visible .pdf
(1) CA genetic model organism needs to have all the above features.pdf
(1) CA genetic model organism needs to have all the above features.pdf
The relation in partSolution The relation in part.pdf
The relation in partSolution The relation in part.pdf
Step1 Concentration of hydroxide ion = 2x.00500=..pdf
Step1 Concentration of hydroxide ion = 2x.00500=..pdf
molality = (11258.5)1 = 1.914 m Percent mass =.pdf
molality = (11258.5)1 = 1.914 m Percent mass =.pdf
NADPH is a reducing agent that act as an electron.pdf
NADPH is a reducing agent that act as an electron.pdf
moleculesions geometry hybridization ClF3 T-shap.pdf
moleculesions geometry hybridization ClF3 T-shap.pdf
The major shortcoming was that the electrons were.pdf
The major shortcoming was that the electrons were.pdf
The ball is an atom, the stick is a bond. You pu.pdf
The ball is an atom, the stick is a bond. You pu.pdf
The anion is a good leaving group because it is p.pdf
The anion is a good leaving group because it is p.pdf
Recently uploaded
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdfFundacja Rozwoju Społeczeństwa Przedsiębiorczego
Wolontariat grupowyThe French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Template Jadual Bertugas Kelas (Boleh Edit)
Jadual Bertugas kelas dalam bentuk softcopy PowerPoint. Cikgu boleh download >> edit >> print >> laminate. Semoga bermanfaat.
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Sectors of the Indian Economy - Class 10 Study Notes pdf
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
How to Split Bills in the Odoo 17 POS Module
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
Recently uploaded (20)
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Sectors of the Indian Economy - Class 10 Study Notes pdf
Sectors of the Indian Economy - Class 10 Study Notes pdf
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Basic phrases for greeting and assisting costumers
Basic phrases for greeting and assisting costumers
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
AnswerNote Provided code shows several bugs, hence I implemented.pdf
- 1. Answer: Note: Provided code shows several bugs, hence I implemented a separate code as per the given program specifications Program code: import java.util.Scanner; //declares fraction class class Fraction { //private data members for the class private int numerators,denominators; //default constructor public Fraction() { } //parameterised constructor for the class public Fraction(int numerators, int denominators) { //assigns numerator this.numerators = numerators; //checks the denominator if(denominators == 0) { System.out.println("denominator Shouldn't be ZERO "); System.out.println("Program Exiting....."); System.exit(0); } this.denominators = denominators; } //parameterised constructor public Fraction(int numerators) { this.numerators = numerators; } //method TO string public String toString()
- 2. { return ""+numerators+" / "+denominators; } //methods Equals() @Override public boolean equals(Object obj) { if (obj == null) { return false; } if (getClass() != obj.getClass()) { return false; } final Fraction other = (Fraction) obj; if (this.numerators != other.numerators) { return false; } if (this.denominators != other.denominators) { return false; } return true; } //method GCD declaration public int GCD(int a, int b) { //declares local variables int x = 0, GCD = 0; int max = a > b ? a : b; int min = a < b ? a : b; for(int i = 1; i <= min; i++) { x = max * i; if(x % min == 0) { GCD = x; break; }
- 3. } //returns GCD return GCD; } //Method to read public static Fraction read() { Scanner sc1 = new Scanner(System.in); System.out.print("Enter Fraction numerators : "); int num1 = sc1.nextInt(); System.out.print("Enter Fraction denominators : "); int den1 = sc1.nextInt(); System.out.println(); Fraction f1 = new Fraction(num1,den1); return f1; } //Method definition to add() public Fraction add(Fraction other1) { int GCD = GCD(this.denominators,other.denominators); int numb1 = this.numerators * (GCD/this.denominators); int numb2 = other1.numerators *(GCD/other.denominators); int num1 = 0, den1 = 0; num1 = numb1 + numb2; den1 = GCD; return new Fraction(num1,den1); } //method definition to add() public Fraction add(int temp1) { //defines the number variable int num1 = this.denominators * temp1 + this.numerators; return new Fraction(num1,this.denominators); } //method definition to subract public Fraction subtract(Fraction other1)
- 4. { int GCD = GCD(this.denominators,other.denominators); int numb1 = this.numerators *(GCD/this.denominators); int numb2 = other1.numerators *(GCD/other1.denominators); int num1 = 0, den1 = 0; num1 = numb1 - numb2; den1 = GCD; return new Fraction(num1,den1); } //Method definition to multiply public Fraction multiply(Fraction other1) { int num1 = 0, den1 = 0; num1 = this.numerators * other1.numerators; den1 = this.denominators * other1.denominators; return new Fraction(num1,den1); } //method definition to Multiply public Fraction multiply(int temp1) { int num 1= this.numerators * temp1; return new Fraction(num1,this.denominators); } //method definition to Divide public Fraction divide(Fraction other1) { int num1 = 0, den1 = 0; num1 = this.numerators * other1.denominators; den1 = this.denominators * other1.numerators; return new Fraction(num1,den1); } //method definition to reciprocal public Fraction reciprocal() { return new Fraction(this.denominators,this.numerators); }
- 5. } //main class declaration public class FractionDemoSimpleClass { //main program for the class public static void main (String[] args) { //declares object for the class Fraction rr1 = Fraction.read(); Fraction rr2 = Fraction.read(); //declares instance for the class Fraction rr3, rr4, rr5, rr6, rr7, rr8, rr9; //prints the result System.out.println (" First fraction number: " + rr1); System.out.println ("Second fraction number: " + rr2); if (rr1.equals(rr2)) System.out.println (" rr1 and rr2 are equal."); else System.out.println (" rr1 and rr2 are NOT equal."); rr3 = rr2.reciprocal(); System.out.println (" The reciprocal of rr2 is: " + rr3); //calls add() rr4 = rr1.add(rr2); //calls subtract() rr5 = rr1.subtract(rr2); //calls multiply() rr6 = rr1.multiply(rr2); //calls divide() rr7 = rr1.divide(rr2); //calls add() rr8 = rr1.add(5); //calls multiply() rr9 = rr1.multiply(5); System.out.println (); System.out.println ("rr1 + rr2: " + rr4); System.out.println ("rr1 - rr2: " + rr5);
- 6. System.out.println ("rr1 * rr2: " + rr6); System.out.println ("rr1 / rr2: " + rr7); System.out.println ("rr1 + 5: " + rr8); System.out.println ("rr1 * 5: " + rr9); } } Sample Output: C:jdk1.6bin>javac FractionDemoSimpleClass.java C:jdk1.6bin>java FractionDemoSimpleClass Enter Fraction numerators : 1 Enter Fraction denominators : 2 Enter Fraction numerators : 2 Enter Fraction denominators : 3 First fraction number: 1 / 2 Second fraction number: 2 / 3 rr1 and rr2 are NOT equal. The reciprocal of rr2 is: 3 / 2 rr1 + rr2: 7 / 6 rr1 - rr2: -1 / 6 rr1 * rr2: 2 / 6 rr1 / rr2: 3 / 4 rr1 + 5: 11 / 2 rr1 * 5: 5 / 2 C:jdk1.6bin> Solution Answer: Note: Provided code shows several bugs, hence I implemented a separate code as per the given program specifications Program code: import java.util.Scanner; //declares fraction class class Fraction { //private data members for the class
- 7. private int numerators,denominators; //default constructor public Fraction() { } //parameterised constructor for the class public Fraction(int numerators, int denominators) { //assigns numerator this.numerators = numerators; //checks the denominator if(denominators == 0) { System.out.println("denominator Shouldn't be ZERO "); System.out.println("Program Exiting....."); System.exit(0); } this.denominators = denominators; } //parameterised constructor public Fraction(int numerators) { this.numerators = numerators; } //method TO string public String toString() { return ""+numerators+" / "+denominators; } //methods Equals() @Override public boolean equals(Object obj) { if (obj == null) { return false; } if (getClass() != obj.getClass()) {
- 8. return false; } final Fraction other = (Fraction) obj; if (this.numerators != other.numerators) { return false; } if (this.denominators != other.denominators) { return false; } return true; } //method GCD declaration public int GCD(int a, int b) { //declares local variables int x = 0, GCD = 0; int max = a > b ? a : b; int min = a < b ? a : b; for(int i = 1; i <= min; i++) { x = max * i; if(x % min == 0) { GCD = x; break; } } //returns GCD return GCD; } //Method to read public static Fraction read() { Scanner sc1 = new Scanner(System.in); System.out.print("Enter Fraction numerators : "); int num1 = sc1.nextInt();
- 9. System.out.print("Enter Fraction denominators : "); int den1 = sc1.nextInt(); System.out.println(); Fraction f1 = new Fraction(num1,den1); return f1; } //Method definition to add() public Fraction add(Fraction other1) { int GCD = GCD(this.denominators,other.denominators); int numb1 = this.numerators * (GCD/this.denominators); int numb2 = other1.numerators *(GCD/other.denominators); int num1 = 0, den1 = 0; num1 = numb1 + numb2; den1 = GCD; return new Fraction(num1,den1); } //method definition to add() public Fraction add(int temp1) { //defines the number variable int num1 = this.denominators * temp1 + this.numerators; return new Fraction(num1,this.denominators); } //method definition to subract public Fraction subtract(Fraction other1) { int GCD = GCD(this.denominators,other.denominators); int numb1 = this.numerators *(GCD/this.denominators); int numb2 = other1.numerators *(GCD/other1.denominators); int num1 = 0, den1 = 0; num1 = numb1 - numb2; den1 = GCD; return new Fraction(num1,den1); } //Method definition to multiply
- 10. public Fraction multiply(Fraction other1) { int num1 = 0, den1 = 0; num1 = this.numerators * other1.numerators; den1 = this.denominators * other1.denominators; return new Fraction(num1,den1); } //method definition to Multiply public Fraction multiply(int temp1) { int num 1= this.numerators * temp1; return new Fraction(num1,this.denominators); } //method definition to Divide public Fraction divide(Fraction other1) { int num1 = 0, den1 = 0; num1 = this.numerators * other1.denominators; den1 = this.denominators * other1.numerators; return new Fraction(num1,den1); } //method definition to reciprocal public Fraction reciprocal() { return new Fraction(this.denominators,this.numerators); } } //main class declaration public class FractionDemoSimpleClass { //main program for the class public static void main (String[] args) { //declares object for the class Fraction rr1 = Fraction.read(); Fraction rr2 = Fraction.read();
- 11. //declares instance for the class Fraction rr3, rr4, rr5, rr6, rr7, rr8, rr9; //prints the result System.out.println (" First fraction number: " + rr1); System.out.println ("Second fraction number: " + rr2); if (rr1.equals(rr2)) System.out.println (" rr1 and rr2 are equal."); else System.out.println (" rr1 and rr2 are NOT equal."); rr3 = rr2.reciprocal(); System.out.println (" The reciprocal of rr2 is: " + rr3); //calls add() rr4 = rr1.add(rr2); //calls subtract() rr5 = rr1.subtract(rr2); //calls multiply() rr6 = rr1.multiply(rr2); //calls divide() rr7 = rr1.divide(rr2); //calls add() rr8 = rr1.add(5); //calls multiply() rr9 = rr1.multiply(5); System.out.println (); System.out.println ("rr1 + rr2: " + rr4); System.out.println ("rr1 - rr2: " + rr5); System.out.println ("rr1 * rr2: " + rr6); System.out.println ("rr1 / rr2: " + rr7); System.out.println ("rr1 + 5: " + rr8); System.out.println ("rr1 * 5: " + rr9); } } Sample Output: C:jdk1.6bin>javac FractionDemoSimpleClass.java C:jdk1.6bin>java FractionDemoSimpleClass Enter Fraction numerators : 1
- 12. Enter Fraction denominators : 2 Enter Fraction numerators : 2 Enter Fraction denominators : 3 First fraction number: 1 / 2 Second fraction number: 2 / 3 rr1 and rr2 are NOT equal. The reciprocal of rr2 is: 3 / 2 rr1 + rr2: 7 / 6 rr1 - rr2: -1 / 6 rr1 * rr2: 2 / 6 rr1 / rr2: 3 / 4 rr1 + 5: 11 / 2 rr1 * 5: 5 / 2 C:jdk1.6bin>