Question

In this assignment, you are asked to implement a Java class named HugeInt for storing huge integers and performing mathematical operations on them. This class must have a private variable of type LinkedList〈Byte〉 which stores digits of a huge integer and ten of the following public methods (choose ten methods out of 12):

1. public void setValue (int value): gets an integer (like 1234) as input parameter and stores its digits in the linked list in the same order as they appear in the input integer; e.g. for input equal to 1234, digit 1 is placed at the beginning of the list; while digit 4 is the placed at the end.

2. public void setValue (long value): Same as previous method; except the input type is long integer.

3. public int getValue (): returns −1 if the number stored in the linked list is too large to be fit in a Java int variable and returns the integer value of the stored number otherwise.

4. public HugeInt clone (): creates a copy of the integer stored in the linked list and returns the result as another HugeInt.

5. public long log (): counts and returns the number of digits stored in the linked list.

6. public HugeInt modExp (long n): calculates the remainder of the stored integer when

   dividing it by 10n and returns the result in the form of another HugeInt.

7. public HugeInt quotientExp (long n): calculates the quotient of the integer stored in the linked list when dividing it by 10n and returns the result in the form of another HugeInt.

8. public HugeInt timesExp (long n): calculate the product of 10n and the integer stored in the linked lists and returns the result in the form of another HugeInt.

9. public HugeInt add (HugeInt h): adds h with the integer stored in the linked list and returns the result as another HugeInt.

10. public void addSet (HugeInt h): adds h with the integer stored in the linked list and writes the result back on the linked list.

1

11. public int recursiveModNine (): returns the remainder of the integer stored in the linked list when dividing it by 9. The easiest way to find the remainder of an integer like 235 when dividing it by nine is to calculate the remainder of 2+3+5 instead. Use this idea to implement recursiveModNine method in a recursive manner. Method recur- siveModNine must be able to calculate the remainder of a huge integer like 1011111 − 1 when dividing it by 9. For example, recursiveModNine (1011111 − 1) first sums the digits of the input integer and then calls itself for the calculated sum. It does the same operations recursively until it reaches a one-digit integer. See below for details:

recursiveModeNine (1011111 − 1) =recursiveModeNine (99 . . . 9)? ?? ?

11111 times =recursiveModeNine (99999)

=recursiveModeNine (45) =recursiveModeNine (9) =0;

12. public int recursiveModThree (): returns the remainder of the integer stored in the linked list when dividing it by 3. To implement this method, use the same idea men- tioned for the previous method.

Submissions

You need to submit a .zip file compressing the Java source file(s) of your program (.javafiles).

2

Answer 1

HugeInt Class

import java.util.LinkedList;

import java.lang.Math.*;

