Showing posts with label ARRAY. Show all posts
Showing posts with label ARRAY. Show all posts

Friday, October 25, 2013

QUEUE USING ARRAY IN JAVA

/*

TOPIC:QUEUE USING ARRAY.
DATE:2/8/2012
*/
import java.io.*;
class Queue
{
int items[]=new int[10];
int front,rear;
Queue()
{
front=0;
rear=-1;
}
void insert(int item)
{if(rear==9)
System.out.println("QUEUE overflow");
else
items[++rear]=item;
}

int remove()
{
if(this.isEmpty())
{
System.out.println("QUEUE underflow");
return 0;
}
else
{return items[front++];
}
}
boolean isEmpty()
{
if(front>rear)
return true;
else
return false;
}
}

class x
{
public static void main(String args[]) throws IOException
{
InputStreamReader isr=new InputStreamReader(System.in);
BufferedReader br=new BufferedReader(isr);
int ch;
Queue q=new Queue();

do
{
System.out.println("MENU");
System.out.println("1.INSERT");
System.out.println("2.REMOVE");
System.out.println("3.CHECK");
System.out.println("4.DISPLAY");
System.out.println("5.EXIT");
System.out.println("ENTER CHOICE");
ch=Integer.parseInt(br.readLine());
switch (ch)
{
case 1:
int x;
System.out.println("enter no to be inserted");
x=Integer.parseInt(br.readLine());
q.insert(x);
break;


case 2:
System.out.println("REMOVED NUMBER IS "+(q.remove()));
break;

case 3:
System.out.println("EMPTY:  "+(q.isEmpty()));
break;

case 4:
for(int i=q.front;i<=q.rear;i++)
System.out.print(q.items[i]+" ");
break;

case 5:

break;
}
}while(ch!=5);
}
}
/*
OUTPUT:
bash-3.00$ java x
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
1
enter no to be inserted
25
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
1
enter no to be inserted
96
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
1
enter no to be inserted
0224
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
1
enter no to be inserted
66
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
3
EMPTY:  false
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
4
25      96      224     66      MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
2
REMOVED NUMBER IS 25
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
2
REMOVED NUMBER IS 96
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
2
REMOVED NUMBER IS 224
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
2
REMOVED NUMBER IS 66
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
2
QUEUE underflow
REMOVED NUMBER IS 0
MENU
1.INSERT
2.REMOVE
3.CHECK
4.DISPLAY
5.EXIT
ENTER CHOICE
5

*/

STACK USING ARRAY IN JAVA

/*
TOPIC:STACK USING ARRAY.
DATE:2/8/2012
*/
import java.io.*;
class Stack
{
int stk[]=new int[10];
int top;
Stack()
{
top=-1;
}
void push(int i)
{
if(top==9)
System.out.println("Stack Overflow!");
else
stk[++top]=i;
}


int pop()
{
if(this.isEmpty())
{
System.out.println("underflow");
return 0;}
else
{
System.out.println(stk[top]);

return stk[top--];
}}
boolean isEmpty()
{
if(top<0)
return true;
else
return false;
}
}

class main
{
 public static void main(String args[]) throws IOException
{
InputStreamReader isr=new InputStreamReader(System.in);
BufferedReader br=new BufferedReader(isr);
Stack s=new Stack();
int ch;
do
{
System.out.println("MENU");
System.out.println("1.PUSH");
System.out.println("2.POP");
System.out.println("3.isEmpty");
System.out.println("4.DISPLAY");
System.out.println("5.EXIT");
System.out.println("ENTER A CHOICE");
ch=Integer.parseInt(br.readLine());
switch(ch)
{
case 1:

int no;
System.out.println("enter no.");
no=Integer.parseInt(br.readLine());
s.push(no);
break;

case 2:
int m=s.pop();
System.out.println(m+" has been popped out");
break;
case 3:
System.out.println("Empty: "+ s.isEmpty());
break;

case 4:
for(int i=0;i<=s.top;i++)
System.out.print(s.stk[i]+" ");
break;

case 5:
break;
}
}while (ch!=5);

}}
/*
OUTPUT:
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
1
enter no.
25
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
1
enter no.
26
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
1
enter no.
65
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
4
25      26      65      MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
3
Empty: false
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
2
65
65 has been popped out
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
2
26
26 has been popped out
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
2
25
25 has been popped out
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
2
underflow
0 has been popped out
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
5
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
1
enter no.
25
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
1
enter no.
26
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
1
enter no.
65
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
4
25      26      65      MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
3
Empty: false
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
2
65
65 has been popped out
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
2
26
26 has been popped out
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
2
25
25 has been popped out
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
2
underflow
0 has been popped out
MENU
1.PUSH
2.POP
3.isEmpty
4.DISPLAY
5.EXIT
ENTER A CHOICE
5
*/