Python Program To Implement A Stack
Python Program To Implement A Stack
class Stack:
def __init__(self):
self.items = []
def is_empty(self):
return len(self.items) == 0
self.items.append(item)
def pop(self):
if not self.is_empty():
return self.items.pop()
else:
def peek(self):
if not self.is_empty():
return self.items[-1]
else:
def size(self):
return len(self.items)
# Example Usage:
my_stack = Stack()
my_stack.push(1)
my_stack.push(2)
my_stack.push(3)
popped_item = my_stack.pop()
Output:
Top Element: 3
Stack Size: 3
Popped Item: 3
class Queue:
def __init__(self):
self.items = []
def is_empty(self):
return len(self.items) == 0
self.items.append(item)
def dequeue(self):
if not self.is_empty():
return self.items.pop(0)
else:
def front(self):
if not self.is_empty():
return self.items[0]
else:
def size(self):
return len(self.items)
# Example Usage:
my_queue = Queue()
my_queue.enqueue(1)
my_queue.enqueue(2)
my_queue.enqueue(3)
print("Current Queue:", my_queue.items)
dequeued_item = my_queue.dequeue()
output:
A python program to implement a deque
class Deque:
def __init__(self):
self.items = []
def is_empty(self):
return len(self.items) == 0
self.items.insert(0, item)
self.items.append(item)
def remove_front(self):
if not self.is_empty():
return self.items.pop(0)
else:
def remove_rear(self):
if not self.is_empty():
return self.items.pop()
else:
def front(self):
if not self.is_empty():
return self.items[0]
else:
def rear(self):
if not self.is_empty():
return self.items[-1]
else:
def size(self):
return len(self.items)
# Example Usage:
my_deque = Deque()
my_deque.add_front(1)
my_deque.add_rear(2)
my_deque.add_rear(3)
removed_front = my_deque.remove_front()
removed_rear = my_deque.remove_rear()
Output:
Front Element: 1
Rear Element: 3
Deque Size: 3
def evaluate_postfix(expression):
stack = []
def is_operand(char):
return char.isnumeric()
if operator == '+':
if is_operand(char):
stack.append(int(char))
else:
operand2 = stack.pop()
operand1 = stack.pop()
stack.append(result)
if len(stack) == 1:
return stack[0]
else:
print("Invalid postfix expression. More than one value left in the stack.")
# Example Usage:
postfix_expression = "235*+"
result = evaluate_postfix(postfix_expression)
Output:
def bubble_sort(arr):
n = len(arr)
for i in range(n):
# Example Usage:
bubble_sort(my_list)
output:
contents = file.read()
print("Contents of 'test.txt':")
print(contents)
OUTPUT:
Contents of 'test.txt':
Output: NAME
-----
RAKESH
AMARJIT
LOREN
ROGER
JOHN
(e)Display the total stipend of male students:
SELECT SUM(STIPEND) AS TotalStipend FROM STUDENT WHERE SEX = 'M';
output: TotalStipend
-------------
14700
(f) List all the students in descending order of their stipend:
SELECT * FROM STUDENT ORDER BY STIPEND DESC;
Output:
MedicalStudentsCount
---------------------
4
(h) To insert a new row in the table with the values. 11, "JOHN", "SCIENCE",
2700, 24, "M":
INSERT INTO STUDENT (SL_no, NAME, STREAM, STIPEND, AGE, SEX) VALUES (11, 'JOHN', 'SCIENCE', 2700, 24,
'M');