Posts

Showing posts from March, 2026

link list

# Node class class Node:     def __init__(self, data):   # Correct constructor         self.data = data         self.ref = None # Linked List class class LinkedList:     def __init__(self):   # Correct constructor         self.head = None     # Insert node at beginning     def add_begin(self, data):         new_node = Node(data)         new_node.ref = self.head         self.head = new_node     # Print Linked List     def print_LL(self):         if self.head is None:             print("Linked list is empty")         else:             n = self.head             while n is not None:                 print(n.data, "---->", end...

new fibonce

def Fibonacci(number):     if number == 0:         return 0     elif number == 1:         return 1     else:         return Fibonacci(number - 2) + Fibonacci(number - 1) number = int(input("Enter the number of Fibonacci terms: ")) if number <= 0:     print("No terms to display.") else:     print("Fibonacci sequence:")     for n in range(number):         print(Fibonacci(n)) 

normol

https://drive.google.com/drive/home

week 3

 file:///C:/Users/shree/Downloads/WEEK_3-ALL-PROGRAMS.pdf

space week 2

 def add_employee_array(emp): start = time.time() employees.append(emp) # O(1) end = time.time() print(f"Added employee (Time: {end-start:.6f}s, Space: {sys.getsizeof(emp)} bytes)") def remove_employee_array(emp_id): start = time.time() for i, emp in enumerate(employees): # O(n) if emp["id"] == emp_id: employees.pop(i) end = time.time() print(f"Removed employee (Time: {end-start:.6f}s, Space freed: {sys.getsizeof(emp)} bytes)") return end = time.time() print(f"Employee not found (Time: {end-start:.6f}s)") def display_employees_array(): start = time.time() for emp in employees: # O(n) print(emp["id"], emp["name"], emp["salary"]) end = time.time() print(f"Display employees (Time: {end-start:.6f}s)") # Example usage Array add_employee_array({"id": 1, "name": "Alice", "salary": 50000}) add_employee_array({"id": 2, "name": "Bob", "salary...

week 2 time complixty

import time import sys # Employee Class class Employee:     def __init__(self, emp_id, name, salary):         self.emp_id = emp_id         self.name = name         self.salary = salary # Employee ADT Class class EmployeeADT:     def __init__(self):         self.employees = []     # Add Employee     def add_employee(self, emp):         start = time.time()         self.employees.append(emp)   # O(1)         end = time.time()         print("Added employee (Time:", round(end-start,6), "s, Space:", sys.getsizeof(emp), "bytes)")     # Remove Employee     def remove_employee(self, emp_id):         start = time.time()         for i, emp in enumerate(self.employees):   # O(n)             if ...

adt week 1

# 1. Student ADT class Student:     def __init__(self, name, roll_no):         self.name = name         self.roll_no = roll_no     def display(self):         print(f"Student Name: {self.name}, Roll No: {self.roll_no}") # 2. Employee ADT class Employee:     def __init__(self, name, emp_id, salary):         self.name = name         self.emp_id = emp_id         self.salary = salary     def display(self):         print(f"Employee Name: {self.name}, ID: {self.emp_id}, Salary: {self.salary}")     def update_salary(self, new_salary):         self.salary = new_salary # 3. Date ADT class Date:     def __init__(self, day, month, year):         self.day = day         self.month = month         self.year = year   ...

dictionary

# Program to demonstrate Dictionary in Python print("=== Dictionary ===") # Creating a dictionary student = {"Name": "Alice", "Age": 20, "Course": "B.Sc"} # Print the original dictionary print("Original Dictionary:", student) # Access value using key print("Student Name:", student["Name"]) # Add new key-value pair student["Grade"] = "A" print("After adding Grade:", student) # Remove a key-value pair student.pop("Age") print("After removing Age:", student)

set week 1

# Program to demonstrate Set in Python print("=== Set ===") # Creating a set (duplicates automatically removed) numbers = {1, 2, 3, 3, 4} print("Set (duplicates removed):", numbers) # Add element to set numbers.add(5) print("After adding 5:", numbers) # Remove element from set numbers.discard(2) print("After discarding 2:", numbers)

tuple week 1

# Program to demonstrate Tuple in Python print("=== Tuple ===") # Creating a tuple colors = ("Red", "Green", "Blue") # Printing the whole tuple print("Tuple:", colors) # Accessing element using index # Index starts from 0 in Python print("First color:", colors[0])

list week 1

print("=== List ===") fruits = ["Apple", "Banana", "Mango"] print("Original List:", fruits) # Add an element fruits.append("Orange") print("After append:", fruits) # Remove an element fruits.remove("Banana") print("After remove:", fruits) # Access by index print("First fruit:", fruits[0])

week 2

 import time # Employee class class Employee:     def __init__(self, emp_id, name, salary):         self.emp_id = emp_id         self.name = name         self.salary = salary # Employee ADT class class EmployeeADT:     def __init__(self):         self.employees = []     def add_employee(self, employee):         self.employees.append(employee)     def remove_employee(self, emp_id):         self.employees = [emp for emp in self.employees if emp.emp_id != emp_id]     def display_employees(self):         start = time.time()                  for emp in self.employees:  # O(n)             print(emp.emp_id, emp.name, emp.salary)                  end = time.time()     ...

python week 1

# 1. List (Ordered, mutable) print("=== List ===") fruits = ["Apple", "Banana", "Mango"] print("Original List:", fruits) # Add an element fruits.append("Orange") print("After append:", fruits) # Remove an element fruits.remove("Banana") print("After remove:", fruits) # Access by index print("First fruit:", fruits[0])