Write a method (compare Strings) that reads two strings from the keyboard and prints the largest (retative to lexicographical order). For example, ABC is larger" than AAA Hìnt Use the compare To method to compare the strings Note You can assume that the Scanner class has already been imported in your program Requirements • You must comment your code appropristely • Your code must be as efficient as possible For example: Test Input Result comparestrings (): mississippi Enter first Mord: river Enter second word: The largest string is: river comparestrings (): ABC Enter first word: ABC Enter second word: The two strings are the sane mswer: (penalty regime: 0%) RESET ANSWER V/method to compare two words lexicographically (alphabetical order) public static void compareStrings(){ //enter your code here

Write a method (compare Strings) that reads two strings from the keyboard and prints the largest (retative to lexicographical order). For example, ABC is larger" than AAA Hìnt Use the compare To method to compare the strings Note You can assume that the Scanner class has already been imported in your program Requirements • You must comment your code appropristely • Your code must be as efficient as possible For example: Test Input Result comparestrings (): mississippi Enter first Mord: river Enter second word: The largest string is: river comparestrings (): ABC Enter first word: ABC Enter second word: The two strings are the sane mswer: (penalty regime: 0%) RESET ANSWER V/method to compare two words lexicographically (alphabetical order) public static void compareStrings(){ //enter your code here

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

