Java Programming (MindTap Course List)
Java Programming (MindTap Course List)
8th Edition
ISBN: 9781285856919
Author: Joyce Farrell
Publisher: Cengage Learning
bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 8, Problem 5PE

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...

Blurred answer
Students have asked these similar questions
make corrections of this program based on the errors shown. this is CIS 227 .
Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories:  Groups should have Read+Write access Leave owner permissions as they are  “Everyone else” should not have any access   Submit for grade: Screenshot of  /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions
⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Introduction to Linked List; Author: Neso Academy;https://www.youtube.com/watch?v=R9PTBwOzceo;License: Standard YouTube License, CC-BY
Linked list | Single, Double & Circular | Data Structures | Lec-23 | Bhanu Priya; Author: Education 4u;https://www.youtube.com/watch?v=IiL_wwFIuaA;License: Standard Youtube License