
a.
Explanation of Solution
Program:
File name: “CategorizeStrings.java”
//Import necessary header files
import java.util.*;
//Define a class named CategorizeStrings
public class CategorizeStrings
{
//Define a main method
public static void main (String[] args)
{
//Declare the variables and initialize the values
final int MAX = 20;
final int CUTOFF = 10;
final String QUIT = "ZZZ";
String entry;
int shortSub = 0;
int longSub = 0;
//Create an object for Scanner class
Scanner input = new Scanner(System.in);
/*Declare an array to store each String in one of two lists -
one list for short Strings that are 10 characters or fewer
and another list for long Strings that are 11 characters or more*/
String[] longStrings = new String[MAX];
String[] shortStrings = new String[MAX];
//Prompt the user to enter a String or QUIT
System.out.print("Enter a string or " +
QUIT + " to quit >> ");
entry = input.nextLine();
/*While the user does not enter QUIT and enter less than MAX*/
while(!entry.equals(QUIT) && (shortSub + longSub < MAX))
{
//If there are 10 characters or fewer
if(entry.length() <= CUTOFF)
{
//Assign the value
shortStrings[shortSub] = entry;
//Increment shortSub
++shortSub;
}
//Else there are 11 characters or more
else
{
//Assign the value
longStrings[longSub] = entry;
//Increment longSub
++longSub;
}
//If the length of the characters is less than MAX
if(shortSub + longSub < MAX)
{
//Prompt the user to enter a String or QUIT
System...
b.
Explanation of Solution
Program:
File name: “CategorizeStrings2.java”
//Import necessary header files
import java.util.*;
//Define a class named CategorizeStrings2
public class CategorizeStrings2
{
//Define a main method
public static void main (String[] args)
{
//Declare the variables and initialize the values
final int MAX = 20;
final int CUTOFF = 10;
final String QUIT = "ZZZ";
String entry;
int spaces;
int oneWordSub = 0;
int twoWordsSub = 0;
int threeWordsSub = 0;
//Create an object for Scanner class
Scanner input = new Scanner(System.in);
/*Declare an array to store each String in one of three lists -
that contain no spaces, one space, or more*/
String[] oneWord = new String[MAX];
String[] twoWords = new String[MAX];
String[] threeWords = new String[MAX];
//Prompt the user to enter a String or QUIT
System.out.print("Enter a string or " +
QUIT + " to quit >> ");
entry = input.nextLine();
//While the user does not enter QUIT and enter the //String less than than MAX
while(!entry.equals(QUIT) && (oneWordSub + twoWordsSub + threeWordsSub < MAX))
{
//Assign the value 0 to spaces
spaces = 0;
//For loop to be executed until x exceeds the string //length
for(int x = 0; x < entry.length(); ++x)
{
//If the character contains a space
if(entry.charAt(x) == ' ')
//Increment spaces
++spaces;
}
//If the entered Strings contain no spaces
if(spaces == 0)
{
//Assign the value
oneWord[oneWordSub] = entry;
//Increment oneWordSub
++oneWordSub;
}
//Else if the entered Strings contain one space
else
if(spaces == 1)
{
//Assign the value
twoWords[twoWordsSub] = entry;
//Increment twoWordsSub
++twoWordsSub;
}
//Else the entered Strings contain more than one //space
else
{
//Assign the value
threeWords[threeWordsSub] = entry;
//Increment threeWordsSub
++threeWordsSub;
}
//If the length of all the entered Strings is less //than MAX
if(oneWordSub + twoWordsSub + threeWordsSub < MAX)
{
//Prompt the user to enter a String or QUIT
System...

Trending nowThis is a popular solution!

- Show all the workarrow_forwardShow all the workarrow_forward[5 marks] Give a recursive definition for the language anb2n where n = 1, 2, 3, ... over the alphabet Ó={a, b}. 2) [12 marks] Consider the following languages over the alphabet ={a ,b}, (i) The language of all words that begin and end an a (ii) The language where every a in a word is immediately followed by at least one b. (a) Express each as a Regular Expression (b) Draw an FA for each language (c) For Language (i), draw a TG using at most 3 states (d) For Language (ii), construct a CFG.arrow_forward
- Question 1 Generate a random sample of standard lognormal data (rlnorm()) for sample size n = 100. Construct histogram estimates of density for this sample using Sturges’ Rule, Scott’s Normal Reference Rule, and the FD Rule. Question 2 Construct a frequency polygon density estimate for the sample in Question 1, using bin width determined by Sturges’ Rule.arrow_forwardGenerate a random sample of standard lognormal data (rlnorm()) for sample size n = 100. Construct histogram estimates of density for this sample using Sturges’ Rule, Scott’s Normal Reference Rule, and the FD Rule.arrow_forwardCan I get help with this case please, thank youarrow_forward
- I need help to solve the following, thank youarrow_forwardreminder it an exercice not a grading work GETTING STARTED Open the file SC_EX19_EOM2-1_FirstLastNamexlsx, available for download from the SAM website. Save the file as SC_EX19_EOM2-1_FirstLastNamexlsx by changing the “1” to a “2”. If you do not see the .xlsx file extension in the Save As dialog box, do not type it. The program will add the file extension for you automatically. With the file SC_EX19_EOM2-1_FirstLastNamexlsx still open, ensure that your first and last name is displayed in cell B6 of the Documentation sheet. If cell B6 does not display your name, delete the file and download a new copy from the SAM website. Brad Kauffman is the senior director of projects for Rivera Engineering in Miami, Florida. The company performs engineering projects for public utilities and energy companies. Brad has started to create an Excel workbook to track estimated and actual hours and billing amounts for each project. He asks you to format the workbook to make the…arrow_forwardNeed help completing this algorithm here in coding! 2arrow_forward
- EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningC++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,Programming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning




