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

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

Code that need debugging fix with no errors // Gets a String from user // Converts the String to lowercase, and // displays the String's length // as well as a count of letters import java.util.*; public class DebugSeven4 { public static void main(String[] args) { Scanner kb = new Scanner(System.in); String aString ; int numLetters = 0; int stringLength; System.out.println("Enter a String. Include"); System.out.println("some uppercase letters, lowercase"); System.out.print("letters, and numbers >> "); aString = kb.nextLine(); stringLength = aString.length(); System.out.print("In all lowercase, the String is: "); for(int i = 0; i <= stringLength; i++) { char ch = Character.toLowerCase(aStringcharAt(i)); System.out.print(ch); if(!Character.isLetter(ch)) numLetters++; } System.out.println(); System.out.println ("The number of CHARACTERS…
Write a method that finds the number of occurrences of a specified character in a string using thefollowing header:public static int countLetter(String str, char ch)Write a test program that prompts the user to enter a word and a letter of the alphabet. Theprogram should then count and display the number of occurrences of the letter in the word. Asample dialog for the program is shown below:
Determine whether a string is a palindromeA palindrome is a string of characters that reads the same from right to left as it does from left to right, regardless of punctuation and spaces.The specifications for this assignment are: •Write and test a non-recursive solution in Java that determines whether a string is a palindrome •Your program should consist of at least two methods: (1) the main method (2) the method which performs the task of determining whether the specified string is a palindrome. You should name this method isPalindrome. You should name the class that contains your “main” method and the isPalindrome method FindPalindrome. •You must use a Stack and a Queue in your solution: Write your own Stack and Queue based on the Vector in the Java API and use those in your solution. You should name those classes StackVector and QueueVector respectively. You already have access to the relevant exception classes and interfaces for the above ADTs. •All of your belong to a Java…
There are five errors in this code. Correct the errors and make the code work. Explain what are the errors found. import java.util.Scanner; //Testing.java //Displays running total of numbers in lines of standard //input correct to two decimal places. //Uses an out of range number (100) to quit. public class TWODPS{ public static void main (String [] args) { Scanner input new Scanner (System.in); double total=0; boolean flag=true; System.out.println ("Use an out of range entry 100 to quit."); while (flag) { System.out.println ("Enter a number on a line:"); double d = input.nextDouble (); if (outofRange (d) ) { flag=false; else{ dispTwoDPs ("The number value is: ",d); total = total + d; dispTwoDPs ("The total is: ",total); System.out.println (); System.out.println ("Next."); } //end of else }//end of while System.out.println ("You quit."); }//end of main static boolean outOfRange (double d) { if (d>-100) return true; if (d>100) return true; return false; }
The countSubstring function will take two strings as parameters and will return an integer that is the count of how many times the substring (the second parameter) appears in the first string without overlapping with itself. This method will be case insensitive. For example: countSubstring(“catwoman loves cats”, “cat”) would return 2 countSubstring(“aaa nice”, “aa”) would return 1 because “aa” only appears once without overlapping itself. public static int countSubstring(String s, String x) { if (s.length() == 0 || x.length() == 0) return 1; if (s.length() == 1 || x.length() == 1){ if (s.substring(0,1).equals(x.substring(0,1))){ s.replaceFirst((x), " "); return 1 + countSubstring(s.substring(1), x); } else { return 0 + countSubstring(s.substring(1), x); } } return countSubstring(s.substring(0,1), x) + countSubstring(s.substring(1), x); } public class Main { public static void main(String[] args) { System.out.println(Recursion.countSubstring("catwoman loves cats","cat"));…
In the classic problem FizzBuzz, you are told to print the numbers from 1 to n. However,when the number is divisible by 3, print "Fizz''. When it is divisible by 5, print "Buzz''. When it isdivisible by 3 and 5, print"FizzBuzz''. In this problem, you are asked to do this in a multithreaded way.Implement a multithreaded version of FizzBuzz with four threads. One thread checks for divisibilityof 3 and prints"Fizz''. Another thread is responsible for divisibility of 5 and prints"Buzz''. A third threadis responsible for divisibility of 3 and 5 and prints "FizzBuzz''. A fourth thread does the numbers.
Please &-. Write a Java program to check if a given string is a palindrome or not. A palindrome is a word, phrase, number, or other sequence of characters that reads the same backward as forward, ignoring spaces, punctuation, and capitalization. For example, "racecar" and "Madam" are palindromes, while "hello" and "Java" are not. Your program should take a string as input and return true if it's a palindrome, and false otherwise. Ik.?
In java, without Arrays and using only String methods ( don't use String builder) // Question 17: In MS-DOS, a file name consists of up // to 8 characters (excluding '.', ':', backslask, '?', // and '*'), followed by an optional dot ('.' character) // and extension. The extension may contain zero to three // characters. For example, 1STFILE.TXT is a valid filename. // Filenames are case-blind. // // Write and test a method that takes // in a String, validates it as a valid MS-DOS file // name, appends the extensions ".TXT" if no extension // is given (that is, no '.' appears in FILENAME), converts // the name to uppercase, and returns the resulting string // to the calling method // If fileName ends with a dot, remove that dot and do not // append the default extension. If the name is invalid, // validFileName should return null. public String validFileName(String n) { }
JAVA Language: Transpose Rotate. Question: Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string) import java.util.*; public class TestTranspose { public static void main(String[] args) { String plain = "this is the secret message"; // Here's the message Transpose transpose = new Transpose(); String secret = transpose.encrypt(plain); System.out.println("\n ********* Transpose Cipher Encryption *********"); System.out.println("PlainText: " + plain); // Display the results System.out.println("Encrypted: " + secret); System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt } } abstract class Cipher { public String encrypt(String s) { StringBuffer result = new…
java a. A method named contains exists that takes an array of Strings and a single String, in that order, as arguments and returns a boolean value that is true if the array contains the given String. Assume that an array of Strings named names is already declared and initialized. Call the method to see if the array contains the name "Fred", and save the result in a new variable named fredIsHere. b. Given a method named printMessage that takes a String argument and returns nothing, call the method to print out "I love Java!".
A very known application in natural language processing is to extract information from a given text. In this lab, you will be able to extract some emotions (Sad and Happy) from a given string and calculate the score of each emotion. You will be given below the words that express sadness, anger, and happiness. For each word, you will be given weight as well, so that when you are calculating for example the score for sadness in the text (string), you can use this formula:
In Java: Forms often allow a user to enter an integer. Write a program that takes in a string representing an integer as input, and outputs yes if every character is a digit 0-9. Ex: If the input is: 1995 the output is: yes Ex: If the input is: 42,000 or 1995! the output is: no Hint: Use a loop and the Character.isDigit() function.