You are on page 1of 7

S.MAHESWARAN 30909205306 STACKP.

JAVA: package stackpack; public class stackp { public int stck[]=new int[10]; public int tos=-1; public void push(int item) { if(tos==stck.length-1) System.out.println("Stack is full"); else stck[++tos]=item; } public int pop() { if(tos<0) { System.out.println("Stack underflow"); return 0; } else return stck[tos--]; } public void view() { int i; System.out.println("Stack content:"); for(i=tos;i>=0;i--) { System.out.println("Top-->"+stck[i]); } } } STACKCLASS.JAVA: import stackpack.stackp; import java.io.DataInputStream; import java.io.*; class stackclass { public static void main(String args[]) { stackp s=new stackp();

S.MAHESWARAN 30909205306 int ele,n; try { while(true) { DataInputStream in=new DataInputStream(System.in); System.out.println("Stack Operation"); System.out.println("1.push operation"); System.out.println("2.pop operation"); System.out.println("3.view stack content"); System.out.println("Enter your choice"); int ch=Integer.parseInt(in.readLine()); switch(ch) { case 1: System.out.println("Enter element to push"); ele=Integer.parseInt(in.readLine()); s.push(ele); break; case 2: System.out.println("Pop value"); System.out.println("-->"+s.pop()); break; case 3: s.view(); break; default:System.out.println("Invalid operation"); } } } catch(Exception e) { System.out.println(); } } } OUTPUT: E:\>java stackclass Stack Operation 1.push operation 2.pop operation 3.view stack content

S.MAHESWARAN 30909205306 Enter your choice 1 Enter element to push 50 Stack Operation 1.push operation 2.pop operation 3.view stack content Enter your choice 3 Stack content: Top-->50 Stack Operation 1.push operation 2.pop operation 3.view stack content Enter your choice 2 Pop value -->50

QUEUEP.JAVA: package qpack; public class queuep { public int maxsize=10; public int[] quearray=new int [maxsize]; public int front=0; public int rear=-1; public int nItems=0;

S.MAHESWARAN 30909205306 public void enqueue(int j) { if(rear==maxsize-1) rear=-1; quearray[++rear]=j; nItems++; } public int dequeue() { int temp=quearray[front++]; if(front==maxsize) front=0; nItems--; return temp; } public boolean isEmpty() { return(nItems==0); } public boolean isFull() { return(nItems==maxsize); } public void view() { int i; System.out.println("The content of queue is "); for(i=front;i!=rear+1;i=i+1) { System.out.println("-->"+quearray[i]); } } public int size() { return nItems; } } QUEUECLASS.JAVA: import qpack.queuep; import java.io.*; class queueclass {

S.MAHESWARAN 30909205306 public static void main(String args[])throws Exception { int ele;char e; queuep q=new queuep(); try { while(true) { DataInputStream in=new DataInputStream(System.in); System.out.println("Queue Operation"); System.out.println("1.Enqueue operation"); System.out.println("2.Dequeue operation"); System.out.println("3.Size of queue"); System.out.println("4.View queue content"); System.out.println("Enter your choice"); int ch=Integer.parseInt(in.readLine()); switch(ch) { case 1: System.out.println("Enter element to queue"); ele=Integer.parseInt(in.readLine()); q.enqueue(ele); break; case 2: System.out.println("Dequeued value"); System.out.println("-->"+q.dequeue()); break; case 3: int s=q.size(); System.out.println("size of queue:"+s); break; case 4: q.view(); break; default:System.out.println("Invalid operation"); } } } catch(Exception s) { System.out.println(s); }

S.MAHESWARAN 30909205306 } }

OUTPUT: E:\>java queueclass Queue Operation 1.Enqueue operation 2.Dequeue operation 3.Size of queue 4.View queue content Enter your choice 1 Enter element to queue 20 Queue Operation 1.Enqueue operation 2.Dequeue operation 3.Size of queue 4.View queue content Enter your choice

S.MAHESWARAN 30909205306 1 Enter element to queue 70 Queue Operation 1.Enqueue operation 2.Dequeue operation 3.Size of queue 4.View queue content Enter your choice 3 size of queue:2 Queue Operation 1.Enqueue operation 2.Dequeue operation 3.Size of queue 4.View queue content Enter your choice 4 The content of queue is -->20 -->70 Queue Operation 1.Enqueue operation 2.Dequeue operation 3.Size of queue 4.View queue content Enter your choice 2 Dequeued value -->20

You might also like