JAVA Write a class called F.pdf

•

0 likes•2 views

*****************JAVA********************** Write a class called Fraction, which can be used to store an exact fraction. It must have: - A field to store the numerator - A field to store the denominator - A toString method that returns a neatly formatted String representing the fraction - An equals method that compares itself to another Fraction - An add method that adds itself to another Fraction and returns a new Fraction - Appropriate constructor and accessors as needed Write a program that asks the user to enter the numerators and denominators of two fractions and create corresponding Fraction objects. Check for valid input and a 0 denominator. Then output both Fractions (using your toString method implicitly), whether they are equal, and their sum. Name your main class Hw6pr2 and your file Hw6pr2.java. Submit all .java files Solution import java.util.*; import java.io.*; public class Fraction { static Scanner console = new Scanner(System.in); public static void main(String[] args); private int numerator; private int denominator; System.out.println(\"Enter the denominator\"); System.out.flush(); while(console.hasNext()) { denominator = console.nextInt(); public String toString() { return (numerator + \" / \" + denominator); } public boolean equals(Fraction rightFr) { return(numerator * rightFr.denominator == denominator * rightFr.numerator); } public int compareTo(Fraction rightFr) { return(numerator * rightFr.denominator-denominator * rightFr.numerator); } public Fraction(int num, int deno) throws Exception { numerator = num; if(deno == 0) throw new Exception(\"denominator cannot be zero\"); else denominator = deno; } public Fraction() { numerator = 0; denominator = 1; } public void setFraction(int num, int deno) throws Exception { numerator = num; if(deno == 0) throw new Exception(\"denominator cannot be zero\"); else denominator = deno; } public Fraction add(Fraction rightFr) { Fraction temp = new Fraction(); temp.numerator = numerator * rightFr.denominator + rightFr.numerator * denominator; temp.denominator = denominator * rightFr.denominatior; return temp; } public Fraction multiply(Fraction rightFr) { Fraction temp = new Fraction(); temp.numerator = numerator * rightFr.numerator; temp.denominator = denominator * rightFr.denominator; return temp; } public Fraction subtract(Fraction rightFr) { Fraction temp = new Fraction(); temp.numerator = numerator * rightFr. denominator-rightFr.numerator * denominator; temp.denominator = denominator * rightFr.denominator; retrun temp; } Fraction divide(Fraction rightFr) throws Exception { Fraction temp = new Fraction(); if(rightFr.numerator == 0) throw new Exception(\"Cannot divide by zero\"); else{ temp.numerator = numerator * rightFr.denominator; temp.denominator = rightFr.numerator *denominator; return temp; } System.out.println(\" \"); System.out.println(\" \" +(numerator + denominator)); } }.

Education

$*****************JAVA********************** Write a class called Fraction, which can be used to store an exact fraction. It must have: - A field to store the numerator - A field to store the denominator - A toString method that returns a neatly formatted String representing the fraction - An equals method that compares itself to another Fraction - An add method that adds itself to another Fraction and returns a new Fraction - Appropriate constructor and accessors as needed Write a program that asks the user to enter the numerators and denominators of two fractions and create corresponding Fraction objects. Check for valid input and a 0 denominator. Then output both Fractions (using your toString method implicitly), whether they are equal, and their sum. Name your main class Hw6pr2 and your file Hw6pr2.java. Submit all .java files Solution import java.util.*; import java.io.*; public class Fraction { static Scanner console = new Scanner(System.in); public static void main(String[] args); private int numerator; private int denominator; System.out.println("Enter the denominator"); System.out.flush(); while(console.hasNext()) { denominator = console.nextInt(); public String toString() { return (numerator + " / " + denominator); } public boolean equals(Fraction rightFr) { return(numerator * rightFr.denominator == denominator * rightFr.numerator); } public int compareTo(Fraction rightFr)$

{
return(numerator * rightFr.denominator-denominator * rightFr.numerator);
}
public Fraction(int num, int deno) throws Exception
{
numerator = num;
if(deno == 0)
throw new Exception("denominator cannot be zero");
else
denominator = deno;
}
public Fraction()
{
numerator = 0;
denominator = 1;
}
public void setFraction(int num, int deno) throws Exception
{
numerator = num;
if(deno == 0)
throw new Exception("denominator cannot be zero");
else
denominator = deno;
}
public Fraction add(Fraction rightFr)
{
Fraction temp = new Fraction();
temp.numerator = numerator * rightFr.denominator + rightFr.numerator * denominator;
temp.denominator = denominator * rightFr.denominatior;
return temp;
}
public Fraction multiply(Fraction rightFr)
{
Fraction temp = new Fraction();
temp.numerator = numerator * rightFr.numerator;
temp.denominator = denominator * rightFr.denominator;

return temp;
}
public Fraction subtract(Fraction rightFr)
{
Fraction temp = new Fraction();
temp.numerator = numerator * rightFr. denominator-rightFr.numerator * denominator;
temp.denominator = denominator * rightFr.denominator;
retrun temp;
}
Fraction divide(Fraction rightFr) throws Exception
{
Fraction temp = new Fraction();
if(rightFr.numerator == 0)
throw new Exception("Cannot divide by zero");
else{
temp.numerator = numerator * rightFr.denominator;
temp.denominator = rightFr.numerator *denominator;
return temp;
}
System.out.println(" ");
System.out.println(" " +(numerator + denominator));
}
}

Similar to JAVA Write a class called F.pdf

How do I fix it in LinkedList.java? this is what i did LabProgram.java LinkedList.java: /** * Defines a doubly-linked list class * @author * @author */ import java.util.NoSuchElementException; public class LinkedList { private class Node { private T data; private Node next; private Node prev; public Node(T data) { this.data = data; this.next = null; this.prev = null; } } private int length; private Node first; private Node last; private Node iterator; /**** CONSTRUCTORS ****/ /** * Instantiates a new LinkedList with default values * @postcondition */ public LinkedList() { first = null; last = null; iterator = null; length = 0; } /** * Converts the given array into a LinkedList * @param array the array of values to insert into this LinkedList * @postcondition */ public LinkedList(T[] array) { } /** * Instantiates a new LinkedList by copying another List * @param original the LinkedList to copy * @postcondition a new List object, which is an identical, * but separate, copy of the LinkedList original */ public LinkedList(LinkedList original) { } /**** ACCESSORS ****/ public T getFirst() throws NoSuchElementException { if (isEmpty()){ throw new NoSuchElementException("The list is empty"); } return first.data; } public T getLast() throws NoSuchElementException { if (isEmpty()){ throw new NoSuchElementException("The list is empty"); } return last.data; } /** * Returns the data stored in the iterator node * @precondition * @return the data stored in the iterator node * @throw NullPointerException */ public T getIterator() throws NullPointerException { if (iterator != null){ return iterator.data; }else{ throw new NullPointerException("Iterator is off the end opf the list."); } } /** * Returns the current length of the LinkedList * @return the length of the LinkedList from 0 to n */ public int getLength() { return length; } /** * Returns whether the LinkedList is currently empty * @return whether the LinkedList is empty */ public boolean isEmpty() { return length == 0; } /** * Returns whether the iterator is offEnd, i.e. null * @return whether the iterator is null */ public boolean offEnd() { return iterator == null; } /**** MUTATORS ****/ public void addFirst(T data) { Node newNode = new Node(data); if(isEmpty()){ first = newNode; last = newNode; } else{ newNode.next = first; first.prev = newNode; first = newNode; } length++; } public void addLast(T data) { Node newNode = new Node(data); if(isEmpty()){ first = newNode; last = newNode; } else{ last.next = newNode; newNode.prev = last; last = newNode; } length++; } /** * Inserts a new element after the iterator * @param data the data to insert * @precondition * @throws NullPointerException */ public void addIterator(T data) throws NullPointerException{ if(iterator != null){ Node newNode = new Node(data); newNode.next = iterator.next; iterator.next = newNode; if (iterator == first){ first = newNode; } }else{ throw new NullPointerException("Iterator is off the end opf the list."); } } / public void remov.

How do I fix it in LinkedList.javathis is what i didLabProgra.pdf

mail931892

How do I fix it in LinkedList.java? LabProgram.java LinkedList.java: /** * Defines a doubly-linked list class * @author * @author */ import java.util.NoSuchElementException; public class LinkedList { private class Node { private T data; private Node next; private Node prev; public Node(T data) { this.data = data; this.next = null; this.prev = null; } } private int length; private Node first; private Node last; private Node iterator; /**** CONSTRUCTORS ****/ /** * Instantiates a new LinkedList with default values * @postcondition */ public LinkedList() { first = null; last = null; iterator = null; length = 0; } /** * Converts the given array into a LinkedList * @param array the array of values to insert into this LinkedList * @postcondition */ public LinkedList(T[] array) { } /** * Instantiates a new LinkedList by copying another List * @param original the LinkedList to copy * @postcondition a new List object, which is an identical, * but separate, copy of the LinkedList original */ public LinkedList(LinkedList original) { } /**** ACCESSORS ****/ public T getFirst() throws NoSuchElementException { if (isEmpty()){ throw new NoSuchElementException("The list is empty"); } return first.data; } public T getLast() throws NoSuchElementException { if (isEmpty()){ throw new NoSuchElementException("The list is empty"); } return last.data; } /** * Returns the data stored in the iterator node * @precondition * @return the data stored in the iterator node * @throw NullPointerException */ public T getIterator() throws NullPointerException { if (iterator != null){ return iterator.data; }else{ throw new NullPointerException("Iterator is off the end opf the list."); } } /** * Returns the current length of the LinkedList * @return the length of the LinkedList from 0 to n */ public int getLength() { return length; } /** * Returns whether the LinkedList is currently empty * @return whether the LinkedList is empty */ public boolean isEmpty() { return length == 0; } /** * Returns whether the iterator is offEnd, i.e. null * @return whether the iterator is null */ public boolean offEnd() { return iterator == null; } /**** MUTATORS ****/ public void addFirst(T data) { Node newNode = new Node(data); if(isEmpty()){ first = newNode; last = newNode; } else{ newNode.next = first; first.prev = newNode; first = newNode; } length++; } public void addLast(T data) { Node newNode = new Node(data); if(isEmpty()){ first = newNode; last = newNode; } else{ last.next = newNode; newNode.prev = last; last = newNode; } length++; } /** * Inserts a new element after the iterator * @param data the data to insert * @precondition * @throws NullPointerException */ public void addIterator(T data) throws NullPointerException{ if(iterator != null){ Node newNode = new Node(data); newNode.next = iterator.next; iterator.next = newNode; if (iterator == first){ first = newNode; } }else{ throw new NullPointerException("Iterator is off the end opf the list."); } } / public void removeFirst() throws NoS.

How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf

mail931892

C# labprograms

Jafar Nesargi

Digits.javapackage week04;import java.util.Scanner; public cla.pdf

annapurnnatextailes

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.

write the To Dos to get the exact outputNOte A valid Fraction .pdf

jyothimuppasani1

Assignment 6 as a reference public class ArrExample { private int[] arr; public ArrExample(int length) { this.arr = new int[length]; } public ArrExample(int[] arr) { this.arr = arr; } public void arrDisplay() { if (arr.length == 0) { System.out.println("{}"); } else { System.out.print("{"); System.out.print(arr[0]); for (int i = 1; i < arr.length; i++) { System.out.print("," + arr[i]); } System.out.println("}"); } } public int arrTot() { int total = 0; for (int i = 0; i < arr.length; i++) { total += arr[i]; } return total; } public int arrMax() { int maxSeen = arr.length == 0 ? 0 : arr[0]; for (int i = 1; i < arr.length; i++) { if (arr[i] > maxSeen) { maxSeen = arr[i]; } } return maxSeen; } public int arrMin() { int minSeen = arr.length == 0 ? 0 : arr[0]; for (int i = 1; i < arr.length; i++) { if (arr[i] < minSeen) { minSeen = arr[i]; } } return minSeen; } public int arrRange() { return arrMax() - arrMin(); } public double arrAverage() { return (double) arrTot() / arr.length; } public void arrClip(int clipValue) { for (int i = 0; i < arr.length; i++) { if (arr[i] > clipValue) { arr[i] = clipValue; } } } public int arrfindCount(int value) { int count = 0; for (int i = 0; i < arr.length; i++) { if (arr[i] == value) { count++; } } return count; } public static void testData() { int[] arr0 = { -2, -1 }; int[] arr1 = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; int[] arr2 = { 2, 4, 6, 8, 10, 12, 14, 16, 7, 6, 22, 8, 9, 16, 5, 2, 7, 8, 12, 2, 0, 14, 17, 19, 22 }; ArrExample A1 = new ArrExample(arr0); ArrExample A2 = new ArrExample(arr1); ArrExample A3 = new ArrExample(arr2); A1.arrDisplay(); A2.arrDisplay(); A3.arrDisplay(); System.out.println("Total of A1: " + A1.arrTot()); System.out.println("Total of A2: " + A2.arrTot()); } 1)a) This assignment builds on Assignment 6. In Assignment 6, your arrInt class always used a completely filled array. But what if you add values only one at a time, and dont know how many items you will have when you are done? In this assignment, you will create an array bffr without filling it right away. That means that you have an array but most of the values are meaningless zeroes. At the beginning, all of the values are meaningless zeroes. Only as you begin putting values into the array do some of the elements become meaningful. The important idea to capture, is that the size or capacity of the array, and the number of values in the array (or count), are two separate numbers. Start a project, as always. Create your main class with the same name as the project. Then create a new class called BffrIntFirstname (Use your first name ). The BffrIntFirstname class will have two private variables: an array of ints (private int bffr[];), and a count of the number of values that have been added, called count. The class should have two constructors. The constructor that takes no arguments should create an array of 8 ints (using a constant called BFFR_SZ) for initializing the array: bffr = new int[BFFR_SZ];. The other constructor takes an in.

Assignment 6 as a reference public class ArrExample pr.pdf

kksrivastava1

Modify the bouncing ball example demonstrated/tutorialoutlet

Cleasbyz

Need done for Date Structures please! 4.18 LAB: Sorted number list implementation with linked lists Step 1: Inspect the Node.h file Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking on the orange arrow next to main.cpp at the top of the coding window. The Node class has three member variables: a double data value, a pointer to the next node, and a pointer to the previous node. Each member variable is protected. So code outside of the class must use the provided getter and setter member functions to get or set a member variable. Node.h is read only, since no changes are required. Step 2: Implement the Insert() member function A class for a sorted, doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's Insert() member function. The function must create a new node with the parameter value, then insert the node into the proper sorted position in the linked list. Ex: Suppose a SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order and yielding: 23 35.5 47.25 86 Step 3: Test in develop mode Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList. The list is displayed after each insertion. Ex: If input is then output is: Try various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove() member function Implement the SortedNumberList class's Remove() member function. The function takes a parameter for the number to be removed from the list. If the number does not exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the number is removed from the list and true is returned. Uncomment the commented-out part in main() that reads a second input line and removes numbers from the list. Test in develop mode to ensure that insertion and removal both work properly, then submit code for grading. Ex: If input is then output is: main.cpp #include <iostream> #include <string> #include <vector> #include "Node.h" #include "SortedNumberList.h" using namespace std; void PrintList(SortedNumberList& list); vector<string> SpaceSplit(string source); int main(int argc, char *argv[]) { // Read the line of input numbers string inputLine; getline(cin, inputLine); // Split on space character vector<string> terms = SpaceSplit(inputLine); // Insert each value and show the sorted list's contents after each insertion SortedNumberList list; for (auto term : terms) { double number = stod(term); cout << "List after inserting " << number << ": " << endl; list.Insert(number); PrintList(list); } /* // Read the input line with numbers to remove getline(cin, inputLine); terms = SpaceSplit(inputLine); // Remove each value for (auto term : terms) { double number = stod(term); cout << "List after removing " << number << ": " << endl; list.Remove(number.

Need done for Date Structures please! 4-18 LAB- Sorted number list imp.pdf

info114

Write a program that mimics the operations of several vending machines. More specifically, the program simulates what happens when the user chooses one of the vending machines, inputs money and picks an item from the vending machine. Assume there are two vending machines: one for drinks and one for snacks. Each vending machine contains several items. The name, price, and quantity of each item is given in two text files; one named “drinks.txt” for the drinks vending machine and the other named “snacks.txt” for the snacks vending machine. The format of the input values is comma-separated. The items listed should be organized in the file with the following order: name, price, quantity. Here are some example items: The actual reading and parsing of the input file is already handled in the class supplied to you (see code on BlackBoard). You are given the variables as individual values. You will need to create the .txt files for creating and testing your vending machines. You will need to create/complete three classes for this homework assignment: Item, VendingMachine, and VendingMachineDriver. Problem Description Milk,2.00,1 Within your VendingMachine class, include these methods: VendingMachineThisconstructormethodwilltakeinthenameoftheinputfileand create a vending machine object. A vending machine object will contain an array of Item objects called stock and an amount of revenue earned. This constructor method has been completed for you and should work appropriately once you have completed the rest of this class and the other class definitions. vendThismethodwillsimulatethevendingtransactionafteravalidamountofmoney and an item selection are entered. This method will decide if the transaction is successful (enough money or item) and update the vending machine appropriately. outputMessage This method will print an appropriate message depending on the success of the transaction. If the user does not have enough money to buy the chosen item, the vending machine should prompt the user to enter more money or exit the machine. If the vending machine is out of the chosen item, the program will print an apology message and prompt the user to choose another item or exit the machine. If there is enough money for the item selected, then the vending machine will give the user the item and return the change. printMenuThismethodprintsthemenuofitemsforthechosenvendingmachine. The Item class needs to include the following data variables: • description as a String • price as a double • quantity as an int Within your VendingMachineDriver class, include a main method as the starting point for your solution that creates the vending machine objects appropriately and then use a loop that continues interacting with the vending machines until the user enters “X” to exit. See the sample session for details. As you implement your solution, you might find that some methods contain some repeated coding logic. To avoid unnecessary redundancies in your code, have these method.

Write a program that mimics the operations of several vending machin.pdf

eyebolloptics

Use the code below from the previous assignment that we need to extend just follow the instructions above. ***Make sure after you are done to show the output of your results*** main.cpp #include #include "Contact.h" int main() { // create Contact object using parameterized constructor Contact c1("Barbara", "Liskov", "Huberman", "404 Ridgeway Dr", "NC", "27403", "336-274- 3344"); // show contact details c1.showContact(); cout << endl; // create Contact object using default constructor Contact c2; // test the overloaded input and output operators cin >> c2; cout << endl; cout << c2; return 0; } Address.h #ifndef ADDRESS_H #define ADDRESS_H #include using namespace std; // create a class named Address class Address { private: // private instance variables string streetAddress, state, zip; public: // default constructor Address() { // initialize instance variables with empty strings streetAddress = ""; state = ""; zip = ""; } // parameterized constructor Address(string streetAddress, string state, string zip) { // initialize instance variables to given parameters this->streetAddress = streetAddress; this->state = state; this->zip = zip; } // copy constructor Address(const Address &a) { streetAddress = a.streetAddress; state = a.state; zip = a.zip; } // setters for all instance variables void setStreetAddress(string streetAddress) { this->streetAddress = streetAddress; } void setState(string state) { this->state = state; } void setZip(string zip) { this->zip = zip; } // getters for all instance variables string getStreetAddress() { return streetAddress; } string getState() { return state; } string getZip() { return zip; } // method to display the address void showAddress() { cout << streetAddress << "\n" << state << " " << zip << endl; } // declare the overloaded input and output operators friend ostream &operator<<(ostream &out, const Address &a); friend istream &operator>>(istream &in, Address &a); }; // define the overloaded output operator ostream &operator<<(ostream &out, const Address &a) { out << a.streetAddress << "\n" << a.state << " " << a.zip << endl; return out; } // define the overloaded input operator istream &operator>>(istream &in, Address &a) { cout << "Enter street address: "; getline(in, a.streetAddress); cout << "Enter state: "; getline(in, a.state); cout << "Enter zip: "; getline(in, a.zip); return in; } #endif Contact.h #ifndef CONTACT_H #define CONTACT_H #include #include "Name.h" #include "Address.h" using namespace std; // create a class named Contact class Contact { private: // private instance variables Name name; Address address; string phone; public: // default constructor Contact() { // initialize phone with empty string phone = ""; } // parameterized constructor Contact(string first_name, string last_name, string middle_name, string streetAddress, string state, string zip, string phone) { // initialize name and address to given strings setName(first_name, last_name, middle_name); setAddress(streetAddress, state, zip).

Use the code below from the previous assignment that we need to exte.pdf

sales87

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.

AnswerNote Provided code shows several bugs, hence I implemented.pdf

anurag1231

Java execise

Keneth miles

Author: Vladimir Khorikov www.eastbanctech.com With the advent of LINQ, C# has gotten a significant exposure to functional programming. However, functional programming in C# is not restricted to the use of extension methods, lambdas and immutable classes. There are a lot of practices that haven't been adopted as widely because there's not much of native language support for them in C#. Still, they can be extremely beneficial should you incorporate them into your day-to-day work. From this presentation you’ll learn: • The fundamental principles behind functional programming, • Why they are important, • How to apply them in practice.

Functional Programming with C#

EastBanc Tachnologies

Assignment is : \"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to include comments Use meaningful identifier names (constants where appropriate) Do not work together; no two people should have identical work!?!? Turn in .cpp file AND Turn in a \"print- screen\' of your output (press \"print-screen\' on keyboard, then \'paste\' in MS-Word)\" How do you solve QUESTION #5 in the book data structures using c++ by D.S. Malik in Visiual Studios using the linked list below with what is being asked? Please need help Linked list : #include #include using namespace std; struct nodeType { int info; nodeType *link; }; void createList(nodeType*& first, nodeType*& last); void printList(nodeType*& first); void insertFront(nodeType*& first); void insertBack(nodeType*& last); void deleteFirst(nodeType*& first); void deleteLast(nodeType*& last, nodeType* first); int main() { nodeType *first, *last; int num; createList(first, last); int choice; while(true) { cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\ \"; cout<<\"Enter your choice: \"; cin>>choice; switch(choice) { case 1: insertFront(first); break; case 2: insertBack(last); break; case 3: deleteFirst(first); break; case 4: deleteLast(last, first); break; case 5: printList(first); break; case 6: return 0; default: cout<<\"Invalid menu option. Try again.\"<>number; while (number != -999) { newNode = new nodeType; // create new node newNode->info = number; newNode->link = NULL; if (first == NULL) { first = newNode; last = newNode; } else { last->link = newNode; last = newNode; } cout<<\"Enter an integer (-999 to stop): \"; cin>>number; } // end of while-loop } // end of build list function void deleteFirst(nodeType*& first) { nodeType *temp; temp= first; first= temp->link; delete temp; return; } void deleteLast(nodeType*& last, nodeType* current) { nodeType *temp; while(current->link != NULL) { temp=current; current=current->link; } temp=last; current->link=NULL; delete temp; last = current; return; } void insertFront(nodeType*& front) { int num; cout<<\"\ Enter the number to insert: \"; cin>>num; nodeType *newNode = new nodeType; newNode->info=num; newNode->link= front; front= newNode; return; } void insertBack(nodeType*& last) { int num; cout<<\"\ Enter the number to insert: \"; cin>>num; nodeType *newNode = new nodeType; newNode->info=num; newNode->link= NULL; last->link= newNode; last = newNode; return; } void printList(nodeType*& first) { cout<<\"Inside printList...printing linked list...\ \"<info << \" \"; current = current->link; } cout< #include using namespace std; struct nodeType { int info; nodeType *link; }; void createList(nodeType*& first, nodeType*& last); void printList(nodeType*& first); void insertFront(nodeType*& first); void insertBack(nodeType*& last); void deleteFirst(nodeType*& first); void dele.

Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf

formicreation

In C++ please, do not alter node.hStep 1 Inspect the Node.h file.pdf

stopgolook

//operating system linux,ubuntu,Mac /*********************GeometricObject.java**********************/ public abstract class GeometricObject { private String color = \"white\"; private boolean filled; // default constructure public GeometricObject() { super(); // TODO Auto-generated constructor stub } // construct a Geometric Object // parameterized constructure public GeometricObject(String color, boolean filled) { this.color = color; this.filled = filled; } /** Getter method for color */ public String getColor() { return color; } /** Setter method for color */ public void setColor(String color) { this.color = color; } /** * Getter method for filled. Since filled is boolean, so the gret method * name is isFilled */ public boolean isFilled() { return filled; } /** Setter method for filled */ public void setFilled(boolean filled) { this.filled = filled; } /** Abstract method for FindArea */ public abstract double findArea(); /** Abstract method for findPerimeter */ public abstract double findPerimeter(); } /*****************************Octagon.java**************/ public class Octagon extends GeometricObject implements Cloneable, Comparable { private double side; /** construct a Octagon with specified side */ public Octagon(double side) { super(); this.side = side; } /** Implement the abstract method findArea in GeometricObject */ @Override public double findArea() { double area = (2 + 4 / Math.sqrt(2)) * side * side; return area; } /** Implement the abstract method findArea in findPerimeter */ @Override public double findPerimeter() { double perimeter = 8 * side; return perimeter; } /** Implement the compareTo method in Comparable interface */ @Override public int compareTo(Object o) { // TODO Auto-generated method stub return 0; } public Object clone() throws CloneNotSupportedException { return super.clone(); } } /*******************App.java*******************/ public class App { public static void main(String[] args) { Octagon a1 = new Octagon(5);//creating object of octagon System.out.println(\"Area of a1 is \" + a1.findArea()); System.out.println(\"Perimeter of a1 is \" + a1.findPerimeter()); Object a2; try { a2 = a1.clone(); String result = (a1.compareTo(a2) == 0) ? \"a1 and its clone a2 have the same area\" : \"a1 and its clone a2 have different areas\"; System.out.println(\"Compare a1 and its clone a2:\ \\t \" + result); System.out.println(\"Hashcode of a1: \" + a1.hashCode()); System.out.println(\"Hashcode of a2: \" + a2.hashCode()); System.out.println(\"Displaying a1: \" + a1); System.out.println(\"Displaying a2: \" + a2); } catch (CloneNotSupportedException e) { e.printStackTrace(); } } } /*****************output***************/ gopal@gopal:~/Desktop/chegg$ javac GeometricObject.java gopal@gopal:~/Desktop/chegg$ javac Octagon.java gopal@gopal:~/Desktop/chegg$ javac App.java gopal@gopal:~/Desktop/chegg$ java App Area of a1 is 120.71067811865476 Perimeter of a1 is 40.0 Compare a1 and its clone a2: a1 and its clone a2 have the same area .

operating system linux,ubuntu,Mac Geometri.pdf

aquadreammail

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.

When we test your Fraction.java we will use the given FractionTester.pdf

arihantkitchenmart

Main issues with the following code:Im not sure if its reading the file correctly because its adding all terms together. In other words the the first line of terms is adding the second line of terms but thats not my intention. Each line of term should have their own polynomial expression as shown below Basic specifications : The code should add the polynomial numbers using a linked list. Java . Keep in mind the polynomials will be gotten from a file. Things to keep in mind the list should be in decending order and traverse the list after all coefficient/exponent pair Term nodes from one input line have been inserted. Here are the specifications //The Polynomial class would likely have a single private data member (reference to class Term) called head. //The Term class would likely have three private data members (coefficient and exponent of type int) and next of type reference to Term. //The latter class would also have the following public methods: constructor(s), gets and sets for each data member, and perhaps a formatting method with the special output requirements. An example of input is 7 1 2 4 6 2 -3 2 -1 -1 3 Negative negative pair signals the termination ***NO doubly linked list , it should be a single linked list ** Input file contains the following : 7 1 2 4 6 2 -3 2 -1 -1 3 ----> 2x^4 - 3x^2 +6x^2 + 7x 5 1 2 3 6 0 -3 2 -1 -1 3 ----> 2*X^3 + (-3)*X^2 + 5*X + 6 // thats the ouput for one line of the the file , each line of the file should have one polynomial output Code import java.io.File; import java.io.FileNotFoundException; import java.util.Scanner; public class Polynomial { private Term head; // Constructor for creating an empty polynomial object public Polynomial() { head = null; } // Method for adding a term to the polynomial, this is inside the polynomial term public void addTerm(int coefficient, int exponent) { // Create a new term object Term newTerm = new Term(coefficient, exponent); // If the polynomial is empty, set the new term as the head if (head == null) { head = newTerm; } else { // Traverse the polynomial until we find the correct position for the new term Term current = head; Term previous = null; while (current != null && current.getExponent() > exponent) { previous = current; current = current.getNext(); } // If a term with the same exponent already exists, add the coefficients if (current != null && current.getExponent() == exponent) { current.setCoefficient(current.getCoefficient() + coefficient); } else { // Otherwise, insert the new term into the polynomial if (previous == null) { head = newTerm; } else { previous.setNext(newTerm); } newTerm.setNext(current); } } // Method for formatting the polynomial as a string public String toString() { StringBuilder sb = new StringBuilder(); if (head != null) { sb.append(head.toString()); Term current = head.getNext(); while (current != null) { if (current.getCoefficient() > 0) { sb.append(" + "); } else { sb.append(" - "); } sb.append(current.toString()); current = cur.

Main issues with the following code-Im not sure if its reading the fil.pdf

aonesalem

Lezione03

robynho86

Lezione03

robynho86

Similar to JAVA Write a class called F.pdf (20)

How do I fix it in LinkedList.javathis is what i didLabProgra.pdf

How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf

C# labprograms

Digits.javapackage week04;import java.util.Scanner; public cla.pdf

write the To Dos to get the exact outputNOte A valid Fraction .pdf

Assignment 6 as a reference public class ArrExample pr.pdf

Modify the bouncing ball example demonstrated/tutorialoutlet

Need done for Date Structures please! 4-18 LAB- Sorted number list imp.pdf

Write a program that mimics the operations of several vending machin.pdf

Use the code below from the previous assignment that we need to exte.pdf

AnswerNote Provided code shows several bugs, hence I implemented.pdf

Java execise

Functional Programming with C#

Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf

In C++ please, do not alter node.hStep 1 Inspect the Node.h file.pdf

operating system linux,ubuntu,Mac Geometri.pdf

When we test your Fraction.java we will use the given FractionTester.pdf

Main issues with the following code-Im not sure if its reading the fil.pdf

Lezione03

More from santanadenisesarin13

What does it mean by mRNA coded for by the Operon? What does it mean by mRNA coded for by the Operon? Solution operons are the functional unit of geonomic DNA containg a cluster of genes under the control of a singale promoter, the genes are transcripted together into an mRNA strand and either translated together in the cytoplasam,\'several genes must be co transcipted to define an operon, operons are mainly exist in the prokaryotes and first operons are in eukarytes in 1990, one of main code in the operons is mRNA is mainly trnaslate the messages.

What does it mean by mRNA coded for by the Operon What does it.pdf

JAVA Write a class called F.pdf

Recommended

Recommended

More Related Content

Similar to JAVA Write a class called F.pdf

Similar to JAVA Write a class called F.pdf (20)

More from santanadenisesarin13

More from santanadenisesarin13 (20)

Recently uploaded

Recently uploaded (20)

JAVA Write a class called F.pdf