Tariq Daradkeh

Spring 2026

CS310 Advanced Programming Language – JAVA

Chapter 6 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;
[Link]("Sum from 1 to 10 is " + sum);

sum = 0;
for (int i = 20; i <= 30; i++)
sum += i;
[Link]("Sum from 20 to 30 is " + sum);

sum = 0;
for (int i = 35; i <= 45; i++)
sum += i;
[Link]("Sum from 35 to 45 is " + sum);

3
 Problem
int sum = 0;
for (int i = 1; i <= 10; i++)
sum += i;
[Link]("Sum from 1 to 10 is " + sum);

sum = 0;
for (int i = 20; i <= 30; i++)
sum += i;
[Link]("Sum from 20 to 30 is " + sum);

sum = 0;
for (int i = 35; i <= 45; i++)
sum += i;
[Link]("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;
MethodDemo

MethodDemo
}

public static void main(String[] args) {

[Link]("Sum from 1 to 10 is " + sum(1, 10));
[Link]("Sum from 20 to 30 is " + sum(20, 30));
[Link]("Sum from 35 to 45 is " + sum(35, 45));
}

5
 Defining Methods

A method is a collection of statements that are

grouped together to perform an operation.
Define a method Invoke a method

int z = max(x, y);

public static int max(int num1, int num2) {
actual parameters
int result; (arguments)

if (num1 > num2)

result = num1;
else
result = num2;

return result;
}

6
 Defining Methods

A method is a collection of statements that are

grouped together to perform an operation.
Define a method Invoke a method

return value method formal

modifier type name parameters
int z = max(x, y);
method
public static int max(int num1, int num2) {
header
actual parameters
int result; (arguments)
method
body parameter list
if (num1 > num2)
result = num1;
else
method
result = num2; signature

return result; return value

}

7
 Method Signature

Method signature is the combination of the method name and the

parameter list.

Define a method Invoke a method

return value method formal

modifier type name parameters
int z = max(x, y);
method
public static int max(int num1, int num2) {
header
actual parameters
int result; (arguments)
method
body parameter list
if (num1 > num2)
result = num1;
else
method
result = num2; signature

return result; return value

}

8
 Formal Parameters

The variables defined in the method header are known as

formal parameters.

Define a method Invoke a method

return value method formal

modifier type name parameters
int z = max(x, y);
method
public static int max(int num1, int num2) {
header
actual parameters
int result; (arguments)
method
body parameter list
if (num1 > num2)
result = num1;
else
method
result = num2; signature

return result; return value

}

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.

Define a method Invoke a method

return value method formal

modifier type name parameters
int z = max(x, y);
method
public static int max(int num1, int num2) {
header
actual parameters
int result; (arguments)
method
body parameter list
if (num1 > num2)
result = num1;
else
method
result = num2; signature

return result; return value

}

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.
Define a method Invoke a method

return value method formal

modifier type name parameters
int z = max(x, y);
method
public static int max(int num1, int num2) {
header
actual parameters
int result; (arguments)
method
body parameter list
if (num1 > num2)
result = num1;
else
method
result = num2; signature

return result; return value

}

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

TestMax

TestMax

12
animation

Calling Methods, cont.

pass the value of i

pass the value of j

public static void main(String[] args) { public static int max(int num1, int num2 ){
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} return result;
}

13
animation
Trace Method Invocation
i is now 5

public static void main(String[] args) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} return result;
}

14
animation
Trace Method Invocation
j is now 2

public static void main(String[] args) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} return result;
}

15
animation
Trace Method Invocation
invoke max(i, j)

public static void main(String[] args) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} 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) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} return result;
}

17
animation
Trace Method Invocation
declare variable result

public static void main(String[] args) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} 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) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} return result;
}

19
animation
Trace Method Invocation
result is now 5

public static void main(String[] args) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} return result;
}

20
animation
Trace Method Invocation
return result, which is 5

