Madhan-Alagarsamy commited on
Commit
93e3e00
·
verified ·
1 Parent(s): 480765c

Upload 3.py

Browse files
Files changed (1) hide show
  1. 3.py +110 -0
3.py ADDED
@@ -0,0 +1,110 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ class Empty(Exception):
2
+ pass
3
+
4
+ class ArrayQueue:
5
+ DEFAULT_CAPACITY = 10
6
+
7
+ def __init__(self):
8
+ self._data = [None] * ArrayQueue.DEFAULT_CAPACITY
9
+ self._size = 0
10
+ self._front = 0
11
+
12
+ def __len__(self):
13
+ return self._size
14
+
15
+ def is_empty(self):
16
+ return self._size == 0
17
+
18
+ def first(self):
19
+ if self.is_empty():
20
+ raise Empty("Queue is Empty!")
21
+ return self._data[self._front]
22
+
23
+ def dequeue(self):
24
+ if self.is_empty():
25
+ raise Empty("Queue is Empty!")
26
+ answer = self._data[self._front]
27
+ self._data[self._front] = None
28
+ self._front = (self._front + 1) % len(self._data)
29
+ self._size -= 1
30
+ return answer
31
+
32
+ def enqueue(self, e):
33
+ if self._size == len(self._data):
34
+ self._resize(2 * len(self._data))
35
+ avail = (self._front + self._size) % len(self._data)
36
+ self._data[avail] = e
37
+ self._size += 1
38
+ print("Element", e, "is enqueued successfully")
39
+
40
+ def _resize(self, cap):
41
+ old = self._data
42
+ self._data = [None] * cap
43
+ walk = self._front
44
+ for k in range(self._size):
45
+ self._data[k] = old[walk]
46
+ walk = (walk + 1) % len(old)
47
+ self._front = 0
48
+
49
+
50
+ def main():
51
+ q = ArrayQueue()
52
+ while True:
53
+ print("\n\tQUEUE OPERATIONS")
54
+ print("1-Enqueue")
55
+ print("2-Dequeue")
56
+ print("3-First Element")
57
+ print("4-Length of Queue")
58
+ print("5-Is Empty")
59
+ print("6-Display Queue")
60
+ print("7-Exit")
61
+
62
+ try:
63
+ ch = int(input("Enter your choice: "))
64
+
65
+ if ch == 1:
66
+ e = int(input("Enter an element: "))
67
+ q.enqueue(e)
68
+
69
+ elif ch == 2:
70
+ print("The front element:", q.dequeue(), "is dequeued successfully")
71
+
72
+ elif ch == 3:
73
+ print("First element in the queue is", q.first())
74
+
75
+ elif ch == 4:
76
+ print("Queue length =", len(q))
77
+
78
+ elif ch == 5:
79
+ if q.is_empty():
80
+ print("Queue is empty!")
81
+ else:
82
+ print("Queue is not empty!")
83
+
84
+ elif ch == 6:
85
+ if q.is_empty():
86
+ print("Queue is empty!")
87
+ else:
88
+ print("Queue elements (front to rear):")
89
+ index = q._front
90
+ print("|", end=" ")
91
+ for _ in range(len(q)):
92
+ print(q._data[index], "|", end=" ")
93
+ index = (index + 1) % len(q._data)
94
+ print()
95
+
96
+ elif ch == 7:
97
+ print("Program exited")
98
+ break
99
+
100
+ else:
101
+ print("Invalid choice")
102
+
103
+ except Empty as e:
104
+ print(e)
105
+ except ValueError:
106
+ print("Please enter a valid number")
107
+
108
+
109
+ if __name__ == "__main__":
110
+ main()