Scribd
Upload
2 views64 pages

Java Chapter3

Chapter 3 of 'JAVA: An Introduction to Problem Solving & Programming' covers flow of control, including boolean expressions, comparison operators, and branching statements like if-else and switch. It emphasizes the importance of using the correct operators for comparing primitive types and objects, particularly strings, and explains the concept of short-circuit evaluation. The chapter also discusses naming conventions for boolean variables and the structure of if statements.

Uploaded by

kadirgonullu8925
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views64 pages

Java Chapter3

Chapter 3 of 'JAVA: An Introduction to Problem Solving & Programming' covers flow of control, including boolean expressions, comparison operators, and branching statements like if-else and switch. It emphasizes the importance of using the correct operators for comparing primitive types and objects, particularly strings, and explains the concept of short-circuit evaluation. The chapter also discusses naming conventions for boolean variables and the structure of if statements.

Uploaded by

kadirgonullu8925
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Flow of Control

Chapter 3
Modified by James O’Reilly

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Objectives

• Compare values of primitive types


• Compare objects such as strings
• Use the primitive type boolean
• Use Boolean Operators
• Use Java branching statements
• if, if-else, if-else if-else, etc.
• switch
• Use simple enumerations in a program

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Introduction to Boolean Expressions

• The value of a boolean expression is either true


or false.
• Examples
time < limit
balance <= 0

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Java Comparison Operators

• Figure 3.4 Java Comparison Operators

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Compound Boolean Expressions with &&

• Boolean expressions can be combined using the "and"


(&&) operator.
• True if both operands are true
• False otherwise
• Example (result of comparison is a boolean value)
if ((score > 0) && (score <= 100))
...

• Not allowed
if (0 < score <= 100)
...

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Compound Boolean Expressions with ||
• Boolean expressions can be combined using the "or"
(||) operator.
• True if either operand is true
• False otherwise
• Example
if ((quantity > 5) || (cost < 10))
...

• Syntax
(Sub_Expression_1) || (Sub_Expression_2)

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Negating a Boolean Expression

• A boolean expression can be negated using the "not"


(!) operator.
• Syntax
!(Boolean_Expression)
• Example
(a || b) && !(a && b)
which is exclusive or (xor)

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Negating a Boolean Expression

• Figure 3.5 Avoiding the Negation Operator


• Why?

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Java Logical Operator examples

• Figure 3.6

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Boolean Operator Truth Table

• FIGURE 3.7 The Effect of the Boolean Operators && (and), || (or),
and ! (not) on Boolean values

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Using ==

• == is appropriate for determining if two integers or


characters have the same value.
if (a == 3)
where a is an integer type
• == is not appropriate for determining if two
floating points values are equal. Use < and some
appropriate tolerance instead because of rounding
error (remember this – common pitfall for newer
programmers).
if (abs(b - c) < epsilon)
where b, c, and epsilon are floating point types

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Using ==

• == is not appropriate for determining if two Objects,


anything not a primitive type, have the same value.
• if (s1 == s2), where s1 and s2 refer to strings, or other Objects,
determines only if s1 and s2 refer a common memory location.
• If s1 and s2 refer to strings or other objects with identical contents, but stored
in different memory locations, (s1 == s2) is false.
• This is (very) occasionally used for comparison but we have to guarantee that
memory address equality implies equality

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Comparing Strings (short version: don’t use ==)
• == compares memory addresses (whether they are
the exact same Object). This works in special contexts
but not in general.
• To test the equality of objects of class String, use
method equals.
[Link](s2)
or
[Link](s1)

• To test for equality ignoring case, use method


equalsIgnoreCase.
("Hello".equalsIgnoreCase("hello"))

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Comparing Strings (short version: don’t use ==)
[Link]("Enter two values, a and b:");
String a = [Link]();//kb is a Scanner
String b = [Link]();
[Link]("a==b is " + (a==b));
[Link]("[Link](b) is " + [Link](b));

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Lexicographic Order

• Lexicographic order is similar to alphabetical order,


but is it based on the order of the characters in the
ASCII (and Unicode) character set.
• All the digits come before all the letters.
• All the uppercase letters come before all the lower case letters.
• Very useful to compare things in programming (and establish an order like with
less than or greater than( < or > )– need it to sort efficiently).

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Lexicographic Order

• Strings consisting of alphabetical characters can be


compared using method compareTo and method
toUpperCase or method toLowerCase.
String s1 = "Hello";
String lowerS1 = [Link]();
String s2 = "hello";
if ([Link](s2)) == 0
[Link]("Equal!");

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Method compareTo

• Syntax
string_1.compareTo(string_2)
• Method compareTo returns
• a negative number if string_1 precedes string_2
• zero if the two strings are equal
• a positive number of string_2 precedes string_1.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The Type boolean