public static void main(String[] args) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} return result;
}

21
animation
Trace Method Invocation
return max(i, j) and assign the
return value to k

public static void main(String[] args) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} return result;
}

22
animation
Trace Method Invocation
Execute the print statement

public static void main(String[] args) { public static int max(int num1, int num2) {
int i = 5; int result;
int j = 2;
int k = max(i, j); if (num1 > num2)
result = num1;
[Link]( else
"The maximum between " + i + result = num2;
" and " + j + " is " + k);
} 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) { public static int sign(int n) {

if (n > 0) Should be if (n > 0)
return 1; return 1;
else if (n == 0) else if (n == 0)
return 0; return 0;
else if (n < 0) else
return –1; return –1;
} }
(a) (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 [Link] (e.g., [Link]).

25
Call Stacks

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);
[Link](
"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; The main method
else is invoked.
result = num2;

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);
[Link](
"The maximum between " + i +
" and " + j + " is " + k);
}

public static int max(int num1, int num2) { j: 2

int result; i: 5

if (num1 > num2)

result = num1; The main method
else is invoked.
result = num2;

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);
[Link](
"The maximum between " + i +
" and " + j + " is " + k);
} Space required for the
main method
k:
public static int max(int num1, int num2) { j: 2
int result; i: 5

if (num1 > num2)

result = num1; The main method
else is invoked.
result = num2;

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);
[Link](
"The maximum between " + i +
" and " + j + " is " + k);
} Space required for the
main method
k:
public static int max(int num1, int num2) { j: 2
int result; i: 5

if (num1 > num2)

result = num1; The main method
else is invoked.
result = num2;

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);
[Link](
"The maximum between " + i +
" and " + j + " is " + k); num2: 2
} num1: 5
Space required for the
public static int max(int num1, int num2) {
int result; main method
k:
if (num1 > num2) j: 2
result = num1; i: 5
else
result = num2;

return result; The max method is

} invoked.

31
 animation
Trace Call Stack

Declare result

public static void main(String[] args) {

int i = 5;
int j = 2;
int k = max(i, j);
[Link](
"The maximum between " + i + result:
" and " + j + " is " + k); num2: 2
} num1: 5
Space required for the
public static int max(int num1, int num2) {
int result; main method
k:
if (num1 > num2) j: 2
result = num1; i: 5
else
result = num2;

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);
[Link](
"The maximum between " + i + result:
" and " + j + " is " + k); num2: 2
} num1: 5
Space required for the
public static int max(int num1, int num2) {
int result; main method
k:
if (num1 > num2) j: 2
result = num1; i: 5
else
result = num2;

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);
Space required for the
[Link]( max method
"The maximum between " + i + result: 5
" and " + j + " is " + k); num2: 2
} num1: 5
Space required for the
public static int max(int num1, int num2) {
int result; main method
k:
if (num1 > num2) j: 2
result = num1; i: 5
else
result = num2;

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);
Space required for the
[Link]( max method
"The maximum between " + i + result: 5
" and " + j + " is " + k); num2: 2
} num1: 5
Space required for the
public static int max(int num1, int num2) {
int result; main method
k:5
if (num1 > num2) j: 2
result = num1; i: 5
else
result = num2;

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);
[Link](
"The maximum between " + i +
" and " + j + " is " + k);
} Space required for the
main method
k:5
public static int max(int num1, int num2) { j: 2
int result; i: 5

if (num1 > num2)

result = num1; The main method
else is invoked.
result = num2;

return result;
}

36
 void Method Example

This type of method does not return a value. The method

performs some actions.

TestVoidMethod

TestVoidMethod
TestReturnGradeMethod

TestReturnGradeMethod

37
 Passing Parameters
