DESCRIPTION: Using the scanner class, read in three strings as input. Using the Compare Toll method of the String class, and decisions, decide which string would come lexicographically first. INPUT: Three Strings: • String a . String b • String c PROCESSING: The compareTo() method of the String class compares two strings and returns a positive or negative value depending on which String is lexicographically first. If the two Strings are equal, then 0 is returned. • "A compareTo("B") will return -1, since "A" is one letter before "B" • "C"compareTo["A"] will return +2 since "C" is two letters after "A" • "Ice cream.compareTo('ice cream] will return 0. since they are lexographically the same *Note: For this question you do not have to implement a test for two strings being lexicographically the same. You are guranteed the input strings will be unique. Remember that order of compairson matters for your result OUTPUT: (whatever string is first lexicographically) Sample Input/output: Inputs Output Chocolate Raspberry Chocolate Vanilla Bubble Gum Apple Spice Chocolate Apple Spice Oreo French Vanilla French Vanilla Pinapple

DESCRIPTION: Using the scanner class, read in three strings as input. Using the Compare Toll method of the String class, and decisions, decide which string would come lexicographically first. INPUT: Three Strings: • String a . String b • String c PROCESSING: The compareTo() method of the String class compares two strings and returns a positive or negative value depending on which String is lexicographically first. If the two Strings are equal, then 0 is returned. • "A compareTo("B") will return -1, since "A" is one letter before "B" • "C"compareTo["A"] will return +2 since "C" is two letters after "A" • "Ice cream.compareTo('ice cream] will return 0. since they are lexographically the same *Note: For this question you do not have to implement a test for two strings being lexicographically the same. You are guranteed the input strings will be unique. Remember that order of compairson matters for your result OUTPUT: (whatever string is first lexicographically) Sample Input/output: Inputs Output Chocolate Raspberry Chocolate Vanilla Bubble Gum Apple Spice Chocolate Apple Spice Oreo French Vanilla French Vanilla Pinapple

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

what do we mean by SAOG and SAOC
What are the different uses of Depth First Search?
Can someone explain to me the concept behind Karnaugh maps? Please use simplest detail possible since I'm a beginner.
Explain the concept of "keyword stemming" in natural language processing and its impact on expanding keyword search results.
What kinds of multiplicity are there?
How many 5-digit zip codes are possible if digits can be repeated? If there cannot be repetitions? Topic: Sampling
What are the main differences between breadth-first search (BFS) and depth-first search (DFS), and in what scenarios would you choose one algorithm over the other?