Chapter 5 Methods. Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved.

Similar documents
Chapter 5 Methods / Functions

Chapter 5 Methods. Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved.

Chapter 5 Methods. Liang, Introduction to Java Programming, Ninth Edition, (c) 2013 Pearson Education, Inc. All rights reserved.

To define methods, invoke methods, and pass arguments to a method ( ). To develop reusable code that is modular, easy-toread, easy-to-debug,

Chapter 6 Methods. Dr. Hikmat Jaber

CS110: PROGRAMMING LANGUAGE I

Chapter 5 Methods. Lecture notes for computer programming 1 Faculty of Engineering and Information Technology Prepared by: Iyad Albayouk

Chapter 5 Methods. Modifier returnvaluetype methodname(list of parameters) { // method body; }

COP3502 Programming Fundamentals for CIS Majors 1. Instructor: Parisa Rashidi

Announcements. PS 3 is due Thursday, 10/6. Midterm Exam 1: 10/14 (Fri), 9:00am-10:53am

Lecture 5: Methods CS2301

CS115 Principles of Computer Science

Opening Problem. Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively.

Opening Problem. Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively.

Chapter 6 Methods. Liang, Introduction to Java Programming, Tenth Edition, Global Edition. Pearson Education Limited

JAVA Programming Concepts

12. Numbers. Java. Summer 2008 Instructor: Dr. Masoud Yaghini

Benefits of Methods. Chapter 5 Methods

Chapter 6: Methods. Objectives 9/21/18. Opening Problem. Problem. Problem. Solution. CS1: Java Programming Colorado State University

Basic computer skills such as using Windows, Internet Explorer, and Microsoft Word. Chapter 1 Introduction to Computers, Programs, and Java

CS5000: Foundations of Programming. Mingon Kang, PhD Computer Science, Kennesaw State University

Mathematical Functions, Characters, and Strings. CSE 114, Computer Science 1 Stony Brook University

Methods. CSE 114, Computer Science 1 Stony Brook University

Chapter 4 Mathematical Functions, Characters, and Strings

Mathematical Functions, Characters, and Strings. CSE 114, Computer Science 1 Stony Brook University

CS1150 Principles of Computer Science Methods

Lecture #6-7 Methods

CS-201 Introduction to Programming with Java

CS1150 Principles of Computer Science Methods

CS-201 Introduction to Programming with Java

Chapter 4. Mathematical Functions, Characters, and Strings

Module 4: Characters, Strings, and Mathematical Functions

int sum = 0; for (int i = 1; i <= 10; i++) sum += i; System.out.println("Sum from 1 to 10 is " + sum);

JAVA PROGRAMMING LAB. ABSTRACT In this Lab you will learn to define and invoke void and return java methods

INTRODUCTION TO C++ FUNCTIONS. Dept. of Electronic Engineering, NCHU. Original slides are from

Java, Arrays and Functions Recap. CSE260, Computer Science B: Honors Stony Brook University

Functions. Functions are everywhere in C. Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

Recapitulate CSE160: Java basics, types, statements, arrays and methods

Functions. Prof. Indranil Sen Gupta. Dept. of Computer Science & Engg. Indian Institute t of Technology Kharagpur. Introduction

Expressions and operators

DUBLIN CITY UNIVERSITY

The Math Class. Using various math class methods. Formatting the values.

DUBLIN CITY UNIVERSITY

Chapter 4 Mathematical Functions, Characters, and Strings

1.1 Your First Program

Lecture 05: Methods. AITI Nigeria Summer 2012 University of Lagos.

AP CS Unit 3: Control Structures Notes

Advanced Object Concepts

Lecture 6: While Loops and the Math Class

AP Computer Science A. Return values

1.1 Your First Program! Naive ideal. Natural language instructions.

CS171:Introduction to Computer Science II

The Math Class (Outsource: Math Class Supplement) Random Numbers. Lab 06 Math Class

Using Free Functions

1.1 Your First Program

Lecture 2:- Functions. Introduction

Introduction to Computer Science Unit 2. Notes

Introduction to Computer Science Unit 2. Notes

A Foundation for Programming

Primitive Data Types: Intro

Computer Programming, I. Laboratory Manual. Experiment #7. Methods

Activity 4: Methods. Content Learning Objectives. Process Skill Goals

Functions. Autumn Semester 2009 Programming and Data Structure 1. Courtsey: University of Pittsburgh-CSD-Khalifa

JAVASCRIPT BASICS. JavaScript Math Functions. The Math functions helps you to perform mathematical tasks

Top-down programming design

AP Computer Science. Return values, Math, and double. Copyright 2010 by Pearson Education

Functions. x y z. f (x, y, z) Take in input arguments (zero or more) Perform some computation - May have side-effects (such as drawing)

Object Oriented Methods : Deeper Look Lecture Three

Downloaded from Chapter 2. Functions

Chapter 5 Methods. public class FirstMethod { public static void main(string[] args) { double x= -2.0, y; for (int i = 1; i <= 5; i++ ) { y = f( x );

1.1 Your First Program

Procedural Abstraction and Functions That Return a Value. Savitch, Chapter 4

static int min(int a, int b) Returns the smaller of two int values. static double pow(double a,

Function. specific, well-defined task. whenever it is called or invoked. A function to add two numbers A function to find the largest of n numbers

M e t h o d s a n d P a r a m e t e r s

Methods CSC 121 Fall 2016 Howard Rosenthal

A Balanced Introduction to Computer Science, 3/E

Methods CSC 121 Spring 2017 Howard Rosenthal

A Balanced Introduction to Computer Science, 3/E David Reed, Creighton University 2011 Pearson Prentice Hall ISBN

CS1150 Principles of Computer Science Methods

Programmierpraktikum

Methods CSC 121 Fall 2014 Howard Rosenthal

Building Java Programs

Methods (Deitel chapter 6)

Methods (Deitel chapter 6)

Building Java Programs

COSC 236 Section 101 Computer Science 1 -- Prof. Michael A. Soderstrand

COMP101: Introduction to Programming in JAVA. Reading: Morelli Chapter 0, Chapter 2, Chapter 3, Cohoon and Davidson Chapter 1. For pseudocode see

CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 10: OCT. 6TH INSTRUCTOR: JIAYIN WANG

Methods: A Deeper Look

CS110D: PROGRAMMING LANGUAGE I

Building Java Programs

Container Vs. Definition Classes. Container Class

Variable Manipulator Driver. Installation and Usage Guide. Revision: 1.0 Date: Monday, July 10, 2017 Authors: Alan Chow

Java Methods. Lecture 8 COP 3252 Summer May 23, 2017

Calculations, Formatting and Conversions

Building Java Programs

Advanced Computer Programming

Methods with Parameters and Return Values

C++, How to Program. Spring 2016 CISC1600 Yanjun Li 1

Transcription:

Chapter 5 Methods 1

Opening Problem Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively. 2

Problem int sum = 0; for (int i = 1; i <= 10; i++) sum += i; System.out.println("Sum from 1 to 10 is " + sum); sum = 0; for (int i = 20; i <= 30; i++) sum += i; System.out.println("Sum from 20 to 30 is " + sum); sum = 0; for (int i = 35; i <= 45; i++) sum += i; System.out.println("Sum from 35 to 45 is " + sum); 3

Problem int sum = 0; for (int i = 1; i <= 10; i++) sum += i; System.out.println("Sum from 1 to 10 is " + sum); sum = 0; for (int i = 20; i <= 30; i++) sum += i; System.out.println("Sum from 20 to 30 is " + sum); sum = 0; for (int i = 35; i <= 45; i++) sum += i; System.out.println("Sum from 35 to 45 is " + sum); 4

Solution public static int sum(int i1, int i2) { int sum = 0; for (int i = i1; i <= i2; i++) sum += i; return sum; public static void main(string[] args) { System.out.println("Sum from 1 to 10 is " + sum(1, 10)); System.out.println("Sum from 20 to 30 is " + sum(20, 30)); System.out.println("Sum from 35 to 45 is " + sum(35, 45)); 5

Objectives To define methods, invoke methods, and pass arguments to a method ( 5.2-5.5). To develop reusable code that is modular, easy-to-read, easy-todebug, and easy-to-maintain. ( 5.6). To use method overloading and understand ambiguous overloading ( 5.7). To design and implement overloaded methods ( 5.8). To determine the scope of variables ( 5.9). To know how to use the methods in the Math class ( 5.10-5.11). To learn the concept of method abstraction ( 5.12). To design and implement methods using stepwise refinement ( 5.12). 6

Defining Methods A method is a collection of statements that are grouped together to perform an operation. method header method body public static int max(int num1, int num2) { modifier int result; Define a method return value type if (num1 > num2) result = num1; result = num2; return result; method name return value formal parameters parameter list method signature Invoke a method int z = max(x, y); actual parameters (arguments) 7

Method Signature Method signature is the combination of the method name and the parameter list. method header method body public static int max(int num1, int num2) { modifier int result; Define a method return value type if (num1 > num2) result = num1; result = num2; return result; method name return value formal parameters parameter list method signature Invoke a method int z = max(x, y); actual parameters (arguments) 8

Formal Parameters The variables defined in the method header are known as formal parameters. method header method body public static int max(int num1, int num2) { modifier int result; Define a method return value type if (num1 > num2) result = num1; result = num2; return result; method name return value formal parameters parameter list method signature Invoke a method int z = max(x, y); actual parameters (arguments) 9

Actual Parameters When a method is invoked, you pass a value to the parameter. This value is referred to as actual parameter or argument. method header method body public static int max(int num1, int num2) { modifier int result; Define a method return value type if (num1 > num2) result = num1; result = num2; return result; method name return value formal parameters parameter list method signature Invoke a method int z = max(x, y); actual parameters (arguments) 10

Return Value Type A method may return a value. The returnvaluetype is the data type of the value the method returns. If the method does not return a value, the returnvaluetype is the keyword void. For example, the returnvaluetype in the main method is void. method header method body public static int max(int num1, int num2) { modifier int result; Define a method return value type if (num1 > num2) result = num1; result = num2; return result; method name return value formal parameters parameter list method signature Invoke a method int z = max(x, y); actual parameters (arguments) 11

Testing the max method Calling Methods This program demonstrates calling a method max to return the largest of the int values TestMax Run 12

animation Calling Methods, cont. pass the value of i pass the value of j public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 13

animation Trace Method Invocation i is now 5 public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 14

animation Trace Method Invocation j is now 2 public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 15

animation Trace Method Invocation invoke max(i, j) public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 16

animation Trace Method Invocation invoke max(i, j) Pass the value of i to num1 Pass the value of j to num2 public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 17

animation Trace Method Invocation declare variable result public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 18

animation Trace Method Invocation (num1 > num2) is true since num1 is 5 and num2 is 2 public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 19

animation Trace Method Invocation result is now 5 public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 20

animation Trace Method Invocation return result, which is 5 public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 21

animation Trace Method Invocation return max(i, j) and assign the return value to k public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 22

animation Trace Method Invocation Execute the print statement public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; return result; 23

CAUTION A return statement is required for a value-returning method. The method shown below in (a) is logically correct, but it has a compilation error because the Java compiler thinks it possible that this method does not return any value. public static int sign(int n) { if (n > 0) return 1; if (n == 0) return 0; if (n < 0) return 1; (a) Should be public static int sign(int n) { if (n > 0) return 1; if (n == 0) return 0; return 1; (b) To fix this problem, delete if (n < 0) in (a), so that the compiler will see a return statement to be reached regardless of how the if statement is evaluated. 24

Reuse Methods from Other Classes NOTE: One of the benefits of methods is for reuse. The max method can be invoked from any class besides TestMax. If you create a new class Test, you can invoke the max method using ClassName.methodName (e.g., TestMax.max). 25

Call Stacks Space required for the max method num2: 2 num1: 5 Space required for the max method result: 5 num2: 2 num1: 5 Space required for the main method k: j: 2 i: 5 Space required for the main method k: j: 2 i: 5 Space required for the main method k: j: 2 i: 5 Space required for the main method k: 5 j: 2 i: 5 Stack is empty (a) The main method is invoked. (b) The max method is invoked. (c) The max method is being executed. (d) The max method is finished and the return value is sent to k. (e) The main method is finished. 26

animation Trace Call Stack i is declared and initialized public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; i: 5 if (num1 > num2) result = num1; result = num2; The main method is invoked. return result; 27

animation Trace Call Stack j is declared and initialized public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; The main method is invoked. j: 2 i: 5 return result; 28

animation Trace Call Stack Declare k public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; Space required for the main method k: j: 2 i: 5 The main method is invoked. return result; 29

animation Trace Call Stack Invoke max(i, j) public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; Space required for the main method k: j: 2 i: 5 The main method is invoked. return result; 30

animation Trace Call Stack pass the values of i and j to num1 and num2 public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; num2: 2 num1: 5 Space required for the main method k: j: 2 i: 5 return result; The max method is invoked. 31

animation Trace Call Stack pass the values of i and j to num1 and num2 public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; result: num2: 2 num1: 5 Space required for the main method k: j: 2 i: 5 return result; The max method is invoked. 32

animation Trace Call Stack (num1 > num2) is true public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; result: num2: 2 num1: 5 Space required for the main method k: j: 2 i: 5 return result; The max method is invoked. 33

animation Trace Call Stack Assign num1 to result public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; Space required for the max method result: 5 num2: 2 num1: 5 Space required for the main method k: j: 2 i: 5 return result; The max method is invoked. 34

animation Trace Call Stack Return result and assign it to k public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; Space required for the max method result: 5 num2: 2 num1: 5 Space required for the main method k:5 j: 2 i: 5 return result; The max method is invoked. 35

animation Trace Call Stack Execute print statement public static void main(string[] args) { int i = 5; int j = 2; int k = max(i, j); System.out.println( "The maximum between " + i + " and " + j + " is " + k); public static int max(int num1, int num2) { int result; if (num1 > num2) result = num1; result = num2; Space required for the main method k:5 j: 2 i: 5 The main method is invoked. return result; 36

Passing Parameters public static void nprintln(string message, int n) { for (int i = 0; i < n; i++) System.out.println(message); Suppose you invoke the method using nprintln( Welcome to Java, 5); What is the output? Suppose you invoke the method using nprintln( Computer Science, 15); What is the output? 38

Pass by Value This program demonstrates passing values to the methods. Increment Run 39

Pass by Value Testing Pass by value This program demonstrates passing values to the methods. TestPassByValue Run 40

Pass by Value, cont. The values of num1 and num2 are passed to n1 and n2. Executing swap does not affect num1 and num2. Space required for the swap method temp: n2: 2 n1: 1 Space required for the main method num2: 2 num1: 1 Space required for the main method num2: 2 num1: 1 Space required for the main method num2: 2 num1: 1 Stack is empty The main method is invoked The swap method is invoked The swap method is finished The main method is finished 41

Modularizing Code Methods can be used to reduce redundant coding and enable code reuse. Methods can also be used to modularize code and improve the quality of the program. GreatestCommonDivisorMethod Run PrimeNumberMethod Run 42

Overloading Methods Overloading the max Method public static double max(double num1, double num2) { if (num1 > num2) return num1; return num2; TestMethodOverloading Run 43

Ambiguous Invocation Sometimes there may be two or more possible matches for an invocation of a method, but the compiler cannot determine the most specific match. This is referred to as ambiguous invocation. Ambiguous invocation is a compilation error. 44

Ambiguous Invocation public class AmbiguousOverloading { public static void main(string[] args) { System.out.println(max(1, 2)); public static double max(int num1, double num2) { if (num1 > num2) return num1; return num2; public static double max(double num1, int num2) { if (num1 > num2) return num1; return num2; 45

Scope of Local Variables A local variable: a variable defined inside a method. Scope: the part of the program where the variable can be referenced. The scope of a local variable starts from its declaration and continues to the end of the block that contains the variable. A local variable must be declared before it can be used. 47

Scope of Local Variables, cont. You can declare a local variable with the same name multiple times in different nonnesting blocks in a method, but you cannot declare a local variable twice in nested blocks. 48

Scope of Local Variables, cont. A variable declared in the initial action part of a for loop header has its scope in the entire loop. But a variable declared inside a for loop body has its scope limited in the loop body from its declaration and to the end of the block that contains the variable. The scope of i The scope of j public static void method1() {.. for (int i = 1; i < 10; i++) {.. int j;... 49

Scope of Local Variables, cont. It is fine to declare i in two non-nesting blocks public static void method1() { int x = 1; int y = 1; for (int i = 1; i < 10; i++) { x += i; for (int i = 1; i < 10; i++) { y += i; It is wrong to declare i in two nesting blocks public static void method2() { int i = 1; int sum = 0; for (int i = 1; i < 10; i++) sum += i; 50

Scope of Local Variables, cont. // Fine with no errors public static void correctmethod() { int x = 1; int y = 1; // i is declared for (int i = 1; i < 10; i++) { x += i; // i is declared again for (int i = 1; i < 10; i++) { y += i; 51

Scope of Local Variables, cont. // With no errors public static void incorrectmethod() { int x = 1; int y = 1; for (int i = 1; i < 10; i++) { int x = 0; x += i; 52

Method Abstraction You can think of the method body as a black box that contains the detailed implementation for the method. Optional arguments for Input Optional return value Method Header Method body Black Box 53

Benefits of Methods Write a method once and reuse it anywhere. Information hiding. Hide the implementation from the user. Reduce complexity. 54

Class constants: PI E Class methods: The Math Class Trigonometric Methods Exponent Methods Rounding Methods min, max, abs, and random Methods 55

Trigonometric Methods sin(double a) cos(double a) tan(double a) acos(double a) asin(double a) atan(double a) Radians Examples: Math.sin(0) returns 0.0 Math.sin(Math.PI / 6) returns 0.5 Math.sin(Math.PI / 2) returns 1.0 Math.cos(0) returns 1.0 Math.cos(Math.PI / 6) returns 0.866 Math.cos(Math.PI / 2) returns 0 toradians(90) 56

Exponent Methods exp(double a) Returns e raised to the power of a. log(double a) Returns the natural logarithm of a. log10(double a) Returns the 10-based logarithm of a. pow(double a, double b) Returns a raised to the power of b. Examples: Math.exp(1) returns 2.71 Math.log(2.71) returns 1.0 Math.pow(2, 3) returns 8.0 Math.pow(3, 2) returns 9.0 Math.pow(3.5, 2.5) returns 22.91765 Math.sqrt(4) returns 2.0 Math.sqrt(10.5) returns 3.24 sqrt(double a) Returns the square root of a. 57

Rounding Methods double ceil(double x) x rounded up to its nearest integer. This integer is returned as a double value. double floor(double x) x is rounded down to its nearest integer. This integer is returned as a double value. double rint(double x) x is rounded to its nearest integer. If x is equally close to two integers, the even one is returned as a double. int round(float x) Return (int)math.floor(x+0.5). long round(double x) Return (long)math.floor(x+0.5). 58

Rounding Methods Examples Math.ceil(2.1) returns 3.0 Math.ceil(2.0) returns 2.0 Math.ceil(-2.0) returns 2.0 Math.ceil(-2.1) returns -2.0 Math.floor(2.1) returns 2.0 Math.floor(2.0) returns 2.0 Math.floor(-2.0) returns 2.0 Math.floor(-2.1) returns -3.0 Math.rint(2.1) returns 2.0 Math.rint(2.0) returns 2.0 Math.rint(-2.0) returns 2.0 Math.rint(-2.1) returns -2.0 Math.rint(2.5) returns 2.0 Math.rint(-2.5) returns -2.0 Math.round(2.6f) returns 3 Math.round(2.0) returns 2 Math.round(-2.0f) returns -2 Math.round(-2.6) returns -3 59

min, max, and abs max(a, b)and min(a, b) Returns the maximum or minimum of two parameters. abs(a) Returns the absolute value of the parameter. random() Returns a random double value in the range [0.0, 1.0). Examples: Math.max(2, 3) returns 3 Math.max(2.5, 3) returns 3.0 Math.min(2.5, 3.6) returns 2.5 Math.abs(-2) returns 2 Math.abs(-2.1) returns 2.1 60

The random Method Generates a random double value greater than or equal to 0.0 and less than 1.0 (0 <= Math.random() < 1.0). Examples: (int)(math.random() * 10) 50 + (int)(math.random() * 50) Returns a random integer between 0 and 9. Returns a random integer between 50 and 99. In general, a + Math.random() * b Returns a random number between a and a + b, excluding a + b. 61