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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
| import java.util.ArrayList;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Stack;
public class Collections {
public static void main(String[] args) throws Exception
{
Scanner sc=new Scanner(System.in);
int choice;
PriorityQueue<Integer> q1=new PriorityQueue<>();
Stack<Integer> s1=new Stack<>();
LinkedList<Integer> l1=new LinkedList<>();
ArrayList<Integer> arrayList=new ArrayList<>();
HashMap<Integer, Integer> hs=new HashMap<>();
do
{
System.out.println("\n====MENU====\n1. Queue\n2.Stack\n3.Linked List\n4.ArraList\n5.Map\n6.Exit\nENter your choice:");
choice=sc.nextInt();
switch(choice)
{
case 1:
do
{
System.out.println("\n====Queue=======\n");
System.out.println("1. Enqueue\n2.Dequeue\n3.Size4.Search0.Exit");
choice=sc.nextInt();
switch(choice)
{
case 1:
System.out.println("\nEnter Number: ");
q1.add(new Integer(sc.nextInt()));
System.out.println("Added :"+q1.peek());
break;
case 2:
System.out.println("\nRemoved element:=>"+q1.remove());
break;
case 3:
System.out.println("\nSize= "+q1.size());
break;
case 4:
System.out.println("\nENter Element to Search: ");
if(q1.contains(sc.nextInt()))
{
System.out.println("\nElement is present.");
}
else
{
System.out.println("\nElement is absent.");
}
break;
case 0:
break;
}
}
while(choice!=0);
break;
case 2:
do
{
System.out.println("\n=======Stack=======");
System.out.println("\n1.Push\n2.Pop\n3.Top\n0.Exit;");
choice=sc.nextInt();
switch(choice)
{
case 1:
System.out.println("\nENter Number: ");
s1.push(new Integer(sc.nextInt()));
break;
case 2:
System.out.println("\nPopped elemet:=> "+s1.pop());
break;
case 3:
System.out.println("\nStack top: "+s1.peek());
break;
default:
System.out.println("\nWrong Choice!!!");
break;
}
}
while(choice!=0);
break;
case 3:
do
{
System.out.println("\n====Linked LIST=====\n1.ADD Element\n2.Remove Element\nFirst Element\n4.Last Element\n0.Exit");
choice=sc.nextInt();
switch(choice)
{
case 1:
System.out.println("\nENter Number: ");
l1.add(new Integer(sc.nextInt()));
break;
case 2:
System.out.println("\nEnter element to remove: ");
System.out.println("]nRemoved element:"+l1.remove(sc.nextInt()));
break;
case 3:
System.out.println("\nFirst Element: "+l1.getFirst());
break;
case 4:
System.out.println("\nLast Element: "+l1.getLast());
break;
case 5: break;
}
}while(choice!=0);
break;
case 4:
do
{
System.out.println("\n====ARRAY LIST ========");
System.out.println("\n1.Add element\n2.Remove element\n3.Remove element by index\n4.Size\n0.Exit");
choice=sc.nextInt();
switch(choice)
{
case 1:
System.out.println("\nEnter Element: ");
arrayList.add(new Integer(sc.nextInt()));
break;
case 2:
System.out.println("\nEnter element to remove: ");
arrayList.remove(new Integer(sc.nextInt()));
System.out.println("\nElement Removed.");
break;
case 3:
System.out.println("\nEnter Index to remove element");
int index=sc.nextInt();
System.out.println("Removed element at index 0 from arrayList: "+arrayList.remove(index));
break;
case 4:
System.out.println("\nSize:=> "+arrayList.size());
break;
}
}while(choice!=0);
break;
case 5:
do
{
System.out.println("\n===== Hash Map=====");
System.out.println("\n1.Insert\n2.Remove by Key\n3.Size\n4.Get HashCode\n0.Exit\nEnter Choice:");
choice=sc.nextInt();
switch(choice)
{
case 1:
System.out.println("\nENter Key");
//sc.next();
int key=sc.nextInt();
System.out.println("\nENter Value: ");
int value=sc.nextInt();
hs.put(key, value);
System.out.println("\nRecord Inserted");
break;
case 2:
System.out.println("\nENter Key to delete associated value:");
//sc.next();
int key1=sc.nextInt();
System.out.println("\nRemoved element (roll):"+hs.remove(key1));
break;
case 3:
System.out.println("\nSize: "+hs.size());
break;
case 4:
System.out.println("\nHashcode Value for this map: "+hs.hashCode());
break;
default:
System.out.println("\nWrong Choice!!!Dekh ke Type kr.");
}
}while(choice!=0);
break;
default:
System.out.println("\nWrong Choice");
}
}while(choice!=6);
}
}
|
No comments: