CSC 1051 – Data Structures and Algorithms I
description
Transcript of CSC 1051 – Data Structures and Algorithms I
![Page 1: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/1.jpg)
CSC 1051 – Data Structures and Algorithms I
Dr. Mary-Angela Papalaskari
Department of Computing Sciences
Villanova University
Course website:
www.csc.villanova.edu/~map/1051/CSC 1051 M.A. Papalaskari, Villanova University
Algorithms and Conditionals
![Page 2: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/2.jpg)
Problem from Lab 2
Statement of GPA problem:
Write a program that reads the credits and quality points earned and outputs the gpa.Algorithm:
variables: qp, credits, gpa
1. Input qp
2. Input credits
3. gpa = qp / credits
4. Print gpa
CSC 1051 M.A. Papalaskari, Villanova University
![Page 3: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/3.jpg)
Solution 5
import java.util.Scanner;
public class GPA05
{
public static void main (String[] args)
{
int qp;
int credits;
double gpa;
Scanner scan = new Scanner(System.in);
// get input
System.out.print ("Enter Quality Points > ");
qp = scan.nextInt();
System.out.print ("Enter Credits > ");
credits = scan.nextInt();
// calculate gpa
gpa = (double) qp / credits;
// output information
System.out.println (“\nQuality Points: " + qp);
System.out.println ("Credits: " + credits);
System.out.println (“\n\tGPA: " + gpa);
}
}
Algorithm:variables: qp, credits, gpa1. Input qp2. Input credits3. gpa = qp / credits4. Print gpa
CSC 1051 M.A. Papalaskari, Villanova University
![Page 4: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/4.jpg)
Pseudocode: a way to describe what an algorithm does without writing a program.
Algorithm:variables: qp, credits, gpa1. Input qp2. Input credits3. gpa = qp / credits4. Print gpa
CSC 1051 M.A. Papalaskari, Villanova University
![Page 5: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/5.jpg)
Writing an algorithm in pseudocode• List the variables used. • List the steps for
solving the problem, in order.
• Try to be brief and unambiguous; use Java expressions only when it is simpler to specify a step in java than in English.
CSC 1051 M.A. Papalaskari, Villanova University
Algorithm:variables: qp, credits, gpa 1. Input qp
2. Input credits
3. gpa = qp / credits
4. Print gpa
![Page 6: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/6.jpg)
Writing an algorithm in pseudocode• List the variables used. • List the steps for
solving the problem, in order.
• Try to be brief and unambiguous; use Java expressions only when it is simpler to specify a step in java than in English.
CSC 1051 M.A. Papalaskari, Villanova University
Algorithm:variables: qp, credits, gpa (use floating point)
1. Input qp
2. Input credits
3. gpa = qp / credits (Note: use floating point division)
4. Print gpa
When the type is not obvious you can add a note.
![Page 7: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/7.jpg)
Let’s write algorithms for some of the other problems from Lab 2
CSC 1051 M.A. Papalaskari, Villanova University
2.8 Write an application that reads values representing a time duration in hours, minutes, and seconds and then prints the equivalent total number of seconds. (For example, 1 hour, 28 minutes, and 42 seconds is equivalent to 5322 seconds.)
![Page 8: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/8.jpg)
Let’s write algorithms for some of the other problems from Lab 2
CSC 1051 M.A. Papalaskari, Villanova University
2.9 Create a version of the previous project that reverses the computation. That is, read a value representing a number of seconds, then print the equivalent amount of time as a combination of hours, minutes, and seconds. (For example, 9999 seconds is equivalent to 2 hours, 46 minutes, and 39 seconds.)
The next 3 slides will help us visualize this problem.
![Page 9: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/9.jpg)
How many of each can you pack in the black box?
![Page 10: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/10.jpg)
How many of each can you pack in the black box?
![Page 11: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/11.jpg)
How many of each can you pack in the black box?
![Page 12: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/12.jpg)
Topic Thread• 2.1 Character Strings• 2.2 Variables, Assignment• 2.3 Data Types, in particular int, double• 2.4 Expressions (simple)• 2.5 Data Conversion• 2.6 Interactive Programs• 5.1 Boolean Expressions• 5.2 The if Statement• 5.5 The while Statement
CSC 1051 M.A. Papalaskari, Villanova University
![Page 13: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/13.jpg)
Solution 5
import java.util.Scanner;
public class GPA05
{
public static void main (String[] args)
{
int qp;
int credits;
double gpa;
Scanner scan = new Scanner(System.in);
// get input
System.out.print ("Enter Quality Points > ");
qp = scan.nextInt();
System.out.print ("Enter Credits > ");
credits = scan.nextInt();
// calculate gpa
gpa = (double) qp / credits;
// output information
System.out.println (“\nQuality Points: " + qp);
System.out.println ("Credits: " + credits);
System.out.println (“\n\tGPA: " + gpa);
}
}
Algorithm:variables: qp, credits, gpa1. Input qp2. Input credits3. gpa = qp / credits4. Print gpa
CSC 1051 M.A. Papalaskari, Villanova University
![Page 14: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/14.jpg)
Solution 5
import java.util.Scanner;
public class GPA05
{
public static void main (String[] args)
{
int qp;
int credits;
double gpa;
Scanner scan = new Scanner(System.in);
// get input
System.out.print ("Enter Quality Points > ");
qp = scan.nextInt();
System.out.print ("Enter Credits > ");
credits = scan.nextInt();
// calculate gpa
gpa = (double) qp / credits;
// output information
System.out.println (“\nQuality Points: " + qp);
System.out.println ("Credits: " + credits);
System.out.println (“\n\tGPA: " + gpa);
}
}
Algorithm:variables: qp, credits, gpa1. Input qp2. Input credits3. gpa = qp / credits4. Print gpa
What if credits = 0????
CSC 1051 M.A. Papalaskari, Villanova University
![Page 15: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/15.jpg)
Solution 6Algorithm:variables: qp, credits, gpa1. Input qp2. Input credits3. if credits = 0
• Print “No gpa yet”else
• gpa = qp / credits• Print gpa
4. Print goodbye message
CSC 1051 M.A. Papalaskari, Villanova University
![Page 16: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/16.jpg)
Solution 6Algorithm:variables: qp, credits, gpa1. Input qp2. Input credits3. if credits = 0
• Print “No gpa yet”else
• gpa = qp / credits• Print gpa
4. Print goodbye messageif (credits == 0)
System.out.println (“\n\tGPA: None");
else
{
gpa = (double) qp / credits;
System.out.println (“\n\tGPA: " + gpa);
}
CSC 1051 M.A. Papalaskari, Villanova University
![Page 17: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/17.jpg)
Order of statement execution
• Unless specified otherwise, the flow of control through a method is linear
• ie, statements are executed in the order they appear
• We can modify this using conditional and repetition statements
CSC 1051 M.A. Papalaskari, Villanova University
![Page 18: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/18.jpg)
Conditional statements• Conditional statements depart from linear flow of
control:• Example:
if (credits == 0)
System.out.println ("GPA: None");
CSC 1051 M.A. Papalaskari, Villanova University
A boolean expression
![Page 19: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/19.jpg)
Topic Thread• 2.1 Character Strings• 2.2 Variables, Assignment• 2.3 Data Types, in particular int, double• 2.4 Expressions (simple)• 2.5 Data Conversion• 2.6 Interactive Programs• 5.1 Boolean Expressions• 5.2 The if Statement• 5.5 The while Statement
CSC 1051 M.A. Papalaskari, Villanova University
![Page 20: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/20.jpg)
5.1 Boolean Expressions
• A condition often uses one of Java's equality operators or relational operators, which all return boolean results:
== equal to
!= not equal to
< less than
> greater than
<= less than or equal to
>= greater than or equal to
• Note the difference between the equality operator (==) and the assignment operator (=)
CSC 1051 M.A. Papalaskari, Villanova University
![Page 21: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/21.jpg)
Boolean Expressions• A boolean value represents a true or false condition
• The reserved words true and false are the only valid values for a boolean type
• Example boolean declaration:
boolean aboveAgeLimit = false;
• Another example:
boolean usePlural = quarters > 1;
A boolean expression using a relational operator
CSC 1051 M.A. Papalaskari, Villanova University
![Page 22: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/22.jpg)
Example• An if statement with its boolean condition:
if (miles > 1) System.out.print("s");
• Another way, using a boolean variable:
boolean usePlural = miles > 1;
if (usePlural)
System.out.print("s");
• See also Age.java
CSC 1051 M.A. Papalaskari, Villanova University
![Page 23: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/23.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
//********************************************************************// Age.java Author: Lewis/Loftus//// Demonstrates the use of an if statement.//********************************************************************
import java.util.Scanner;
public class Age{ //----------------------------------------------------------------- // Reads the user's age and prints comments accordingly. //----------------------------------------------------------------- public static void main (String[] args) { final int MINOR = 21;
Scanner scan = new Scanner (System.in);
System.out.print ("Enter your age: "); int age = scan.nextInt();
continue
![Page 24: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/24.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
continue
System.out.println ("You entered: " + age);
if (age < MINOR) System.out.println ("Youth is a wonderful thing. Enjoy.");
System.out.println ("Age is a state of mind."); }}
![Page 25: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/25.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
continue
System.out.println ("You entered: " + age);
if (age < MINOR) System.out.println ("Youth is a wonderful thing. Enjoy.");
System.out.println ("Age is a state of mind."); }}
Sample RunEnter your age: 47You entered: 47Age is a state of mind.
Another Sample RunEnter your age: 12You entered: 12Youth is a wonderful thing. Enjoy.Age is a state of mind.
![Page 26: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/26.jpg)
The if Statement• Let's now look at the if statement in more detail• The if statement has the following syntax:
if ( condition ) statement;
if is a Javareserved word
The condition must be aboolean expression. It mustevaluate to either true or false.
If the condition is true, the statement is executed.If it is false, the statement is skipped.
CSC 1051 M.A. Papalaskari, Villanova University
![Page 27: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/27.jpg)
Logic of an if statement
conditionevaluated
statement
truefalse
CSC 1051 M.A. Papalaskari, Villanova University
![Page 28: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/28.jpg)
Indentation
• The statement controlled by the if statement is indented to indicate that relationship
• The use of a consistent indentation style makes a program easier to read and understand
• The compiler ignores indentation
CSC 1051 M.A. Papalaskari, Villanova University
![Page 29: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/29.jpg)
The if-else Statement• An else clause can be added to an if statement to
make an if-else statement
if ( condition ) statement1;else statement2;
• If the condition is true, statement1 is executed; if the condition is false, statement2 is executed
• One or the other will be executed, but not both
• See Wages.java
CSC 1051 M.A. Papalaskari, Villanova University
![Page 30: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/30.jpg)
Example: Calculating wages with overtime
Variables:• hours, pay
Algorithm:
CSC 1051 M.A. Papalaskari, Villanova University
![Page 31: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/31.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
//********************************************************************// Wages.java Author: Lewis/Loftus//// Demonstrates the use of an if-else statement.//********************************************************************
import java.text.NumberFormat;import java.util.Scanner;
public class Wages{ //----------------------------------------------------------------- // Reads the number of hours worked and calculates wages. //----------------------------------------------------------------- public static void main (String[] args) { final double RATE = 8.25; // regular pay rate final int STANDARD = 40; // standard hours in a work week
Scanner scan = new Scanner (System.in);
double pay = 0.0;
continue
![Page 32: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/32.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
continue
System.out.print ("Enter the number of hours worked: "); int hours = scan.nextInt();
System.out.println ();
// Pay overtime at "time and a half" if (hours > STANDARD) pay = STANDARD * RATE + (hours-STANDARD) * (RATE * 1.5); else pay = hours * RATE;
NumberFormat fmt = NumberFormat.getCurrencyInstance(); System.out.println ("Gross earnings: " + fmt.format(pay)); }}
![Page 33: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/33.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
continue
System.out.print ("Enter the number of hours worked: "); int hours = scan.nextInt();
System.out.println ();
// Pay overtime at "time and a half" if (hours > STANDARD) pay = STANDARD * RATE + (hours-STANDARD) * (RATE * 1.5); else pay = hours * RATE;
NumberFormat fmt = NumberFormat.getCurrencyInstance(); System.out.println ("Gross earnings: " + fmt.format(pay)); }}
Sample RunEnter the number of hours worked: 46
Gross earnings: $404.25
![Page 34: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/34.jpg)
Logic of an if-else statement
conditionevaluated
statement1
true false
statement2
CSC 1051 M.A. Papalaskari, Villanova University
![Page 35: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/35.jpg)
Block Statements
• Several statements can be grouped together into a block statement delimited by braces
• A block statement can be used wherever a statement is called for in the Java syntax rules
if (total > MAX){ System.out.println ("Error!!"); errorCount++;}
CSC 1051 M.A. Papalaskari, Villanova University
![Page 36: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/36.jpg)
Block Statements• The if clause, or the else clause, or both, could
govern block statements
if (total > MAX){ System.out.println ("Error!!"); errorCount++;}else{ System.out.println ("Total: " + total); current = total*2;}
CSC 1051 M.A. Papalaskari, Villanova University
![Page 37: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/37.jpg)
Indentation Revisited
• Remember that indentation is for the human reader, and is ignored by the computer
if (total > MAX) System.out.println ("Error!!"); errorCount = errorcount + 1;;
Despite what is implied by the indentation, the increment will occur whether the condition is true or not
CSC 1051 M.A. Papalaskari, Villanova University
![Page 38: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/38.jpg)
Logical Operators• Boolean expressions can also use the following
logical operators:
! Logical NOT&& Logical AND|| Logical OR
• They all take boolean operands and produce boolean results
• Logical NOT is a unary operator (it operates on one operand)
• Logical AND and logical OR are binary operators (each operates on two operands)
CSC 1051 M.A. Papalaskari, Villanova University
![Page 39: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/39.jpg)
Logical NOT
• The logical NOT operation is also called logical negation or logical complement
• If some boolean condition a is true, then !a is false; if a is false, then !a is true
• Logical expressions can be shown using a truth table:
CSC 1051 M.A. Papalaskari, Villanova University
a !a
true false
false true
![Page 40: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/40.jpg)
Logical AND and Logical OR• The logical AND expression
a && b
is true if both a and b are true, and false otherwise
• The logical OR expression
a || b
is true if a or b or both are true, and false otherwise
CSC 1051 M.A. Papalaskari, Villanova University
![Page 41: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/41.jpg)
Logical AND and Logical OR• A truth table shows all possible true-false
combinations of the terms
• Since && and || each have two operands, there are four possible combinations of conditions a and b
CSC 1051 M.A. Papalaskari, Villanova University
a b a && b a || b
true true true true
true false false true
false true false true
false false false false
![Page 42: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/42.jpg)
Logical Operators• Expressions that use logical operators can form
complex conditions
if (total < MAX+5 && !found) System.out.println ("Processing…");
• All logical operators have lower precedence than the relational operators
• The ! operator has higher precedence than && and ||
CSC 1051 M.A. Papalaskari, Villanova University
![Page 43: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/43.jpg)
Boolean Expressions• Specific expressions can be evaluated using truth
tables – let’s try this one:
CSC 1051 M.A. Papalaskari, Villanova University
total < MAX found !found total < MAX && !found
false false true
false true false
true false true
true true false
![Page 44: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/44.jpg)
Quick Check
CSC 1051 M.A. Papalaskari, Villanova University
What do the following statements do?
if (total != stock + warehouse) inventoryError = true;
if (found || !done) System.out.println("Ok");
![Page 45: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/45.jpg)
How much of a boolean expression do we need to evaluate before determining its value?*** Short-Circuited Operators• The processing of && and || is “short-circuited” in
cases where the left operand is sufficient to determine the result (the right operand is not evaluated at all)
• This can be both useful and dangerous!
if (count != 0 && total/count > MAX) System.out.println ("Testing.");
CSC 1051 M.A. Papalaskari, Villanova University
![Page 46: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/46.jpg)
Nested if Statements• The statement executed as a result of an if or else clause could be another if statement
• These are called nested if statements
• An else clause is matched to the last unmatched if (no matter what the indentation implies)
• Braces can be used to specify the if statement to which an else clause belongs
• See MinOfThree.java
CSC 1051 M.A. Papalaskari, Villanova University
![Page 47: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/47.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
//********************************************************************// MinOfThree.java Author: Lewis/Loftus//// Demonstrates the use of nested if statements.//********************************************************************
import java.util.Scanner;
public class MinOfThree{ //----------------------------------------------------------------- // Reads three integers from the user and determines the smallest // value. //----------------------------------------------------------------- public static void main (String[] args) { int num1, num2, num3, min = 0;
Scanner scan = new Scanner (System.in);
System.out.println ("Enter three integers: "); num1 = scan.nextInt(); num2 = scan.nextInt(); num3 = scan.nextInt();
continue
![Page 48: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/48.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
continue
if (num1 < num2) if (num1 < num3) min = num1; else min = num3; else if (num2 < num3) min = num2; else min = num3;
System.out.println ("Minimum value: " + min); }}
![Page 49: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/49.jpg)
CSC 1051 M.A. Papalaskari, Villanova University
continue
if (num1 < num2) if (num1 < num3) min = num1; else min = num3; else if (num2 < num3) min = num2; else min = num3;
System.out.println ("Minimum value: " + min); }}
Sample RunEnter three integers:84 69 90Minimum value: 69
![Page 50: CSC 1051 – Data Structures and Algorithms I](https://reader035.fdocuments.us/reader035/viewer/2022062520/56815b2c550346895dc8f4a3/html5/thumbnails/50.jpg)
Homework• Read Sections 5.1, 5.2
– Always do all self-review exercises when you review material
• Do Exercises EX 5.1 – 5.5
CSC 1051 M.A. Papalaskari, Villanova University