Create a class HugeInteger which uses a 40-element array of digits to store integers as large as 40 digits each. Provide methods parse, tostring, add and subtract. Method parse should receive a string , extract each digit using method charat and place the integer equivalent of each digit into the integer array. For comparing HugeInteger objects, provide the following methods: isEqualTo, isNotEqualTo, isGreaterThan , islessThan , isGreaterThanOrEqualTo and islessThanorEqualTo. Each of these is a predicate method that returns true if the relationship holds between the two HugeInteger objects and returns false if the relationship does not hold. Provide a predicate method iszero. If you feel ambitious, also provide methods multiply, divide and remainder. [Note: Primitive boolean values can be output as the word "true" or the word "false" with format specifier %b

Create a class HugeInteger which uses a 40-element array of digits to store integers as large as 40 digits each. Provide methods parse, tostring, add and subtract. Method parse should receive a string , extract each digit using method charat and place the integer equivalent of each digit into the integer array. For comparing HugeInteger objects, provide the following methods: isEqualTo, isNotEqualTo, isGreaterThan , islessThan , isGreaterThanOrEqualTo and islessThanorEqualTo. Each of these is a predicate method that returns true if the relationship holds between the two HugeInteger objects and returns false if the relationship does not hold. Provide a predicate method iszero. If you feel ambitious, also provide methods multiply, divide and remainder. [Note: Primitive boolean values can be output as the word "true" or the word "false" with format specifier %b

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

First, write a Java method merge that takes as parameter a non-empty double array representingemployees’ salaries. The method merges the values of every 2 adjacent elements. put themerged values at the beginning of the array, and put 0 in the remaining positions. Suppose thatthe original array will contain an even number of elements.Second, write two java methods readArray(int[]a) and printArray(int[]a) thatreads/writes the elements of an array passed in parameter from/to the standard input/output.Finally, Use the following main method to test your different methods:public class MergeSalary{ private static Scanner input = new Scanner(System.in); public static void main(String[] args) { double[] salaries = new double[10]; System.out.print("Enter 10 salaries: "); readArray(salaries); merge(salaries); System.out.print("Salaries after merge: "); printArray(salaries); }}
Write array methods that carry out the following tasks for an array of integers bycompleting the ArrayMethods class below. For each method, provide a test program.public class ArrayMethods{private int[] values;public ArrayMethods(int[] initialValues) { values = initialValues; }public void swapFirstAndLast() { . . . }public void shiftRight() { . . . }. . .} bjeo_ch07p.indd 6 11/21/18 5:15 PM Practice Exercises EX7-7 a. Swap the first and last elements in the array.b. Shift all elements to the right by one and move the last element into the firstposition. For example, 1 4 9 16 25 would be transformed into 25 1 4 9 16.c. Replace all even elements with 0.d. Replace each element except the first and last by the larger of its two neighbors.e. Remove the middle element if the array length is odd, or the middle twoelements if the length is even.f. Move all even elements to the front, otherwise preserving the order of theelements.g. Return the second-largest element in the array.h. Return true…
JAVA complete a method that swaps the first and second half of an array of integers. For example, if the array contains the values 1 4 9 16 25 36then after calling the method, it should contain the values16 25 36 1 4 9If the array contains an odd number of elements, leave the middle element in place. For example, 1 4 9 16 25 36 45becomes25 36 45 16 1 4 9
Write a class in Java 1) Consist of two methods: a. main b. printHigherThanAverage public static void printHigherAverage(double [] numbers, double avg) The method will print all the numbers in the array, numbers, which are higher than the average. 2) In the main methods, create an Array which can contain 5 elements of type double 3) In a loopa. Ask the user for 5 values using a Scanner. b. Store the values in the arrayc. Sum the values 4) At the end of the loop: Calculate the average. Call the method printHigherAverage and pass it the array and the average.
Create an array of 1,000 random numbers using the CArray class and the SeqSearch and BinSearch methods. Add a new private Integer data member called compCount, which is set to 0. Add a line of code directly after the essential comparison in each of the search algorithms that increases compCount by one. Run both methods, each searching for the same number, say 734. Compare the compCount results after executing both techniques. What is the compCount value for each method? Which method generates the fewest number of comparisons?
5. Write a static method largestColumnFirst() that receives as parameter a 2D array numAr,finds the column with the largest sum, and switches it with the first column. For example:6 7 9 4 8 9 7 6 4 83 2 7 4 1 → 7 2 3 4 19 4 5 8 3 5 4 9 8 3
Four integers are read from input and stored into the array arrayToModify. Write a static method resetFirstValue() that takes an integer array parameter and replaces the first element with 1. Ex: If the input is 55 45 70 65, then the output is: Original array: 55 45 70 65 Changed array: 1 45 70 65 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 Scannerscnr=newScanner(System.in); finalintNUM_ELEM=4; int[] arrayToModify=newint[NUM_ELEM]; inti; intuserNum; for (i=0; i<arrayToModify.length; ++i) { arrayToModify[i] =scnr.nextInt(); } System.out.print("Original array: "); printArr(arrayToModify); resetFirstValue(arrayToModify); System.out.print("Changed array: "); printArr(arrayToModify); } }
Consider the following incomplete method, which is intended to return the longest string in the string array words. Assume that the array contains at least one element. public static String longestWord(String[] words) { /* missing declaration and initialization */ for (int k = 1; k < words.length; k++) { if (words[k].length() > longest.length()) { longest = words[k]; } } return longest; } Which of the following can replace /* missing declaration and initialization */ so that the method will work as intended?
The split method in the String class returns an array of strings consisting of the substrings split by the delimiters. However, the delimiters are not returned. Implement the following new method that returns an array of strings consisting of the substrings split by the matching delimiters, including the matching delimiters. public static String[] split(String s, String regex) For example, split("ab#12#453", "#") returns ab, #, 12, #, and 453 in an array of String and split("a?b?gf#e", "[?#]") returns a, ?, b, ?, gf, #, and e in an array of String.
Java. Implement a method that will return a String with an array's elements separated by spaces. The mehod will recieve three parameters: the integer array, a start index, and an end index. Both start and end are includive. The method's signature is as follows: public static String printRange(int [], int, int) - make the method public to faciliate testing - If the indexes are outside the bounds of the array, the method should return "Invalid Range." Otherwise, the method will return a String containing one integer after the other on the same line separated by one space. Example 1: Given {4,1,2,36,6}, 1, 3 as the parameters; the method should return "1 2 36" Example 2: Given {4,1,2,36,6}, 0, 7 as the parameters; the method should return "Invalid Range"
java Create a method called populate() that will take an int argument and print an array that is populated/filled with numbers starting from 1 to the given number. This is a void method with an int parameter Scanner in = new Scanner(System.in); int n = in.nextInt(); populate(n); populate(3) output: [1,2,3]
In the box provided, complete the static method filterArray() to return a new array containing the even numbers divisible by 10 in the input array. For example, if the input array arr looks like this: (CLO2) 1 22 11 45 55 25 71 80 8 10 0 1 2 3 4 5 6 7 8 9 Then the method returns this array: 80 10 0 1 i need code in java