• The type boolean is a primitive type with only two


values: true and false.
• Boolean variables can make programs more readable.
if (systemsAreOK)
instead of
if((temperature <= 100) && (thrust >= 12000) &&
(cabinPressure > 30) && …)

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Boolean Expressions and Variables

• Variables, constants, and expressions of type


boolean all evaluate to either true or false.
• A boolean variable can be given the value of a boolean
expression by using an assignment operator.
boolean isPositive = (number > 0);
...
if (isPositive) ...

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Naming Boolean Variables

• Choose names such as isPositive or


systemsAreOk.
• Avoid names such as numberSign or
systemStatus.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Precedence Rules

• Parentheses should be used to indicate the order of


operations.
• When parentheses are omitted, the order of
operation is determined by precedence rules.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Precedence Rules

• Operations with higher precedence are performed


before operations with lower precedence.
• Operations with equal precedence are done left-to-
right (except for unary operations which are done
right-to-left).

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Precedence Rules
• Figure 3.9

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Precedence Rules

• In what order are the operations performed?

score < min/2 - 10 || score > 90


score < (min/2) - 10 || score > 90
score < ((min/2) - 10) || score > 90
(score < ((min/2) - 10)) || score > 90
(score < ((min/2) - 10)) || (score > 90)

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Short-circuit Evaluation

• Sometimes only part of a boolean expression needs to


be evaluated to determine the value of the entire
expression.
• If the first operand associated with an || is true, the expression is true.
• If the first operand associated with an && is false, the expression is false.

• This is called short-circuit or lazy evaluation.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Short-circuit Evaluation

• Short-circuit evaluation is not only efficient,


sometimes it is essential!
• A run-time error can result, for example, from an
attempt to divide by zero.
if ((number != 0) && (sum/number > 5))
• Complete evaluation can be achieved by substituting &
for && or | for ||.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Input and Output of Boolean Values

• Example
boolean booleanVar = false;
[Link](booleanVar);
[Link]("Enter a boolean value:");
Scanner keyboard = new Scanner([Link]);
booleanVar = [Link]();
[Link]("You entered " + booleanVar);

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Input and Output of Boolean Values

• Dialog
false
Enter a boolean value: true
true
You entered true

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Flow of Control

• Flow of control is the order in which a program


performs actions.
• Up to this point, the order has been sequential.
• A branching statement chooses between two or more
possible actions. (if and switch )
• A loop statement repeats an action until a stopping
condition occurs. (Later)

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
General if Statement Structure

if (Boolean_Expression){
Exactly 1 if
if_Statements
}
else if (Boolean_Expression){
0 to many else ifs
else_if_Statements
}
else{
else_statements 0 or 1 elses
} no Boolean_Expression
-- happens if nothing
else does before
•Boolean_Expressions are tried one after the other, top down, until one
passes
•The statement(s) for test that passed are executed. (else entered, if reached).
•None of the other statements are executed

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Simple if-else Statement

• A branching statement that chooses between two


possible actions.
• Syntax
if (Boolean_Expression)
Statement_1
else
Statement_2

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The if-else Statement
• Example

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The if-else Statement
• Figure 3.1 The Action of the if-else Statement sample program
Listing 3.1

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The if-else Statement

Sample
screen
output

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Semantics of the if-else
Statement
• Figure 3.2

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Compound (Block) Statements

• When a list of statements is enclosed in braces ({}),


they form a single compound statement.
• Syntax
{
Statement_1;
Statement_2;
…
}

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Compound Statements

• A compound statement can be used wherever a


statement can be used.
• Example
if (total > 10)
{
sum = sum + total;
total = 0;
}

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Compound Statements and Ifs

• To include multiple statements in a branch, enclose


the statements in braces.
if (count < 3)
{
total = 0;
count = 0;
}
• Generally, use the curly braces when making an if.
• Only if you absolutely sure you need a single
statement should you skip it. (This is a common
source of syntax errors for beginning programmers).

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Omitting the else Part
• FIGURE 3.3 The Semantics of an if Statement
without an else

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Nested if-else Statements

• An if-else statement can contain any sort of


statement within it.
• Nesting here means “inside”
• In particular, it can contain another if-else
statement.
• An if-else may be nested within the "if" part.
• An if-else may be nested within the "else" part.
• An if-else may be nested within both parts.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Nested Statements

• Syntax
if (Boolean_Expression_1)
if (Boolean_Expression_2)
Statement_1
else
Statement_2
else
if (Boolean_Expression_3)
Statement_3
else
Statement_4
JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Nested Statements

• Each else is paired with the nearest unmatched if.


• If used properly, indentation communicates which if
goes with which else.
• If used improperly, indentation confuses everyone.
• Braces can and should be used like parentheses to
group statements.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Nested Statements