public class HugeInt{

private LinkedList<Integer> list = new LinkedList<>();

public LinkedList<Integer> getList() {
   return list;
}

public void setList(LinkedList<Integer> list) {
   this.list = list;
}

/*gets an integer (like 1234) as input parameter and stores its digits in the linked list
* in the same order as they appear in the input integer; e.g. for input equal to 1234,
*/
public void setValue(int value) {
  
   String str = Integer.toString(value);
  
   int length = str.length();
  
   int i =0;
  
   this.list.clear();
  
   while(i<length) {
      
       this.list.add(Character.getNumericValue(str.charAt(i)));
       i++;
      
   }
  
}

/*gets an long (like 1234) as input parameter and stores its digits in the linked list
* in the same order as they appear in the input long; e.g. for input equal to 1234,
*/

public void setValue(long value) {
  
   String str =Long.toString(value);
  
   int length = str.length();
  
   int i =0;
  
   this.list.clear();
  
   while(i<length) {
      
       this.list.add(Character.getNumericValue(str.charAt(i)));
       i++;
      
   }
  
}

/* This Method will return the long from the digits stored in linkedlist */

public long getInteger() {
  
   int len = this.list.size();
   long num = 0;
   int i=0;
  
   while(i<len) {
      
       num = num + (long)(this.list.get(i)*Math.pow(10,len-i-1));
       i++;
      
   }
   return num;
  
}

/*returns −1 if the number stored in the linked list is too large to be fit in a Java
int variable and returns the integer value of the stored number otherwise.*/

public int getValue() {
  
   int len = this.list.size();
   long num = 0;
   int i=0;
  
   while(i<len) {
      
       num = num + (long)(this.list.get(i)*Math.pow(10,len-i-1));
       i++;
      
   }
  
   if(num>2147483647)
       return -1;
   else
       return (int) num;
  
  
}

public HugeInt clone() {
  
   return this;
}

public long log() {
  
   long count = this.list.size();
  
   return count;
}

public HugeInt modExp(long n) {
  
   long divisor = 10 * n;
   long num = getInteger();
   LinkedList<Integer> list1 = new LinkedList<>();
   HugeInt newhugeint = new HugeInt();
   long result = num%divisor;
  
String str = Long.toString(result);
  
   int length = str.length();
  
   int i =0;
  
  
   while(i<length) {
      
       list1.add(Character.getNumericValue(str.charAt(i)));
       i++;
      
   }
  
   newhugeint.setList(list1);
  
   return newhugeint;
  
}

public HugeInt quotientExp(long n) {
  
   long divisor = 10 * n;
   long num = getInteger();
   LinkedList<Integer> list1 = new LinkedList<>();
   HugeInt newhugeint = new HugeInt();
   long result = num/divisor;
  
String str = Long.toString(result);
  
   int length = str.length();
  
   int i =0;
  
  
   while(i<length) {
      
       list1.add(Character.getNumericValue(str.charAt(i)));
       i++;
      
   }
  
   newhugeint.setList(list1);
  
   return newhugeint;
  
}

public HugeInt timesExp(long n) {
  
   long multiplier = 10 * n;
   long num = getInteger();
   LinkedList<Integer> list1 = new LinkedList<>();
   HugeInt newhugeint = new HugeInt();
   long result = num * multiplier;
  
String str = Long.toString(result);
  
   int length = str.length();
  
   int i =0;
  
  
   while(i<length) {
      
       list1.add(Character.getNumericValue(str.charAt(i)));
       i++;
      
   }
  
   newhugeint.setList(list1);
  
   return newhugeint;
  
}

public HugeInt add(HugeInt h) {
  
   long num1 = h.getInteger();
   long num = getInteger();
   LinkedList<Integer> list1 = new LinkedList<>();
   HugeInt newhugeint = new HugeInt();
   long result = num + num1;
  
String str = Long.toString(result);
  
   int length = str.length();
  
   int i =0;
  
  
   while(i<length) {
      
       list1.add(Character.getNumericValue(str.charAt(i)));
       i++;
      
   }
  
   newhugeint.setList(list1);
  
   return newhugeint;
  
}

public void addset(HugeInt h) {
  
   long num1 = h.getInteger();
   long num = getInteger();

   long result = num + num1;
  
String str =Long.toString(result);
  
   int length = str.length();
  
   int i =0;
  
   this.list.clear();
  
   while(i<length) {
      
       this.list.add(Character.getNumericValue(str.charAt(i)));
       i++;
      
   }
  

}

}

I tried to write the driver class Which was not asked in the question. Just to help you get it more.

If you want more driver code to drive HugeInt class. Just comment the requirement.

package com.mindtree.sample;

import java.util.LinkedList;
import java.util.Scanner;

public class HugeIntDriver {

   public static void main(String[] args) {
       // TODO Auto-generated method stub
      
       Scanner sc = new Scanner(System.in);
      
       HugeInt hugeint = new HugeInt();
      
      
       // Driver code for setValue(int value) Method
      
       System.out.println("Enter an integer");
      
       int intvalue = sc.nextInt();
      
       hugeint.setValue(intvalue);
      
       LinkedList<Integer> list1 = hugeint.getList();
      
       for(int i : list1)
           System.out.print(i + " ");
      
      
       // Driver code for setValue(long value) Method
      
       System.out.println("\nEnter an Long integer");
      
long longvalue = sc.nextLong();
      
       hugeint.setValue(longvalue);
      
       list1 = hugeint.getList();
      
       for(int i : list1)
           System.out.print(i + " ");
      
      
       // Driver code for getValue Method
      
       intvalue = hugeint.getValue();
      
       System.out.println("\ngetValue method returned value is " + intvalue);
      
      
       // Driver code for clone() Method
       HugeInt hugeint1 = hugeint.clone();
      
       list1 = hugeint1.getList();
      
       for(int i : list1)
           System.out.print(i + " ");
      
      
       // Driver code for log() Method
       long count = hugeint.log();
      
       System.out.println("\nCount of digits in linked list is " + count);
      
      
      
      
      
      

   }

}

If you left with any doubt feel free to ask.