Program 1 # To-Do List Using Singly Linked List class Task: def __init__(self, task_id, description): self.id = task_id self.description = description self.completed = False self.next = None class ToDoList: def __init__(self): self.head = None...
Program 1 # Library Book Management System class Book: def __init__(self, id, title, author): self.id = id self.title = title self.author = author self.prev = None self.next = None class Library: def __init__(self): self.head...
Program 1 import os os.system(‘cls’) def merge_sort(arr): if(len(arr)>1): left_arr=arr[:len(arr)//2] right_arr=arr[len(arr)//2:] #apply recrusion merge_sort(left_arr) # recursive function merge_sort(right_arr) # recursive function #merge i=0 j=0 k=0 while(i<len(left_arr) and j<len(right_arr)): if(left_arr[i]<right_arr[j]): arr[k]=left_arr[i] i=i+1 else: arr[k]=right_arr[j] j=j+1 k=k+1...
Program 1 # Implementation of Binary Search Tree import os class Node: def __init__(self): self.ladd=None self.data=None self.radd=None class Tree: def __init__(self): self.root=None #Create Method def createTree(self,r,new1): if(new1.data<r.data): if(r.ladd==None): r.ladd=new1 else: self.createTree(r.ladd,new1) # Recursion if(new1.data>r.data):...
Program 1 # Implementation of Binary Search Tree import os class Node: def __init__(self): self.ladd=None self.data=None self.radd=None class Tree: def __init__(self): self.root=None #Create Method def createTree(self,r,new1): if(new1.data<r.data): if(r.ladd==None): r.ladd=new1 else: self.createTree(r.ladd,new1) # Recursion if(new1.data>r.data):...
Program 1 # Implementation of Binary Search Tree import os class Node: def __init__(self): self.ladd=None self.data=None self.radd=None class Tree: def __init__(self): self.root=None #Create Method def createTree(self,r,new1): if(new1.data<r.data): if(r.ladd==None): r.ladd=new1 else: self.createTree(r.ladd,new1) # Recursion if(new1.data>r.data):...
Program 1 # Implementation of Binary Search Tree import os class Node: def __init__(self): self.ladd=None self.data=None self.radd=None class Tree: def __init__(self): self.root=None #Create Method def createTree(self,r,new1): if(new1.data<r.data): if(r.ladd==None): r.ladd=new1 else: self.createTree(r.ladd,new1) # Recursion if(new1.data>r.data):...
Program 1 # Program for Tower of Hanoi import os def move(n,a,b,c): if(n==1): print(“Move Disk %d from %s to %s “%(n,a,c)) else: move(n-1,a,c,b) # Recursion print(“Move Disk %d from %s to %s “%(n,a,c)) move(n-1,b,a,c)...
Program 1 import os def shell_sort(a): n=len(a) gap=n//2 while(gap>=1): j=gap while(j<n): i=j-gap while(i>=0): if(a[i+gap]<a[i]): a[i+gap],a[i]=a[i],a[i+gap] else: break i=i-gap j=j+1 gap=gap//2 os.system(‘cls’) mylist=[] n=int(input(“Enter the limit”)) print(“Enter elements in list”) for i in range(n): x=int(input())...
Program 1 # implementation of circular queue import os MAXSIZE=10 cqueue=[] front=-1 rear=-1 def cqinsert(): global rear global front global MAXSIZE if(((rear+1)%MAXSIZE)==front): print(“Queue is overflow”) else: n=int(input(“Enter an element for insert”)) if(front==-1 and rear==-1):...
