Write a complete Java program that: • Ask the user to enter his/her first and last name. • Then the program should compare the two strings to find out which has the alphabetical precedence in the dictionary. • Then, print the result of the comparison to show which string comes first in the dictionary. • Keep in mind that your program should also test if the two strings are equals and print the result accordingly. Note: 1. Your answer should have the code as text, as well as a screenshot of the code with the output. 2. The inputted names should be your first and last name.

Write a complete Java program that: • Ask the user to enter his/her first and last name. • Then the program should compare the two strings to find out which has the alphabetical precedence in the dictionary. • Then, print the result of the comparison to show which string comes first in the dictionary. • Keep in mind that your program should also test if the two strings are equals and print the result accordingly. Note: 1. Your answer should have the code as text, as well as a screenshot of the code with the output. 2. The inputted names should be your first and last name.

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

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?
In Python, with use of function and input parsing/ Make a method is_anagram_of(a,b) that tests if a is an anagram of b. A string a is an anagram of a string b, if it uses exactly the same letters, but the order can be different. Spaces are ignored, as well as capitalization. Examples of anagrams: "eleven plus two" - "twelve plus one" "William Shakespeare" - "I am a weakish speller" "Tom Marvolo Riddle" - "I am Lord Voldemort" "Anagrams" - "Ars manga" "television ads" - "enslave idiots" Counter examples: "bla" - "aalb" "cat" - "tact" Hint: Make a dictionary that holds how often a letter occurs in a word.
3. Write a program that transforms numbers 1, 2, 3,..., 12 into the corresponding month names January, February, March, ..., December. Hint: Make a very long string "January February March ...", in which you add spaces such that each month name has the same length. Then use substring to extract the month you want.
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…
In c++, Thank you Write a program that finds word differences between two sentences. The input begins with an integer indicating the number of words in each sentence. The next input line is the first sentence and the following input line is the second sentence. Assume that the two sentences have the same number of words and no more than 20 words each. The program displays word pairs that differ between the two sentences. One pair is displayed per line. Ex: If the input is: 6 Smaller cars get better gas mileage Tiny cars get great fuel economy then the output is: Smaller Tiny better great gas fuel mileage economy Add a function named ReadSentences to read the input sentences into two string vectors.void ReadSentences(vector<string>& sentence1Words, vector<string>& sentence2Words, int wordCount) main() already contains code to read the word count and call ReadSentences(). Complete main() to display differing word pairs.
Python please: Write a program to calculate the total calories in a lunch. Each lunch comes with a pickle that is 7 calories. A dictionary with each additional food item and the corresponding calorie count has been provided. Up to four items can be selected. A '-' signifies an additional item was not selected. Output all selected items along with the corresponding calories and then the total calories for the entire lunch. Example: If the input is Wrap Soda French Fries Cookie the output is ZyDeli Lunch Counter Pickle calories -- 7 cal Wrap -- 890 cal Soda -- 160 cal French Fries -- 365 cal Cookie -- 190 cal ---- Total calories: 1612 cal Example: If the input is French Fries Soda - Cookie the output is ZyDeli Lunch Counter Pickle calories -- 7 cal French Fries -- 365 cal Soda -- 160 cal Cookie -- 190 cal ---- Total calories: 722 cal
Write a problem that counts the number of words in a sentence input by the user. Save it as words.py. output example: Enter a sentence: This sentence contains five words. Number of words: 5
java: Run length coding is a method to represent a string in a more compact manner. Each character that occurs more than 2 times in a row is represented by the character and a number following it. Two examples are: "abba" → "abba""abcccbbbba" → "abc3b4a"Write a function that calculates how many characters the encoded string is shorter than the original.
java program Write code that accomplishes the following tasks. Consider two bags that can hold strings. One bag is named letters and contain seeral one-letter strings. The other bag is empty and is namedvowels. One at a time removed a string from letters. If the string contain a vowel place it into bag vowels, otherwise, discard the string. After you have checked all of the strings in letters, report the number of vowels and the number of times each voewl appears in the bag.
Output the information as a formatted histogram. Each name is right justified with a width of 20. Ex: Jane Austen ****** Charles Dickens ******************** Ernest Hemingway ********* Jack Kerouac ********************** F. Scott Fitzgerald ******** Mary Shelley ******* Charlotte Bronte ***** Mark Twain *********** Agatha Christie ************************************************************************* Ian Flemming ************** J.K. Rowling ************** Stephen King ****************************************************** Oscar Wilde *
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…
java program that shows exact output as picture program that asks the user to enter a number to be tested for repeated digits. For each input number from the user, the program prints a table showing how many times each digit appears in the number. Let’s assume that the appearance of a digit will not be over 1000 times in the input. Make sure your table printout can align well. The program should terminate when the user enters a number that is less than or equal to 0. A sample output is shown in the attachment.