KEMBAR78
Stack Implementation | PDF
Scribd
Upload
16 views3 pages

Stack Implementation

The document outlines a Java implementation of a stack data structure as part of a lab assignment for a Computer Science course. It includes methods for basic stack operations such as push, pop, peek, and display, along with error handling for overflow and underflow conditions. The main class demonstrates the usage of the stack by pushing elements and displaying the current state of the stack.

Uploaded by

pastelghoste
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views3 pages

Stack Implementation

The document outlines a Java implementation of a stack data structure as part of a lab assignment for a Computer Science course. It includes methods for basic stack operations such as push, pop, peek, and display, along with error handling for overflow and underflow conditions. The main class demonstrates the usage of the stack by pushing elements and displaying the current state of the stack.

Uploaded by

pastelghoste
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

The Shaikh Ayaz University Shikarpur

Department of Computer Science & Information


Technology

Data Structure & Algorithms (DSA)


Lab # 4 BS – Computer Science Part-II Date: 06-03-2025

Topic: Stack Implementation


package stackdsa;

class Stack{
private int arr[];
private int top;
private int max_size;

Stack(int size){
arr = new int[size];
max_size = size;
top = -1;
}

public boolean isEmpty(){


return top == -1;
}

public boolean isFull(){


return top == max_size-1;
}
//push
public void push(int x){
if(isFull()){
System.out.println("Stack Overflow! cannot push: " + x);
return;
}
arr[++top] =x;
System.out.println("Pushed: " +x);
}

//pop
public int pop(){
if(isEmpty()){
System.out.println("Stack Undeflow! No Elements to pop");
return -1;
}
return arr[top--];
}

//peek
public int peek(){
if(isEmpty()){
System.out.println("Stack is Empty! No Element at Peek.");
return -1;
}
return arr[top];

//display
public void display(){
if(isEmpty()){
System.out.println("Stack is Empty.");
return;
}
System.out.println("Elements in Stack are: ");
for(int i = 0; i<=top; i++){
System.out.println("Index:" + i + " -> " + arr[i] + " ");
}
System.out.println();
}
}
public class Stackdsa {

/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
Stack stack = new Stack(5);
stack.push(2);
stack.push(5);
stack.display();
}
}

THE END

You might also like