Kumaran1987

Program: public class queuepgm { private int maxSize; private long[] queArray; private int front; private int rear; private int nItems; public queuepgm(int s) { maxSize = s; queArray = new long[maxSize]; front = 0; rear = -1; nItems = 0; } public void enqueue(long j) { if(rear == maxSize-1) rear = -1; queArray[++rear] = j; nItems++; } public long dequeue() { long temp = queArray[front++]; if(front == maxSize) front = 0; nItems--; return temp; } public long peekFront() {     return queArray[front]; } public boolean isEmpty()       { return (nItems==0); } public boolean isFull() { return (nItems==maxSize); } public int size() { return nItems; } public static void main(String[] args) { queuepgm theQueue = new queuepgm(5); // queue holds 5 items theQueue.enqueue(10); theQueue.enqueue(20); theQueue.enqueue(30); theQueue.enqueue(40); System.out.println("Dequeue Values: FIFO"); while( !theQueue.isEmpty() ) ...

Program public class stackpgm { private int maxSize; private long[] stackArray; private int top; public stackpgm(int s) { maxSize = s; stackArray = new long[maxSize]; top = -1; } public void push(long j) {     if(!isFull())     {       stackArray[++top] = j;     } } public long pop() {           return stackArray[top--];             } public long peek() { return stackArray[top]; } public boolean isEmpty() { return (top == -1); } public boolean isFull() { return (top == maxSize-1); } public static void main(String[] args) { stackpgm theStack = new stackpgm(10); theStack.push(1); theStack.push(2); theStack.push(3); theStack.push(4); System.out.println("Pop up values"); while( !theStack.isEmpty() ) { long value = theStack.pop(); System.out.print(value+"\n"); } } } Output