SUM OF TWO NUMBERS

def sum_num():
try:
a =int(input('\nEnter 1st number: '))
b = int(input('Enter 2nd number: '))
print("\nSum is:", a + b)
except ValueError:
print("Invalid input. Integers only.")
while True:
sum_num()
user_input = input("\nTry again? Y/N: ").upper()

while user_input not in ['Y', 'N']:

print("This only accepts Y/N.")
user_input = input ("Try again? Y/N.").upper()
if user_input == "N":
print("Thank you!")
break
 AVERAGE OF THREE NUMBERS

ave = 0
total = 0
count = 0
for n in range (3):
n = int(input("Enter the number: "))
if (n % 2 == 0):
count += 1
else:
print("Enter even number: ")
avl = int(n)
total = total + avl
print("Sum: ", total)
average = total /3
print("Average of 3 numbers: ", round(average))
 AVERAGE OF THREE EVEN NUMBERS

def calculate_average_of_even(num1, num2, num3):

even_numbers = [num for num in [num1, num2, num3]
if num%2 == 0]
if not even_numbers:
return None
else:
average = sum(even_numbers)/len(even_numbers)
return average
while True:
num1 = int(input("Enter the first number: "))
num2 = int(input("Enter the second number: "))
num3 = int(input("Enter the third number: "))

if num1 % 2 != 0 or num2 % 2 !=0 or num3 % 2 !=0:

print("Please enter even numbers only.")
continue
average_of_even = calculate_average_of_even(num1, num2, num3)
if average_of_even is not None:
print("Average of even numbers: ",round (average_of_even))
choice = input("Do you want to calculate again? (Y/N): ").upper()
if choice !='Y':
print("Thank you")
break
 HIGHEST AND LOWEST NUMBER

def find_highest_lowest(numbers):
highest = max(numbers)
lowest = min(numbers)
return highest, lowest

numbers = []
for i in range (5):
user_input = int(input(f"Enter the Number {i + 1}: "))
numbers.append(user_input)
highest_number, lowest_number = find_highest_lowest(numbers)

print("Highest numbers: ", highest_number)

print("Lowest number:", lowest_number)
 ASCENDING ORDER

while True:
numbers = [(input(f"Enter number {i + 1}:" ))for i in range(5)]
ascending_order = sorted(numbers)
print("Ascending order: ", ascending_order)
continue_response = input("Do you want to continue? (y/n): ").lower()
if continue_response != 'y':
break
 STACK

stack = []

def push(stack, number):

if len(stack) < 5:
stack.append(number)
print(f"\n{number} pushed onto the stack")
else:
print("The stack is full.")

def pop(stack):
if len(stack) > 0:
popped_number = stack.pop()
print(f"\n{popped_number} popped from the stack")
else:
print("The stack is empty.")

for i in range(5):
num = int(input(f"Enter a number ({i + 1}): "))
stack.append(num)

while True:
print("\nCurrent stack:", stack)
print("\n1. Push")
print("2. Pop")
print("3. Quit")

choice = input("Enter your choice: ")

if choice == '1':
num = int(input("Enter a number to push: "))
push(stack, num)
elif choice == '2':
pop(stack)
elif choice == '3':
print("\nfinal list:",stack)
break
else:
print("Only 1, 2, or 3.")
 ANAGRAM

def are_anagrams(word1, word2):

word1 = word1.replace(" ","").lower()

word2 = word2.replace(" ","").lower()
return sorted(word1) == sorted(word2)

word1 = input("Enter the first word: ")

word2 = input("Enter the second word: ")

if are_anagrams (word1, word2):

print(f'"{word1}" and "{word2}" are ANAGRAMS.')
else:
print(f'"{word1}" and {word2}" are not alike.')
 SORTING

while True:
numbers = [(input(f"Enter number {i + 1}: "))for i in range (5)]
ascending_order = sorted(numbers)
descending_order = sorted(numbers, reverse = True)
print("Ascending order: ", ascending_order)
print("Descendig order: ", descending_order)
continue_response = input("Do you want to continue? (y/n): ").lower()
if continue_response !='y':
break
 GRAPH (LDV) & (HDV)
def calculate_orders(numbers, selected_node):
ldv_order = sorted(numbers, key=lambda x: (abs(selected_node - x), x))
hdv_order = sorted(numbers, key=lambda x: (-abs(selected_node - x), x))
return [num for num in ldv_order if num != selected_node], [num for num in hdv_order if
num != selected_node]

def get_input_numbers(levels):
return {level: sorted(map(int, input(f"Enter {level} number(s) for level {level}: ").split()))
for level in range(1, levels + 1)}

def get_selected_nodes(message, count):

return [int(input(f"{message} {i + 1}: ")) for i in range(count)]

def display_order(order_type, node, order):

print(f"\n{order_type} ({node}): {order}")

def main():
levels = 4

levels_data = get_input_numbers(levels)
all_numbers = [num for nums in levels_data.values() for num in nums]

selected_ldv_nodes = get_selected_nodes("Enter selected LDV node", 3)

selected_hdv_nodes = get_selected_nodes("Enter selected HDV node", 3)

for node, order_type in [(node, "LDV") for node in selected_ldv_nodes] + [(node, "HDV")
for node in selected_hdv_nodes]:
if node in all_numbers:
order, _ = calculate_orders(all_numbers, node)
display_order(order_type, node, order)
else:
print(f"\nSelected node {node} not found in entered numbers for {order_type}.")

if __name__ == "__main__":
main()
 PASSWORD

while True:
password = input("Enter the password: ")
print(password)
if password.upper() == "NEIL":
print("\nAccess granted")
break
else:
print("\nAccess denied. Try again?")