DSL A3

Data Structure Lab :

Practical A3 : 

Write a Python program for department library which has N books, write functions for following: 

a) Delete the duplicate entries 

b) Display books in ascending order based on cost of books 

c) Count number of books with cost more than 500. 

d) Copy books in a new list which has cost less than 500.

   
 #@author: Vedant  
   
 n=int(input("Enter Total no. of Books in your Library "))  
   
 bn=[]  #Book No. list  
 bp=[]  #Book Price list  
 for i in range(n):  
   c=int(input("Enter the Book NO. "))  
   print("Enter the price of Book NO.",c)  
   p=int(input())  
   bn.append(c)  
   bp.append(p)  
 print("List of your Books",bn)  
 print("List of prices of your Books\n",bp)  
   
 print("<><><><><><><> Solutions Are as follows <><><><><><><><><>")  
   
 # Delete the duplicate entries  
 index=0  
 ubn=[]   #Updated Book No. list  
 ubp=[]   #Updated Book Price list  
 while True:  
   flag=0  
   for i in range(index+1,n):  
     if bn[index]==bn[i]:  
       flag=1  
   if flag==0:  
     ubn.append(bn[index])  
     ubp.append(bp[index])  
   index+=1    
   if index==n:  
     break        
 print("List of Books without duplicate entries :",ubn)  
   
 # Display books in ascending order based on cost of books  
 for i in range (len(ubp)-1):     #Using Bubble Sort  
   for j in range(len(ubp)-i-1):  
     if ubp[j]>ubp[j+1]:  
       ubp[j],ubp[j+1]=ubp[j+1],ubp[j]  
       ubn[j],ubn[j+1]=ubn[j+1],ubn[j]  
 print("Books in ascending order based on cost of books :",ubn)        
   
   
 #Count number of books with cost more than 500        
 count=0  
 for i in range(len(ubp)):  
   if ubp[i]>500:  
     count+=1  
 print("Count number of books with cost more than 500 :-",count)  
   
   
 #Copy books in a new list which has cost less than 500  
 b_500=[]  
 for i in range(len(ubn)):  
   if ubp[i]<500:  
     b_500.append(ubn[i])  
 print("List of books which has cost less than 500 :-",b_500)