Java: An Introduction to Problem Solving and Programming (7th Edition)
Java: An Introduction to Problem Solving and Programming (7th Edition)
7th Edition
ISBN: 9780133766264
Author: Walter Savitch
Publisher: PEARSON
bartleby

Concept explainers

bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 3, Problem 12E

Explanation of Solution

a.

Reason:

  • • The strings in switch statement can be used in Java with nested conditional statements like chained “if-else-if” statements...

Explanation of Solution

b.

Fragment of code using multibranch “if-else” statement:

//Import necessary header files

import java.util.*;

//Define the class

public class IfElseStatement

{

    //Define the "main()" function

    public static void main(String[] args)

    {

        //Variable declaration

        String enhancedLetterGrade;

        //Variable initialization

        double gradeValue = 0.0;

        //Create object for "Scanner()"

        Scanner sc = new Scanner(System.in);

        //Print the statement

        System.out.print("Enter the grade: ");

        //Get the input from the user

        enhancedLetterGrade = sc.next();

        //Check the condition

        if (enhancedLetterGrade.equals("A+"))

            //True, assign the value

            gradeValue = 4.25;

        //Check the condition

        else if (enhancedLetterGrade.equals("A"))

            //True, assign the value

            gradeValue = 4.0;

        //Check the condition

        else if (enhancedLetterGrade.equals("A-"))

            //True, assign the value

            gradeValue = 3.75;

        //Check the condition

        else if (enhancedLetterGrade.equals("B+"))

            //True, assign the value

            gradeValue = 3.25;

        //Check the condition

        else if (enhancedLetterGrade.equals("B"))

            //True, assign the value

            gradeValue = 3.0;

        //Check the condition

        else if (enhancedLetterGrade.equals("B-"))

            //True, assign the value

            gradeValue = 2.75;

        //Check the condition

        else if (enhancedLetterGrade.equals("C+"))

  //True, assign the value

            gradeValue = 2.25;

        //Check the condition

        else if (enhancedLetterGrade.equals("C"))

            //True, assign the value

            gradeValue = 2.0;

        //Check the condition

        else if (enhancedLetterGrade.equals("C-"))

            //True, assign the value

            gradeValue = 1.75;

        //Check the condition

        else if (enhancedLetterGrade.equals("D+"))

            gradeValue = 1.25;

        //Check the condition

        else if (enhancedLetterGrade.equals("D"))

            //True, assign the value

            gradeValue = 1.0;

        //Check the condition

        else if (enhancedLetterGrade.equals("D-"))

            //True, assign the value

            gradeValue = 0...

Explanation of Solution

c.

Fragment of code using nested “switch” statement:

//Import necessary header files

import java.util.*;

//Define the class

public class NestedSwitch

{

    //Define the "main()" function

    public static void main(String[] args)

    {

        //Variable declaration

        String enhancedLetterGrade;

        //Create object for "Scanner()"

        Scanner sc = new Scanner(System.in);

        //Print the statement

        System.out.print("Enter the grade: ");

        //Get the input from the user

        enhancedLetterGrade = sc.next();

        //Variable declaration and initialization

        double gradeValue = 0.0;

        char letterPart = enhancedLetterGrade.charAt(0);

        char plusPart = '0';

        //Check the condition

        if (enhancedLetterGrade.length()>1)

            //Assign the value

            plusPart = enhancedLetterGrade.charAt(1);

        //Switch statement

        switch (letterPart)

        {

        //case statement

        case 'A':

            //Assign the value

            gradeValue = 4.0;

            //Nested switch statement

            switch (plusPart)

            {

            //Case statement

            case '+':

                //Assign the value

                gradeValue += 0.25;

                //Break statement

                break;

            //Case statement

            case '-':

                //Assign the value

                gradeValue -= 0.25;

                //Break statement

                break;

            }

            //Break statement

            break;

        //Case statement

        case 'B':

            gradeValue = 3.0;

            //Nested switch statement

            switch (plusPart)

            {

            //Case statement

            case '+':

                //Assign the value

                gradeValue += 0.25;

                //Break statement

                break;

            //Case statement

            case '-':

                //Assign the value

                gradeValue -= 0.25;

                //Break statement

                break;

            }

            //Break statement

            break;

        //Case statement

        case 'C':

            //Assign the value

            gradeValue = 2.0;

            //Nested switch statement

            switch (plusPart)

            {

            //Case statement

            case '+':

                //Assign the value

                gradeValue += 0.25;

                //Break statement

                break;

                //Case statement

            case '-':

                //Assign the value

                gradeValue -= 0...

Blurred answer
Students have asked these similar questions
Create an original network topology consisting of at least seven routers and twelve links, assigning arbitrary positive weights to each link. Using this topology, apply Dijkstra's Link-State Algorithm to compute the shortest paths from a source router of your choice to all other routers in the network. Your topology must be entirely your own design and should not resemble any examples from the textbook, lecture slides, or other students' work. Al-generated topologies are not permitted. Create a PowerPoint presentation that follows the format and style of slides 11 to 23 from Lecture Slide Set 06 (LS06). You should copy those slides and make any necessary changes, additions, or deletions to reflect your own topology, shortest-path calculations, and update tables. Do not alter the original slide style, layout, or formatting.
Create an original network topology consisting of at least seven routers and twelve links, assigning arbitrary positive weights to each link. Using this topology, apply Dijkstra's Link-State Algorithm to compute the shortest paths from a source router of your choice to all other routers in the network. Your topology must be entirely your own design and should not resemble any examples from the textbook, lecture slides, or other students' work. Al-generated topologies are not permitted. Create
x3003 x3008 1110 0000 0000 1100 1110 0010 0001 0000 0101 0100 1010 0000 x3004 0010 0100 0001 0011 x3005 0110 0110 0000 0000 X3006 0110 1000 0100 0000 x3007 0001 0110 1100 0100 0111 0110 0000 What does the following LC-3 program do? Trace Step by Step, SHOW ALL YOUR WORK. x3001 x3002 0000 x3009 0001 0000 0010 0001 X300A 0001 0010 0110 0001 x300B 0001 0100 1011 1111 x300C 0000 0011 1111 1000 X300D 1111 0000 0010 0101 x300E 0000 0000 0000 0101 x300F 0000 0000 0000 0100 x3010 0000 0000 0000 0011 x3011 0000 0000 0000 0110 x3012 0000 0000 0000 0010 x3013 x3014 0000 0000 0000 0000 0000 0100 0000 0111 x3015 0000 0000 0000 0110 x3016 0000 0000 0000 1000 x3017 0000 0000 0000 0111 x3018 0000 0000 0000 0101

Additional Engineering Textbook Solutions

Find more solutions based on key concepts
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
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
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
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Constants, Variables, Data types, Keywords in C Programming Language Tutorial; Author: LearningLad;https://www.youtube.com/watch?v=d7tdL-ZEWdE;License: Standard YouTube License, CC-BY