Stack memory in Java - Mini Project: Build & Apply

Understanding Stack Memory in Java

📖 Scenario: Imagine you are organizing a stack of books on a table. You can only add or remove the top book. This is similar to how stack memory works in Java, where data is stored and accessed in a last-in, first-out order.

🎯 Goal: You will create a simple Java program that uses local variables to demonstrate how stack memory stores values during method calls.

📋 What You'll Learn

Create a method with local variables

Call the method from main

Print the values of local variables

Understand how stack memory holds method data

💡 Why This Matters

🌍 Real World

Understanding stack memory helps programmers write efficient code and debug errors related to variable scope and method calls.

💼 Career

Knowledge of stack memory is essential for software developers, especially when working with method calls, recursion, and memory management.

1

Create the main method and a method called showStack

Write a Java class named StackDemo with a main method. Inside the class, create a method called showStack that takes no parameters and returns void.

Java

public class StackDemo {
    public static void main(String[] args) {
        // Your code here
    }

    // Define showStack method here
    // Your code here
}

Hint

Remember to define the class first, then add the main method and the showStack method inside the class.

2

Add local variables inside showStack

Inside the showStack method, create two local variables: an int named number with value 10, and a String named text with value "Stack Memory".

Java

public class StackDemo {
    public static void main(String[] args) {
        // Method call will be added later
    }

    public static void showStack() {
        int number = 10;
        String text = "Stack Memory";
        // Your code here
    }
}

Hint

Local variables are declared inside methods. Use int number = 10; and String text = "Stack Memory";.

3

Call showStack from main and print local variables

In the main method, call the showStack method. Then, inside showStack, add two System.out.println statements to print the values of number and text.

Java

public class StackDemo {
    public static void main(String[] args) {
        showStack();
        // Your code here
    }

    public static void showStack() {
        int number = 10;
        String text = "Stack Memory";
        System.out.println(number);
        System.out.println(text);
        // Your code here
    }
}

Hint

Call showStack(); inside main. Use System.out.println(number); and System.out.println(text); inside showStack.

4

Run the program and observe the output

Run the program. It should print the values of number and text on separate lines.

Java

public class StackDemo {
    public static void main(String[] args) {
        showStack();
        // Your code here
    }

    public static void showStack() {
        int number = 10;
        String text = "Stack Memory";
        System.out.println(number);
        System.out.println(text);
    }
}

Hint

The program prints the local variables stored in stack memory. You should see 10 and Stack Memory on separate lines.

Practice

1. What does stack memory primarily store in Java?

easy

A. Method calls and local variables

B. Objects and class variables

C. Static variables and constants

D. Files and network connections

Solution

1. Step 1: Understand stack memory role

   Stack memory stores data related to method execution like local variables and method calls.

2. Step 2: Differentiate from heap memory

   Heap stores objects, while stack stores method calls and local variables.

3. Final Answer:

   Method calls and local variables -> Option A

4. Quick Check:

   Stack memory = method calls + local variables [OK]

Hint: Stack = method calls + local variables [OK]

Common Mistakes:

• Confusing stack with heap memory
• Thinking objects are stored in stack
• Mixing static variables with stack data

2. Which of the following is the correct way to declare a local variable inside a method in Java?

easy

A. static int x = 10;

B. local int x = 10;

C. var int x = 10;

D. int x = 10;

Solution

1. Step 1: Recall local variable syntax

   Local variables inside methods are declared simply with type and name, e.g., int x = 10;

2. Step 2: Identify invalid keywords

   Keywords like 'local' or 'var int' are invalid in Java, and 'static' is not allowed for local variables.

3. Final Answer:

   int x = 10; -> Option D

4. Quick Check:

   Local variable syntax = type + name + value [OK]

Hint: Local vars: type name = value; no extra keywords [OK]

Common Mistakes:

• Using 'local' keyword which doesn't exist
• Trying to use 'static' inside methods
• Confusing 'var' usage in older Java versions

3. What will be the output of this Java code?

public class Test {
  public static void main(String[] args) {
    int a = 5;
    int b = 10;
    int c = add(a, b);
    System.out.println(c);
  }
  public static int add(int x, int y) {
    return x + y;
  }
}

medium

A. 15

B. 510

C. Compilation error

D. Runtime error

Solution

1. Step 1: Trace method calls and parameters

   Main calls add(5, 10), passing values 5 and 10 as local variables on the stack.

2. Step 2: Calculate return value

   Add method returns 5 + 10 = 15, which is stored in c and printed.

3. Final Answer:

   15 -> Option A

4. Quick Check:

   5 + 10 = 15 [OK]

Hint: Add method returns sum; print result [OK]

Common Mistakes:

• Concatenating numbers as strings
• Confusing method parameters with global variables
• Expecting runtime or compile errors

4. Identify the error in this Java code related to stack memory usage:

public class Demo {
  public static void main(String[] args) {
    int result = factorial(4);
    System.out.println(result);
  }
  public static int factorial(int n) {
    if (n == 0) return 1;
    else return n * factorial(n - 1);
  }
}

medium

A. Stack overflow due to too many local variables

B. Missing base case causing infinite recursion

C. No error, code runs correctly

D. Incorrect method return type

Solution

1. Step 1: Check recursion base case

   The factorial method has a base case: if n == 0 return 1, stopping recursion.

2. Step 2: Confirm recursion correctness

   Each recursive call reduces n by 1, so recursion ends properly without stack overflow.

3. Final Answer:

   No error, code runs correctly -> Option C

4. Quick Check:

   Base case present, recursion safe [OK]

Hint: Check for base case to avoid stack overflow [OK]

Common Mistakes:

• Assuming missing base case when it exists
• Confusing local variables with stack overflow cause
• Thinking return type is wrong

5. Consider this recursive method that calculates the sum of numbers from n down to 1:

public static int sum(int n) {
  if (n <= 0) return 0;
  else return n + sum(n - 1);
}

What will happen if you call sum(1000000) in Java, and why?

hard

A. It will return the correct sum without issues

B. It will cause a stack overflow error due to deep recursion

C. It will run infinitely without stopping

D. It will cause a compile-time error

Solution

1. Step 1: Analyze recursion depth

   Calling sum(1000000) causes 1,000,000 recursive calls, each adding a stack frame.

2. Step 2: Understand stack memory limits

   Java's stack size is limited; deep recursion like this exceeds it, causing stack overflow error.

3. Final Answer:

   It will cause a stack overflow error due to deep recursion -> Option B

4. Quick Check:

   Deep recursion > stack size = stack overflow [OK]

Hint: Very deep recursion causes stack overflow error [OK]

Common Mistakes:

• Assuming recursion always works regardless of depth
• Thinking it runs infinitely without base case
• Confusing runtime errors with compile errors