Hi there, I need help with my multiply(), devide() and mod() methods below: The
ID: 3545211 • Letter: H
Question
Hi there, I need help with my multiply(), devide() and mod() methods below:
The program's goal is to do these operation using relly big numbers.
I provide further instruction throughout the code. So paste it in your java editor program. (e.g eclipse).
import java.util.*;
public class NumberOperations {
public static void main(String[] args){
ArrayList<Integer> biggerNumber = new ArrayList<Integer>();
ArrayList<Integer> smallerNumber = new ArrayList<Integer>();
ArrayList<Integer> operatedNumber = new ArrayList<Integer>();
String num1 = "123456789101112"; //just assume, num1 its always going to be bigger.
String num2 = "12345678910"; // and num2 is always the smaller.
//and that they are always positive.
for(int i = num1.length() -1; i>= 0; i --){
char nu1 = num1.charAt(i);
String numberString1 = ""+nu1;
biggerNumber.add(Integer.parseInt(numberString1));
}
for(int i = num2.length() -1; i>= 0; i --){
char nu2 = num2.charAt(i);
String numberString2 = ""+nu2;
smallerNumber.add(Integer.parseInt(numberString2));
}
// also, assume that the bigger number is always first in parameters
// and smaller number is second in parameters
operatedNumber = multiply(biggerNumber, smallerNumber);
System.out.println("Multiplication of numbers: " + operatedNumber);
operatedNumber = devide(biggerNumber, smallerNumber);
System.out.println("Division of numbers: " + operatedNumber);
operatedNumber = mod(biggerNumber, smallerNumber);
System.out.println("Mod of numbers: " + operatedNumber);
}
//It should look like this:
public static ArrayList<Integer> multiply(ArrayList<Integer> bigger, ArrayList<Integer> smaller){
ArrayList<Integer> multipliedNumber = new ArrayList<Integer>();
...
...
...
return multipliedNumber;
}
//It should look like this:
public static ArrayList<Integer> devide(ArrayList<Integer> bigger, ArrayList<Integer> smaller){
ArrayList<Integer> devidedNumber = new ArrayList<Integer>();
...
...
...
return devidedNumber;
}
//I also need a method that returns the mod of two numbers.
//This is basically is the same as devision() method except that it returns the mod.
public static ArrayList<Integer> mod(ArrayList<Integer> bigger, ArrayList<Integer> smaller){
ArrayList<Integer> modOfNumbers = new ArrayList<Integer>();
...
...
...
return modOfNumbers;
}
}
Explanation / Answer
This is the program as you asked. Plug in the class ArrayList.
import java.util.*;
public class NumberOperations
{
public static void main(String[] args){
ArrayList biggerNumber = new ArrayList();
ArrayList smallerNumber = new ArrayList();
ArrayList operatedNumber = new ArrayList();
String num1 = "123456789101112";
String num2 = "12345678910";
for(int i = num1.length() -1; i>= 0; i--)
{
char nu1 = num1.charAt(i);
String numberString1 = ""+nu1;
biggerNumber.add(Integer.parseInt(numberString1));
}
for(int i = num2.length() -1; i>= 0; i --)
{
char nu2 = num2.charAt(i);
String numberString2 = ""+nu2;
smallerNumber.add(Integer.parseInt(numberString2));
}
operatedNumber = multiply(biggerNumber, smallerNumber);
System.out.println("Multiplication of numbers: " + operatedNumber);
operatedNumber = devide(biggerNumber, smallerNumber);
System.out.println("Division of numbers: " + operatedNumber);
operatedNumber = mod(biggerNumber, smallerNumber);
System.out.println("Mod of numbers: " + operatedNumber);
}
public static ArrayList multiply(ArrayList bigger, ArrayList smaller)
{
ArrayList multipliedNumber = new ArrayList();
int n = bigger.length();
for(i=0;i<n;i++)
{
multipliednumber = 10*i*ArrayList.num(i)*smaller + multipliednumber;
}
return multipliedNumber;
}
public static ArrayList devide(ArrayList bigger, ArrayList smaller)
{
ArrayList devidedNumber = new ArrayList();
int n = bigger.length();
for(i=0;i<n;i++)
{
devidedNumber = 10*i*ArrayList.num(i)/smaller + multipliednumber;
}
return devidedNumber;
return devidedNumber;
}
public static ArrayList mod(ArrayList bigger, ArrayList smaller)
{
ArrayList modOfNumbers = new ArrayList();
int n = bigger.length();
for(i=0;i<n;i++)
{
modOfNumbers = 10*i*ArrayList.num(i)%smaller + multipliednumber;
}
return modOfNumbers;
}
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.