Write a method called subLR take a String number and return an integer that is the subtraction of left part and right part of the numbers. If the number has odd number of digits, then we ignore the middle one. Examples: • subLR ("123456") should return -333. Because left part is 123 and right part is 456, thus 123 - 456 = -333 • subLR ("92834") should return 58. Because left part is 92 and right part is 34 (we ignore 8 because of odd number of digits), thus 92 - 34 = 58 • subLR ("-123") should return -4. Because left part is -1 and right part is 3 (we ignore 2 because of odd number of digits), thus -1 - 3 = -4 subLR ("-345020") should return -365. Because left part is -345 and right part is 020. thus -345 - 20 = -365

Write a method called subLR take a String number and return an integer that is the subtraction of left part and right part of the numbers. If the number has odd number of digits, then we ignore the middle one. Examples: • subLR ("123456") should return -333. Because left part is 123 and right part is 456, thus 123 - 456 = -333 • subLR ("92834") should return 58. Because left part is 92 and right part is 34 (we ignore 8 because of odd number of digits), thus 92 - 34 = 58 • subLR ("-123") should return -4. Because left part is -1 and right part is 3 (we ignore 2 because of odd number of digits), thus -1 - 3 = -4 subLR ("-345020") should return -365. Because left part is -345 and right part is 020. thus -345 - 20 = -365

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

Extend BigInteger with a method named ToWords that returns a string describing the number, for example, 18,000,000 would be eighteen million, and 18,456,000,000,000,000,000 would be about eighteen and a half quintillion. * Detailed description is not required. It's enough to recognize the most significant digits. For example, the number 12,233,442 can be "Twelve million"
Write a method named sumOfStarts, which takes two Stringparameters named s1 and s2 and returns an int. The methodshould do the following:1. Return the sum of all the starting indices where s1 canbe found in s2.2. For example, if s1 is "goo" and s2 is "agoodegoodgo" thenthe method would sum 1 + 6 = 7.3. If s1 or s2 is null, or s1 cannot be found in s2, throw anIllegalArgumentException with the message "Null or notfound".4. You can assume any needed imports have already beenprovided.
Implement a new concat method in the String class you worked on for HW2. The method should return a new String object that represents the text you would end up with if the argument String were "added onto the end of" this String. For example, in the code below, the String object answer should represent the text "bookstore" and true should be printed the screen. char[] bookA = {'b', 'o', 'o', 'k'}; char[] storeA = {'s', 't', 'o', 'r', 'e'}; char[] bookstoreA = {'b', 'o', 'o', 'k', 's', 't', 'o', 'r', 'e'}; String book = new String(bookA); String store = new String(storeA); String bookstore = new String(bookstoreA); String answer = book.concat(store); System.out.println(answer.equals(bookstore)); In the text area below, type in your definition of the concat method. (In other words, type in the code that should replace the //TODO comment.) Your code cannot call any methods. public class String { private char[] data; public String(char[] value) { data = new…
Write a method sameVowelsStrings that takes three Strings as input. The method returns true if the three Strings contains the same unique vowels, false otherwise. Note that vowels are 'a', 'e', 'i', 'o' and 'u'. For example: • sameVowelsString("apple", "cattle", "accept") returns true. All strings have a and e as their vowels. • sameVowelsStrings("apple", "banana", "assume") returns false. The second string is missing the vowel e.The first and second strings are missing the vowel u • sameVowelsStrings("apple", "orange", "recordable" ) returns false. The first string is missing the vowel o. • sameVowelsStrings("e", "ee", "eee" ) returns true. They all have vowel e. Subject: Java Programming
write a method that calculate the average of all numbers from 1 to n, return a double value
Write a method that returns the sum of a range of numbers. It should take the starting and ending numbers of the range (inclusive) as parameters. (Use Java) For example: sumRange(0, 5) // returns 15 (0 + 1 + 2 + 3 + 4 + 5 = 15)sumRange(3,10) // returns 55 (3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 = 52)sumRange(5, 7) // returns 18 (5 + 6 + 7 = 18)
Write a method that takes a String and a character as inputs and returns the number of instances of the input character within the input String. For example, if "banana" and 'a' are input into the method, it should return 3. If "apple" and 'p' are input, it should return 2. (in java)
a) Write a method encrypt(String text, int key) that returns a String. This method does two things to thestring text:1. First, it reverses the order of its words (“hello there” becomes “there hello”).2. The second thing is incrementing the characters’ ascii code by key. For example, if the key isequal to 2, “hello” becomes “jgnnq” (since ‘h’ + 2 = ‘j’ and so on). Note that this second stepdoes not apply to the space character so a space remains a space.For example, "Humming birds" for a key equal to 4 becomes: "fmvhw Lyqqmrk".b) Write a test program that prompts the user to enter a line of text and a key then calls the methodencrypt to display the encryption of the input text.
Write a java method: public static String repeat(String str, int num) that returns the string str repeated n times. For Example: repeat("delta", 4) returns "deltadeltadeltadelta".
Write a program which takes a String input and then prints the number of times the letter p is followed by a vowel (y is not considered a vowel here). The letter p, and the vowel that follows, may be upper or lower case. Hint - remember there are String methods which return a copy of the String it is called on with all letter characters changed to the same case. in java Sample run Input String: Peter Piper picked a pack of pickle peppers. Contains p followed by a vowel 8 times.
Write a method that turns some text into something Porky Pig would say. To do that, you just need to add "Bdap bdap bb " to before the given text. For example, if you called porkyPig("that's all folks!"), it would return "Bdap bdap bb that's all folks!" The method signature should be public String porkyPig(String something)
Given a text string, create and return a new string of same length where all vowels have been reversed, and all other characters are kept as they were. For simplicity, in this problem only the characters aeiouAEIOU are considered vowels, and y is never a vowel. For example, given the text string "Uncle Sente lives in Russia", this method should create and return the string "Ancli Sunti levis en Resseu".Furthermore, to make this problem more interesting and the result look more palatable, this method must maintain the capitalization of vowels based on the vowel character that was originally in the position that each new vowel character is moved into. For example, "Ilkka Markus" should become "Ulkka Markis" instead of "ulkka MarkIs". Use the handy character classification methods in the Character utility class to determine whether some particular character is in upper or lower case, and convert some character to its upper or lower case version as needed. Here's the tester it must…