public static void nPrintln(String message, int n) {
for (int i = 0; i < n; i++)
[Link](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?

Can you invoke the method using

nPrintln(15, “Computer Science”);
38
Pass by Value

This program demonstrates passing values

to the methods.

Increment

Increment

39
Pass by Value

Testing Pass by value

This program demonstrates passing values
to the methods.

TestPassByValue

TestPassByValue

40
Pass by Value, cont.

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

GreatestCommonDivisorMethod
PrimeNumberMethod

PrimeNumberMethod

42
Case Study: Converting Hexadecimals to
Decimals

Write a method that converts a hexadecimal

number into a decimal number.
ABCD =>
A*16^3 + B*16^2 + C*16^1+ D*16^0
= ((A*16 + B)*16 + C)*16+D
= ((10*16 + 11)*16 + 12)*16+13 = ?
Hex2Dec

Hex2Dec

43
 Overloading Methods
Overloading the max Method

public static double max(double num1, double

num2) {
if (num1 > num2)
return num1;
else
return num2;
}

TestMethodOverloading

TestMethodOverloading

44
 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 compile error.

45
Ambiguous Invocation
public class AmbiguousOverloading {
public static void main(String[] args) {
[Link](max(1, 2));
}

public static double max(int num1, double num2) {

if (num1 > num2)
return num1;
else
return num2;
}

public static double max(double num1, int num2) {

if (num1 > num2)
return num1;
else
return num2;
}
}

46
 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 non-
nesting 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.

public static void method1() {

.
.
for (int i = 1; i < 10; i++) {
.
The scope of i .
int j;
.
The scope of j .
.
}
}

49
 Scope of Local Variables, cont.

It is fine to declare i in two It is wrong to declare i in

non-nesting blocks two nesting blocks

public static void method1() { public static void method2() {

int x = 1;
int y = 1; int i = 1;
int sum = 0;
for (int i = 1; i < 10; i++) {
x += i; for (int i = 1; i < 10; i++) {
} sum += i;
}
for (int i = 1; i < 10; i++) {
y += 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 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 Optional return

for Input value

Method Header
Black Box
Method body

53
 Benefits of Methods

• Write a method once and reuse it anywhere.

• Information hiding. Hide the implementation
from the user.
• Reduce complexity.

54
 Case Study: Generating Random Characters

Computer programs process numerical data and

characters. You have seen many examples that involve
numerical data. It is also important to understand
characters and how to process them.
As introduced in Section 4.3, each character has a unique
Unicode between 0 and FFFF in hexadecimal (65535 in
decimal). To generate a random character is to generate a
random integer between 0 and 65535 using the following
expression: (note that since 0 <= [Link]() < 1.0,
you have to add 1 to 65535.)
(int)([Link]() * (65535 + 1))

55
 Case Study: Generating Random Characters,
cont.
Now let us consider how to generate a random lowercase letter. The Unicode
for lowercase letters are consecutive integers starting from the Unicode for
'a', then for 'b', 'c', ..., and 'z'. The Unicode for 'a' is
(int)'a'
So, a random integer between (int)'a' and (int)'z' is
(int)((int)'a' + [Link]() * ((int)'z' - (int)'a' + 1)

56
 Case Study: Generating Random Characters,
cont.
Now let us consider how to generate a random lowercase letter. The Unicode
for lowercase letters are consecutive integers starting from the Unicode for
'a', then for 'b', 'c', ..., and 'z'. The Unicode for 'a' is
(int)'a'
So, a random integer between (int)'a' and (int)'z' is
(int)((int)'a' + [Link]() * ((int)'z' - (int)'a' + 1)

57
 Case Study: Generating Random Characters,
cont.
As discussed in Chapter 2, all numeric operators can be applied to the char
operands. The char operand is cast into a number if the other operand is a
number or a character. So, the preceding expression can be simplified as
follows:
'a' + [Link]() * ('z' - 'a' + 1)

So a random lowercase letter is

(char)('a' + [Link]() * ('z' - 'a' + 1))

58
 Case Study: Generating Random Characters,
cont.

To generalize the foregoing discussion, a random

character between any two characters ch1 and ch2 with
ch1 < ch2 can be generated as follows:

(char)(ch1 + [Link]() * (ch2 – ch1 + 1))

59
 The RandomCharacter Class
// [Link]: Generate random characters
public class RandomCharacter {
/** Generate a random character between ch1 and ch2 */
public static char getRandomCharacter(char ch1, char ch2) {
return (char)(ch1 + [Link]() * (ch2 - ch1 + 1));
}

/** Generate a random lowercase letter */

public static char getRandomLowerCaseLetter() {
return getRandomCharacter('a', 'z');
}

/** Generate a random uppercase letter */

public static char getRandomUpperCaseLetter() {
return getRandomCharacter('A', 'Z');
}
RandomCharacter

/** Generate a random digit character */

public static char getRandomDigitCharacter() {
RandomCharacter
return getRandomCharacter('0', '9');
TestRandomCharacter

} TestRandomCharacter
/** Generate a random character */
public static char getRandomCharacter() {
return getRandomCharacter('\u0000', '\uFFFF');
}
}
60
Stepwise Refinement (Optional)
The concept of method abstraction can be applied to the process of
developing programs. When writing a large program, you can use the
“divide and conquer” strategy, also known as stepwise refinement, to
decompose it into subproblems. The subproblems can be further
decomposed into smaller, more manageable problems.

61
PrintCalender Case Study
Let us use the PrintCalendar example to demonstrate the
stepwise refinement approach.

PrintCalendar

PrintCalendar

62
Design Diagram
printCalendar
(main)

readInput printMonth

printMonthTitle printMonthBody

getMonthName getStartDay

getTotalNumOfDays

getNumOfDaysInMonth

isLeapYear

63
Design Diagram
printCalendar
(main)

readInput printMonth

printMonthTitle printMonthBody

getMonthName getStartDay

getTotalNumOfDays

getNumOfDaysInMonth

isLeapYear

64
Design Diagram
printCalendar
(main)

readInput printMonth

printMonthTitle printMonthBody

getMonthName getStartDay

getTotalNumOfDays

getNumOfDaysInMonth

isLeapYear

65
Design Diagram
printCalendar
(main)

readInput printMonth

printMonthTitle printMonthBody

getMonthName getStartDay

getTotalNumOfDays

getNumOfDaysInMonth

isLeapYear

66
Design Diagram
printCalendar
(main)

readInput printMonth

printMonthTitle printMonthBody

getMonthName getStartDay

getTotalNumOfDays

getNumOfDaysInMonth

isLeapYear

67
Design Diagram
printCalendar
(main)

readInput printMonth

printMonthTitle printMonthBody

getMonthName getStartDay

getTotalNumOfDays

getNumOfDaysInMonth

isLeapYear

68
Design Diagram
printCalendar
(main)

readInput printMonth

printMonthTitle printMonthBody

getMonthName getStartDay

getTotalNumOfDays

getNumOfDaysInMonth

isLeapYear

69
 Implementation: Top-Down

Top-down approach is to implement one method in the

structure chart at a time from the top to the bottom. Stubs
can be used for the methods waiting to be implemented. A
stub is a simple but incomplete version of a method. The
use of stubs enables you to test invoking the method from
a caller. Implement the main method first and then use a
stub for the printMonth method. For example, let
printMonth display the year and the month in the stub.
Thus, your program may begin like this:
A Skeleton for printCalendar

A Skeleton for printCalendar

70
 Implementation: Bottom-Up

Bottom-up approach is to implement one method in the

structure chart at a time from the bottom to the top. For
each method implemented, write a test program to test it.
Both top-down and bottom-up methods are fine. Both
approaches implement the methods incrementally and
help to isolate programming errors and makes debugging
easy. Sometimes, they can be used together.

71
 Benefits of Stepwise Refinement

Simpler Program

Reusing Methods

Easier Developing, Debugging, and Testing

Better Facilitating Teamwork

72