/* related posts with thumb nails */

program to implement insert and delete operations on Queue using array method.:

class Queue

{

private static int MAX=10;

private int a[]=new int[MAX];

int front,rear;

Queue()

{

front=rear=0;

}

public void insert(int v)

{

if(rear

a[rear++]=v;

else

System.out.println("Overflow");

}

public int del()

{

if(front!=rear)

return a[front++];

else

{

System.out.println("Underflow");

return -1;

}

}

}

class QArray

{

public static void main(String as[])

{

Queue q1=new Queue();

q1.insert(30);

q1.insert(40);

q1.insert(50);

System.out.println(q1.del());

System.out.println(q1.del());

System.out.println(q1.del());

}

}

/* Output */

30

40

50

Related Topics:

0 comments:

Post a Comment