2. Convert the given LargeInteger Addition.java into LargeFloat Addition.java which adds two large float numbers. Each of the float number must have a decimal point and must have no sign. In addition, the two float numbers must have an equal number of digits to the right of the decimal point. You may use the following String methods: indexOf, lastIndexOf, length, substring, charAt +Sample program runs: Note: Enter numbers that have equal number of digits to the right of decimal point. Enter the first floating point number: 4567999999999999999999999999999.99999999 Enter the second floating point number: 999999999999999999999999.88888888 Sum = 4568000999999999999999999999999.88888887 Note: Enter numbers that have equal number of digits to the right of decimal point. Enter the first floating point number: 673456.57 Enter the second floating point number: 3489.86 Sum 676946.43 Enter the first floating point number: 1234.78 Enter the second floating point number: 768234595.95 Sum 768235830.73 Page 1 of 2

2. Convert the given LargeInteger Addition.java into LargeFloat Addition.java which adds two large float numbers. Each of the float number must have a decimal point and must have no sign. In addition, the two float numbers must have an equal number of digits to the right of the decimal point. You may use the following String methods: indexOf, lastIndexOf, length, substring, charAt +Sample program runs: Note: Enter numbers that have equal number of digits to the right of decimal point. Enter the first floating point number: 4567999999999999999999999999999.99999999 Enter the second floating point number: 999999999999999999999999.88888888 Sum = 4568000999999999999999999999999.88888887 Note: Enter numbers that have equal number of digits to the right of decimal point. Enter the first floating point number: 673456.57 Enter the second floating point number: 3489.86 Sum 676946.43 Enter the first floating point number: 1234.78 Enter the second floating point number: 768234595.95 Sum 768235830.73 Page 1 of 2

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

In Python, The function add_char_counts takes three parameters: a string s and two strings of length 1, char1 and char2, and returns the total number of times either char1 or char2 appears in s. For example, the word "scallions" has 2 s's and 1 n, so add_char_counts("scallions", "s", "n") returns 3. Hint: Use a string method to help solve this problem (count). You do not need an accumulator. For example: Test Result print(add_char_counts('Indiana', 'a', 'b')) 2 print(add_char_counts('BAHAMAS', 'A', 'B')) 4 print(add_char_counts('Mississippi', 'i', 'M')) 5 print(add_char_counts("spam spam spam spam", "s", "p")) 8
Language: Java Write a program that reads a sentence from the keyboard. Depending on the last character of the sentence, print the message identifying the sentence as declarative (ends with a period), interrogative (ends with a question mark), exclamatory (end with an exclamation point), or other. Hint: you can use charAt() method from the String class to extract the last character of the input line. The character of a String str is at str.length()-1 position. For taking a sentence as input use the nextLine() method from the Scanner class. You have to use if/else if selection. Sample input and output: Sample 1 Input: How are you? Output: Interrogative Sample 2 Input: I am good. Output: Declarative Sample 3 Input: That is amazing! Output: Exclamatory Sample 4 Input: Although, Output: Other Answer:
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string.This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is,str = new StringBuilder(str).reverse().toString(); Here's the tester it must pass: @Test public void testPancakeScramble() throws IOException {// Explicit test casesassertEquals("", P2J3.pancakeScramble(""));assertEquals("alu",…
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string. This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is, str = new StringBuilder(str).reverse().tostring(); A bit convoluted, but does what is needed without fuss or muss. Maybe one day the Java strings will come with the reverse method built in, just like the string data types of all sensible…
The files provided in the code editor to the right contain syntax and/or logic errors. In each case, determine and fix the problem, remove all syntax and coding errors, and run the program to ensure it works properly. // Converts a string to lowercase, and // displays the string's length // as well as a count of letters public class DebugSeven4 { public static void main(String[] args) { String aString = "HELP!! I need to get 37 things DONE today!!"; int numLetters = 0. int stringLength = aString.Length(); System.out.println("In all lowercase, the sentence is: "); for(int i = 0; i < stringLength; i++) { char ch = Character.toTheLowerCase(aString.charAt(i)); System.out.print(ch); if(Character.isLetter(ch)) numLetters--; } System.out.println(); System.out.println ("The number of CHARACTERS in the string is " + stringLength); System.out.println(The number of LETTERS is "…
PLEASE NOTE: IT'S A TEXT BOOK EXERCISE. BOOK NAME: Fundamentals of Computer Programming with Programming Basics with C# (English) Problem: String Encryption Write a method Encrypt(char letter), which encrypts a given letter in the following way: It takes the first and the last digit from the ASCII code of the letter and concatenates them into a string, which will represent the result. In the beginning of the string, which represents the result, we will insert the symbol which matches the following condition: ASCII code of the letter + the last digit of the ASCII code of the letter. After that in the end of the string, which represents the result, you concatenate the character which matches the following condition: ASCII code of the letter - the first digit of the ASCII code of the letter. The method should return the encrypted string. Example: j → p16i ASCII code of j is 106 → First digit – 1, last digit – 6. We concatenate the first and the last digit → 16. At the beginning…
Please complete the following Java program using the math.random function. USE THE Math.random() class. DO NOT use arrays, the Random function. (i.e keep the program simple using while loops, if/else, for loops, etc)
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
This is the question: Write an application that displays the factorial for every integer value from 1 to 10. A factorial of a number is the product of that number multiplied by each positive integer lower than it. For example, 4 factorial is 4 * 3 * 2 * 1, or 24. The output would then be The factorial of 4 is 24. This is the code given: public class Factorials { public static void main (String args[]) { // Write your code here } }
Consider the following application. Identify and correct any syntactic errors or omissions by rewriting the line number and the corrected line. Note: There are 8 lines with errors. Each line may have multiple errors. Here’s an example (here, the error is on line 2, the correction is in bold – int x = 0;): 01 public static void main(String[] args){ 02 int x = '0'; 02 int x = 0; 03 int y + x = 7 03 int y = x + 7; 04 } 01 public Class Average; 02 { 03 public void main(String [] args) 04 { 05 double sc = (70, 75, 90, 83, 85, 97, 82, 79, 94, 87; 06 double me su = 0.0 07 for (int k = 0; k < sc.length(); k++); 08 su += sc[ ]; 09 double me = su/sc.length() 10 System.Out.printf("Output: %.2f" + me); 11 } 12 } What value of the variable me will be printed in line 10?
Write a function that finds the number of occurrences of a specified character in a string using the following header:def count(s, ch):The str class has the count method. Implement your method without using the count method. For example, count("Welcome", 'e') returns 2. Write a test program that prompts the user to enter a string followed by a character and displays the number of occurrences of the character in the string.
A prime number is called a Mersenne prime if it can be writtenin the form 2p - 1 for some positive integer p. Write a program that findsall Mersenne primes with p ≤100 and displays the output as shown below.(Hint: You have to use BigInteger to store the number because it is too big tobe stored in long. Your program may take several hours to run.) p 2^p – 1---------------------2 33 75 31...