3. Complete the implementations of the conversion methods:a. double toDouble () const;This method returns the corresponding value the string in double type. For example, if wehave an object str: CustomString str("99.50");then this operation: double numberwill give the number = 99.50.= str.toDouble(); b. CustomString toUpper () const;This method returns a new CustomString object with capitalized string from the dataof the current object. This method does not change at all the original data of the current object.For example, if we have an object str: CustomString str("One Plus Two");then this operation: CustomString result = str.toUpper();will give the result's data = "ONE PLUS TWO" and the str's data remains as"One Plus Two".

Algorithm of code (a):Start the program:The program begins execution.Declare the main method:Define…

3. Complete the implementations of the conversion methods: a. double toDouble () const; This method returns the corresponding value the string in double type. For example, if we have an object str: CustomString str("99.50"); then this operation: double number = str.toDouble (); will give the number = 99.50.

3. Complete the implementations of the conversion methods: a. double toDouble () const; This method returns the corresponding value the string in double type. For example, if we have an object str: CustomString str("99.50"); then this operation: double number = str.toDouble (); will give the number = 99.50.

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

JAVAA7-Write a class with a constructor that accepts a String object as its argument. The class should have a method that returns the number of vowels in the string, and another method that returns the number of consonants in the string. Demonstrate the class in a program by invoking the methods that return the number of vowels and consonants. Print the counts returned.
2. Write a method isPalidrome(String arg) that determines if a String is palindrome or not. Palindrome is when a String remains the same after reversing. The method should return boolean type. For example: MADAM is palindrome.
A class may occasionally be dependent upon itself. In other words, an object of one class engages in communication with an object of the same class. To do this, a method of the class can take an object of the same class as a parameter.An illustration of this scenario is the concat method of the String class. One String object calls the method, while another String object is supplied as an argument. Here's an illustration:str2 = str1.concat;The String object (str1) that executes the method adds its characters to the String (str2) that was supplied as a parameter. As a result, a fresh String object is produced and saved as str3. Write Java code to put the circumstances given into effect.
Problem 2: Complete the seperateDuplicateChars () method in Seperate Duplicates.java as follows: The method takes a String str as a parameter and returns a new String. The returned String should be exactly like str, but any identical characters that appear in a consecutive way must be separated by hyphens "-". You may ONLY use the following methods from the String class: charAt(), substring() and length(). Other than uncommenting the code, do not modify the main method in Seperate Duplicates.java. Sample runs provided below. Argument String str "Hello" "Bookkeeper" "Yellowwood door" "Chicago Cubs" Return String "Hel-lo" "Bo-ok-ke-eper" "Yel-low-wo-od do-or" "Chicago Cubs"
DescriptionA researcher is analyzing DNA. A DNA can be represented as a string composed of the characters A, G, C, or T.One day, researchers found a strange DNA, which is Smooth Repeated DNA. The DNA is represented by a string that has infinite length. The string has a repeating pattern, i.e. the DNA string 0 is repeated an infinite number of times. For example, if0 = "????", then = "???????????? . . . ".According to researchers, a DNA is said to be special if it contains substrings . Determine whetheris a substring of . Squad FormatA line containing the two strings 0 and . Output FormatA line that determines whether it is a substring of . Issue “YES” ifis a substring of . Output “NO” otherwise. Example Input and Output Input Example Example Output AGCT GC YES AGCT TA YES AGCT GT No AGCT TAGCTAGCT YES AGGACCTA CTAA YES Explanation ExampleIn the first to fourth test case examples, is worth "???????????? . . . ". The part in bold is one of the…
Exercise 2: The intersection method computes the intersection of two rectangles- that is, the rectangle that would be formed by two overlapping rectangles if they were drawn, as shown at right. You call this method as follows: Rectangle r3 = r1.intersection (r2); Write a program IntersectionPrinter that constructs two rectangle objects, prints them as described in Exercise 1, and then prints the rectangle Intersection object that describes the intersection. Then the program should print the result of the intersection method when the rectangles do not overlap. Add a comment to your program that explains how you can tell whether the resulting rectangle is empty. The random class implements a random number generator, which produces sequences of numbers that appear to be random. To generate random integers, you construct an object of the Random class, and then apply the nextInt (50) gives you a random number between 0 and 49. Use the Random class to construct the two rectangle objects.
canMove(int x, int y, int destX, int destY, Side s): This method returns true if the player of color s can move the piece at coordinates (x,y) can move to coordinates (destX, destY) on the board in its current state. This means that here you do need to consider this piece’s interaction with other pieces on the board. Conditions for this method to return false are given in the code. public boolean canMove(int x, int y, int destX, int destY, Side s){ /* TODO write a method that checks if a piece at coordinates x,y can move to coordinates destX,destY Conditions for false: - Origin or destination coordinates are outside the board - Piece at origin is null - If source and destination coordinates are the same - Piece at origin is not of the same side as s - You can check this using piece.getSide() - Piece cannot move to the destination by piece movement rules - You should check this using Piece.canMove(destX,…
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:
Part I: PrintVertical.java Write a program that will prompt the user to enter a sentence (string data), read that sentence into your program as a single string, and then finally process the string by calling the method specified below (vertical). You must process the sentence by calling the method rather than processing the string directly in your main method. Write a void method, vertical, which receives a string as a parameter and prints each letter of the string to the screen on separate lines. Example Execution (user input in green) Please enter a sentence: Hey there! Your sentence printed vertically is: H e t h e r
public static String[] getTokens(String raw, String delimiter){ // Line #1 goes here... int numTokens = st.countTokens(); // Line #3 goes here... for(int i = 0; i < numTokens; i++){ // Line #5 goes here } // Line #7 goes here } Using the code above, which one of these should be the code for "Line #7": ret[i] = st.nextToken(); return ret; String[] ret = new String[numTokens]; StringTokenizer st = new StringTokenizer(raw, delimiter);
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",…
Practice / Frequency of Characters Write a method that returns the frequency of each characters of a given String parameter. If the given String is null, then return null If the given String is empty return an empty map Example input: output: empty map explanation: input is empty Example input: null output: null explanation: input is null. Since problem output is focused on the frequency we can comfortably use Map data structure. Because we can use characters as key and the occurrences of them as value. Example input: responsible output: {r=1, e=2, s=2, p=1, o=1, n=1, i=1, b=1, l=1} explanation: characters are keys and oc values ences are