Question

I need to implement raw array Stack for create empty stack, isEmpty, isFull, push, pop, and size using below pseudo code. I need two classes with stack pseudo code implementation and the main method to demonstrate the correct working of each operation.

pseudo code

StackADT (using raw array)

class StackADT {

int top

int items[]

int max

StackADT(int n)

Initialize array to n capacity

top = 0

max = n

boolean isEmpty()

if array has no elements return true else return false

boolean isFull() {

if array is full return true else return false

void push(int item)

if (isFull()) throw exception

add item to items[top] increment top  

int pop()

if (isEmpty()) throw exception

decrement top

return top element from array

int size()

return number of elements

Answer 1

public class StackADT {

    private int top;
    private int items[];
    private int max;

    public StackADT(int n) {
        this.max = n;
        top = 0;
        items = new int[n];
    }

    public boolean isEmpty() {
        return top == 0;
    }

    public boolean isFull() {
        return top == max;
    }

    public void push(int item) {
        if (isFull()) throw new IllegalArgumentException();
        else items[top++] = item;
    }

    public int pop() {
        if (isEmpty()) throw new IllegalArgumentException();
        else return items[--top];
    }

    public int size() {
        return top;
    }
}