Scribd
Upload
7 views

Program 2

Java labprograms

Uploaded by

madhukeshs605
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Program 2

Java labprograms

Uploaded by

madhukeshs605
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Program 2. Develop a stack class to hold a maximum of 10 integers with suitable methods.

Develop a JAVA
main method to illustrate Stack operations.
package lab.stack;

public class Stack_Operations


{
private int[] stack; // Array to store the stack elements
private int top; // Keeps track of the top element in the stack
private int maxSize; // Maximum size of the stack

// Constructor to initialize stack size and top position


public Stack_Operations(int maxSize)
{ // The constructor name now matches the class name
this.maxSize = maxSize;
stack = new int[maxSize]; // Create stack array with specified max size
top = -1; // Stack is empty initially (top is -1)
}

// Method to push an item onto the stack


public void push(int item)
{
if (!isFull())
{
stack[++top] = item; // Increment top and add item to the stack
System.out.println(item + " pushed onto stack.");
} else {
System.out.println("Stack is full");
}
}

// Method to pop an item from the stack


public int pop()
{
if (!isEmpty())
{
int poppedItem = stack[top--]; // Return the top item and decrement the top
System.out.println(poppedItem + " popped from stack.");
return poppedItem;
}
else
{
System.out.println("Stack is empty");
return -1; // Return -1 if stack is empty
}
}

// Check if stack is empty


public boolean isEmpty()
{
return top == -1;
}

// Check if stack is full


public boolean isFull()
{
return top == maxSize - 1;
}

// Print all elements in the stack


public void printStack()
{
if (isEmpty())
{
System.out.println("Stack is empty");
}
else
{
System.out.print("Stack elements: ");
for (int i = 0; i <= top; i++) {
System.out.print(stack[i] + " ");
}
System.out.println();
}
}

// Main method to demonstrate stack operations


public static void main(String[] args)
{
Stack_Operations stack = new Stack_Operations(10); // Create a stack with size 10

// Pushing integers onto the stack


System.out.println("Pushing integers onto the stack:");
for (int i = 0; i < 10; i++)
{
stack.push(i);
}

// Print stack after pushing


System.out.println("Stack after pushing:");
stack.printStack();

// Popping integers off the stack


System.out.println("Popping integers off the stack:");
for (int i = 0; i < 5; i++)
{
stack.pop();
System.out.println("Stack after pop:");
stack.printStack();
}
}
}

Output:
Pushing integers onto the stack:
0 pushed onto stack.
1 pushed onto stack.
2 pushed onto stack.
3 pushed onto stack.
4 pushed onto stack.
5 pushed onto stack.
6 pushed onto stack.
7 pushed onto stack.
8 pushed onto stack.
9 pushed onto stack.
Stack after pushing:
Stack elements: 0 1 2 3 4 5 6 7 8 9
Popping integers off the stack:
9 popped from stack.
Stack after pop:
Stack elements: 0 1 2 3 4 5 6 7 8
8 popped from stack.
Stack after pop:
Stack elements: 0 1 2 3 4 5 6 7
7 popped from stack.
Stack after pop:
Stack elements: 0 1 2 3 4 5 6
6 popped from stack.
Stack after pop:
Stack elements: 0 1 2 3 4 5
5 popped from stack.
Stack after pop:
Stack elements: 0 1 2 3 4

You might also like