write the java mini project and upload the code .class as like this and also provide the screenshot of the code. use these method for insert ,remove and search public boolean insertBook(Book b) { for(int i=0; i<books.length; i++) { if(books[i] == null) { books[i] = b; return true; } } return false; } public boolean removeBook(Book b) { for(int i=0; i<books.length; i++) { if(books[i].getIsbn().equalsIgnoreCase(b.getIsbn())) { for(int j=i; j<books.length-1; j++) { books[j] = books[j+1]; } return true; } } return false; } public Book searchBook(String isbn) { for(int i=0; i<books.length; i++) { if(books[i] != null) {…
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.
You can just provide code as you don't have required utility class, Please provide explanation and comments for code : Write a static method asciiGraph(), to display a “graph” of ASCII values of a String. 2.The method has a single String parameter str, and returns nothing (void).3.The method loops through all characters in str, and for each displays a line of *s on a row equal to the ASCII/Unicode integer value of the character being examined (see example).Hints:1. recall the String methods .charAt() and .length(), and casting a char with (int) directly returns the int ASCII/Unicode value2. to produce the line of *s, call the method starLine() from the Exam utility class3. in the output capture document, consider reducing the font size to 7 or 8 point to have each row of *s on a single line Consider the strings “Ab C” and “TED 99”, that are composed of:A displays 65 stars (*), since Unicode 65 = 'A'b 98 stars (*), since Unicode 98 = 'b'space 32 * , since Unicode 32 = ' ' (the space)C…
Improve the method printList to print out the details of all publications ordered on the category of the publications, and then on the title within each category. Note: currently there are only 2 categories, i.e. Book and Journal, but the project may be expended by adding other categories, e.g. Newspaper etc. Here are my four classes. public class Database {private ArrayList<Publication> publicationList; // An array list collection of publications /*** Create a new database*/public Database() {publicationList = new ArrayList<Publication>();} /*** Add a publication** @param publication The publication to be added*/public void addPublication(Publication publication) {if (publicationList.contains(publication)) {System.out.println("This publication has already been added to the list: " + publication);} else {publicationList.add(publication);}} /*** Get the total number of publications** @return The total number of publications*/public int getTotal() {return…
I'm unable to use the method replaceAll because we have not touch upon it yet, so since the chapter cover loops, here are my 2 codes (Code 1) import java.util.Scanner; public class LabProgram {public static void main(String[] args) {/* Type your code here. */Scanner scnr = new Scanner(System.in);String str= scnr.next();String newStr=""; for (int i=0; i < str.length(); i++) {if (str.charAt(i) == '@')newStr+="";else if (str.charAt(i) == '1')newStr+="";else if (str.charAt(i) == '!')newStr+="";else if (str.charAt(i) == '-')newStr+="";else if (str.charAt(i) == '$')newStr+="";else if (str.charAt(i) == '.')newStr+="";else if (str.charAt(i) == ' ')newStr+="";else newStr= str.charAt(i);}System.out.println(newStr); }} (Code 2) It's the same as the 1st code but I removed the charAt(i) to newStr as in: newStr=str; System.out.println(newStr); This code displayed the string but no nonalpha characters were removed.
Add a method (call it spotterAnimalArea) to AnimalLab that takes two parameters —animalType and areaID — and returns a String containing the IDs of spotters that haveseen the animal in that particular area. You should include only spotters who reported asighting with count greater than zero. You should exclude duplicate spotter IDs.import java.util.ArrayList;import java.util.List;import java.util.stream.Collectors; */public class AnimalLab{ private ArrayList<SightingRecord> records; private ArrayList<String > dubID; /** * Create an AnimalLab. */ public AnimalLab() { records = new ArrayList<>(); addSightingRecords("records.csv"); } /** * Add the sightings recorded in the given filename to the current list. * @param filename A CSV file of Sighting records. */ private void addSightingRecords(String filename) { SightingReader reader = new SightingReader();…
Complete the method below that prints all elements that are in both Set<String> s and Set<String> t. Each matching element should be followed by a space. What can I change to make it work? import java.util.Set;import java.util.Iterator; public class Sets{ public static void printMatches(Set<String> s, Set<String> t) { System.out.print("{ "); while(in.hasNext()){ String next = in.next(); { if((s.contains(next))&& (t.contains(next))){ System.out.print(next+" "); } } System.out.println("}"); }} import java.util.Set;import java.util.TreeSet;import java.util.Arrays; public class SetsTester{ public static void main(String[] args) { Set<String> set1 = new TreeSet<>(Arrays.asList("Bob", "Bill", "Sally")); Set<String> set2 = new TreeSet<>(Arrays.asList("Sam", "Bob", "Frank")); Sets.printMatches(set1, set2);…
Please complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Only finish the (d) question, Thank you ! Using quicksort to sort an array of car objects by various criteria. Define a class Car as follows: class Car { public String make; public String model; public int mpg; // Miles per gallon } a) Implement a comparator called CompareCarsByMakeThenModel that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByMakeThenModel should return a value that will cause quicksort to sort an array of cars in ascending order (from smallest to largest) by make and, when two cars have the same make, in ascending order by model. b) Implement a comparator called CompareCarsByDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByDescendingMPG should return a value that will cause quicksort to sort an array of cars in descending order (from largest to smallest) by mpg. c)…
Create a method countSelectedOdd that returns the count of the all the odd numbers greater than threshold.
: Imagine you are reading in a stream of integers. Periodically, you wish to be ableto look up the rank of a numberx (the number of values less than or equal to x). lmplementthe datastructures and algorithms to support these operations. That is, implement the method track ( intx), which is called when each number is generated, and the method getRankOfNumber(intx), which returns the number of values less than or equal to x (not including x itself).EXAMPLEStream (in order of appearance): 5, 1, 4, 4, 5, 9, 7, 13, 3getRankOfNumber(l) 0getRankOfNumber(3) = 1getRankOfNumber(4) =3
Fancy Integer ArrayList (ONLY NEED HELP WITH WRITING TEST CASES) For example, we have defined a “testRemoveInt” method for you (see below) which tests the “remove” method. Pass the tests provided then write additional tests where it says “// TODO”. You’ll do this for each unit test method in the program. import static org.junit.jupiter.api.Assertions.*; import java.util.ArrayList; import org.junit.jupiter.api.Test; class CustomIntegerArrayListTest { @Test void testSpliceIntInt() { CustomIntegerArrayList arr1 = new CustomIntegerArrayList(); arr1.add(2); arr1.add(3); arr1.add(4); arr1.add(5); arr1.add(6); arr1.splice(3, 2); ArrayList<Integer> lst1 = new ArrayList<Integer>(); lst1.add(2); lst1.add(3); lst1.add(4); assertEquals((int) lst1.get(0), (int) arr1.get(0)); assertEquals((int) lst1.get(1), (int) arr1.get(1)); assertEquals((int)…
Write a program that stores a phrase as an array of words, and then prints it backward. The main method calls method getInput , which asks the user how many words there are, stores them in an array, and returns this array. printBackwards then take this array of words and prints it in reverse. For example, if the words were "Today" "is" "Monday" your method will print "Monday is Today"