gs gs121 Abstract Data Types - Stack using Array - Quiz No.1

 #define MAX 10  typedef struct stack { int top; int item[MAX]; }stack;  int function(stack *s) { if(s->top == -1) return 1; else return 0; }

 public class Stack { protected static final int CAPACITY = 100; protected int size,top = -1; protected Object stk[];  public Stack() { stk = new Object[CAPACITY]; }  public void push(Object item) { if(size_of_stack==size) { System.out.println("Stack overflow"); return; } else { top++; stk[top]=item; } } public Object pop() { if(top<0) { return -999; } else { Object ele=stk[top]; top--; size_of_stack--; return ele; } } }  public class StackDemo { public static void main(String args[]) { Stack myStack = new Stack(); myStack.push(10); Object element1 = myStack.pop(); Object element2 = myStack.pop(); System.out.println(element2); } }

 public void some_function(int[] a) { Stack S=new Stack(a.length); int[] b=new int[a.length]; for(int i=0;i<a.length;i++) { S.push(a[i]); } for(int i=0;i<a.length;i++) { b[i]=(int)(S.pop()); } System.out.println("output :"); for(int i=0;i<b.length;i++) { System.out.println(b[i]); } }