• Subtly different forms

First Form Second Form


if (a > b) if (a > b)
{ if (c > d)
if (c > d) e = f
e = f else
} g = h;
else
// oops
g = h;
JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Multibranch if-else Statements

• Syntax
if (Boolean_Expression_1)
Statement_1
else if (Boolean_Expression_2)
Statement_2
else if (Boolean_Expression_3)
Statement_3
else if …
else
Default_Statement

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Multibranch
if-else
Statements

• Figure 3.8
Semantics

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Multibranch if-else Statements
• View sample program Listing 3.3
class Grader

Sample
screen
output

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Multibranch if-else Statements

• Equivalent code
if (score >= 90)
grade = 'A';
else if ((score >= 80) && (score < 90))
grade = 'B';
else if ((score >= 70) && (score < 80))
grade = 'C';
else if ((score >= 60) && (score < 70))
grade = 'D';
else
grade = 'F';

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Case Study – Body Mass Index

• Body Mass Index (BMI) is used to estimate the risk of


weight-related problems
• BMI = mass / height2
• Mass in kilograms, height in meters
• Health assessment if:
• BMI < 18.5 Underweight
• 18.5 ≤ BMI < 25 Normal weight
• 25 ≤ BMI < 30 Overweight
• 30 ≤ BMI Obese

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Case Study – Body Mass Index

• Algorithm
• Input height in feet & inches, weight in pounds
• Convert to meters and kilograms
• 1 lb = 2.2 kg
• 1 inch = 0.254 meters
• Compute BMI
• Output health risk using if statements

View sample program Listing 3.4


class BMI
JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The Conditional Operator

if (n1 > n2)


max = n1;
else
max = n2;
can be written as
max = (n1 > n2) ? n1 : n2;
• The ? and : together are call the conditional operator
or ternary operator.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The Conditional Operator

• (very) Occasionally allows very simple if-else logic


to be expressed succinctly.
• The conditional operator is useful with print and
println statements.
[Link]("You worked " +
((hours > 1) ? "hours" : "hour"));

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The exit Method

• Sometimes a situation arises that makes continuing


the program pointless.
• A program can be terminated normally by
[Link](0).

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The exit Method

• Example
if (numberOfWinners == 0)
{
[Link] ("Error: Dividing by zero.");
[Link] (0);
}
else
{
oneShare = payoff / numberOfWinners;
[Link] ("Each winner will receive $"
+ oneShare);
}

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Input Validation

• You should check your input to ensure that it is within a valid or


reasonable range. For example, consider a program that converts feet
to inches. You might write the following:

int feet = [Link]();


int inches = feet * 12;

• What if:
• The user types a negative number for feet?
• The user enters an unreasonable value like 100? Or a number larger than
can be stored in an int? (2,147,483,647)

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Input Validation

• Address these problems by ensuring that the entered values are


reasonable:

int feet = [Link]();


if ((feet >= 0) && (feet < 10))
{
int inches = feet * 12;
...
}

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The switch Statement

• The switch statement is a mutltiway branch that


makes a decision based on an integral (integer or
character) expression.
• Java 7 allows String expressions
• The switch statement begins with the keyword
switch followed by an integral expression in
parentheses and called the controlling expression.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The switch Statement

• A list of cases follows, enclosed in braces.


• Each case consists of the keyword case followed
by
• A constant called the case label
• A colon
• A list of statements.
• The list is searched for a case label matching the
controlling expression.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The switch Statement

• The action associated with a matching case label is executed.


• If no match is found, the case labeled default is executed.
• The default case is optional, but recommended, even if it simply prints a
message.
• Repeated case labels are not allowed.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The switch Statement

• Syntax
switch (Controlling_Expression)
{
case Case_Label:
Statement(s);
break;
case Case_Label:
…
default:
…
}

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The switch Statement
• View sample program Listing 3.5
class MultipleBirths

Sample
screen
output

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
The switch Statement

• The action for each case typically ends with the word
break.
• The optional break statement prevents the
consideration of other cases.
• The controlling expression can be anything that
evaluates to an integral type.

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Enumerations

• Consider a need to restrict contents of a variable to certain values


• An enumeration lists the values a variable can have
• Adds clarity to code. Allows us to group constants and give
meaningful names.
• Example
enum MovieRating {E, A, B}

MovieRating rating;
rating = MovieRating.A;

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Enumerations

• Now possible to use in a switch statement

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved
Enumerations

• An even better choice of descriptive identifiers for the constants

enum MovieRating
{EXCELLENT, AVERAGE, BAD}
rating = [Link];

case EXCELLENT: ...

JAVA: An Introduction to Problem Solving & Programming, 7th Ed. By Walter Savitch
ISBN 0133862119 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved

You might also like