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

Expert Solution & Answer
Book Icon
Chapter 9.1, Problem 5STQ

Explanation of Solution

Changing statements inside “if” block:

The output of the program will not get affected if the statements inside the “if” block is replaced by the given statements, because, the modified part is same like the original program.

Changed program of Listing 9.2:

The modified statement is highlighted below.

//Import required package

import java.util.Scanner;

//Define a class

public class Main

{

    //Define the main method

    public static void main(String[] args)

    {

        Scanner keyboard = new Scanner(System.in);

        //Try block

        try

        {

            //Get the number of donuts

System.out.println("Enter number of donuts:");

            int donutCount = keyboard.nextInt();

            //Get the number of glasses of milk

System.out.println("Enter number of glasses of milk:");

            int milkCount = keyboard.nextInt();

            //Check if milkCount is less than 1

            if(milkCount < 1)

            {

                //Create an exception

Exception e = new Exception("Exception: No milk!");

                //Throw the exception

                throw e;

            }

            //Calculate donuts per glass

double donutsPerGlass = donutCount / (double)milkCount;

            //Print the donuts count

System...

Blurred answer
Students have asked these similar questions
We are considering the RSA encryption scheme. The involved numbers are small, so the communication is insecure.  Alice's public key (n,public_key) is (247,7). A code breaker manages to factories  247 = 13 x 19  Determine Alice's secret key. To solve the problem, you need not use the extended Euclid algorithm, but you may assume that her private key is one of the following numbers 31,35,55,59,77,89.
Consider the following Turing Machine (TM). Does the TM halt if it begins on the empty tape? If it halts, after how many steps? Does the TM halt if it begins on a tape that contains a single letter A followed by blanks? Justify your answer.
Pllleasassseee ssiiirrrr soolveee thissssss questionnnnnnn

Chapter 9 Solutions

Java: An Introduction to Problem Solving and Programming (7th Edition)

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