FilesExpand file tree

 master

/

queue.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

executable file

·

151 lines (134 loc) · 2.84 KB

 master

/

queue.java

Copy path

Top

File metadata and controls

• Code
• Blame

executable file

·

151 lines (134 loc) · 2.84 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

package project;

import java.io.*;

public class Queue {

public static int front=-1;

public static int rear=-1;

public static int arr[]= new int[1000];

public static int isempty(){

if(front==-1 && rear==-1)

return 1;

else

return 0;

}

public static void insert(){

try{

BufferedReader brr= new BufferedReader ( new InputStreamReader ( System.in));

int x;

System.out.println("enter the element to be inserted into the queue: ");

x=Integer.parseInt ( brr.readLine());

if(isfull()==1)

{

System.out.println("queue is full");

return;

}

else if(isempty()==1)

{

front=0;

rear=0;

}

else

{

rear=rear+1;

}

arr[rear]=x;

}

catch ( IOException ie ) {

System.out.println ( "error in input" );

}

}

public static void dequeue(){

if(isempty()==1)

{

System.out.println("Nothing to dequeue!");

return;

}

else if(front==rear)

{

front=-1;

rear=-1;

}

else

{

front=front+1;

}

}

public static void display(){

int i;

if(front==-1 && rear==-1)

{

System.out.println("there is nothing to display in queue");

}

else

{

for(i=front;i<=rear;i++)

{

System.out.print(arr[i]);

System.out.print(" ");

}

}

System.out.println("");

}

public static int isfull(){

if(front==999)

{

return 1;

}

else

return 0;

}

public static void main(String args[])

{

try

{

BufferedReader br= new BufferedReader ( new InputStreamReader ( System.in));

int choice;

int ch;

System.out.println("if you want to perform operations, enter 1");

ch=Integer.parseInt ( br.readLine());

do

{

try{

System.out.println("choose the operations to perform on the queue: ");

System.out.println("1.isempty\n2.insert\n3.dequeue\n4.display\n5.exit");

choice=Integer.parseInt ( br.readLine());

switch(choice)

{

case 1:

isempty();

System.out.println("do you wish to contiue, enter '1' for this? ");

ch=Integer.parseInt ( br.readLine());

break;

case 2:

insert();

System.out.println("do you wish to contiue, enter '1' for this? ");

ch=Integer.parseInt ( br.readLine());

break;

case 3:

dequeue();

System.out.println("do you wish to contiue, enter '1' for this? ");

ch=Integer.parseInt ( br.readLine());

break;

case 4:

display();

System.out.println("do you wish to contiue, enter '1' for this? ");

ch=Integer.parseInt ( br.readLine());

break;

case 5:

System.exit(0);

default:

System.out.println("you had entered the wrong choice!");

System.out.println("do you wish to contiue, enter '1' for this? ");

ch=Integer.parseInt ( br.readLine());

break;

}

}

catch ( IOException ie ) {

System.out.println ( "error in input" );

}

}while(ch==1);

}

catch ( IOException ie ) {

System.out.println ( "error in input" );

}

}

}