Java-TwoMonthsTutorial/Queue.java at master · khkr/Java-TwoMonthsTutorial · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
import java.util.*;

class QueueImplement
{
	 int size,front=0;
	 int index=-1;
	 int queue[];


	QueueImplement(int m) {

		size = m;
		queue = new int[size];
	}


    void enqueue(int element)
	{


		queue[++index]=element;


	}
	 void dequeue()
	{
		front++;
	}

	 void display()
	{
		if(index>-1)
		{
		for(int i=front;i<=index;i++)
		{
			System.out.print(queue[i]+"\t");
		}
		System.out.println();
	    }
	}
	boolean isFull()
	{
		if(index+1>size)
			return true;

		return false;
	}
	boolean isEmpty()
	{
		if(index<front)
			return true;

		return false;
	}

}

public class Queue{
public static void main(String[] args) {

	Scanner scan =new Scanner(System.in);
	System.out.println("enter the size of queue");
	int size= scan.nextInt();

	QueueImplement q1 = new QueueImplement(size);

	int choice =1;
	do
	{System.out.println("1.enqueue\n2.dequeue \n3.display \n4.exit");
	choice =scan.nextInt();

	switch(choice)
	{
		case 1:
		if (!q1.isFull()) {


		  q1.enqueue(scan.nextInt());
		}
		else
			System.out.println("Queue is full cannot input");
		  break;

		 case 2:
		 if (!q1.isEmpty()) {


		 q1.dequeue();
		}
		else
			System.out.println("Queue is empty ");
		 break;

		 case 3:
		 if(!q1.isEmpty())
		 q1.display();

		 else
		 	System.out.println("Queue is empty nothing to display");
		 break;
		 case 4:
		 break;
		 default:
		 System.out.println("enter a valid number");
		 break;
    }

	}while(choice!=4);


}

}