Skip to main content

DSL A2

 Write a Python program to store marks scored in subject “Fundamental of Data Structure” by N students in the class. Write functions to compute following: 

a) The average score of class 

b) Highest score and lowest score of class 

c) Count of students who were absent for the test 

d) Display mark with highest frequency


The Code for above problem is as follows :


 """  
 @author: SPPU SE GURU  
 """  
   
 total=int(input ("Enter total no. of students in your class "))  
 pre=int(input("No. of students appeared for FDS exam : "))  
   
 U=[]  
 for i in range (total):  
  i=i+1  
  U.append(i)  
   
 R=[]  
 for i in range(pre):  
   roll=int(input("Enter Roll no. of students present for test :- "))  
   R.append(roll)  
   
 M=[]  
 for i in range(pre):  
   print("Enter Roll no. ",R[i],end=" ")  
   marks=int(input("Marks:- "))  
   M.append(marks)  
 print("********** Solutions Are as follows ***********")  
 #avg  
 sum=0  
 for i in range(len(M)):  
  sum=sum+M[i]  
 avg=sum/pre   
 print ("Average of Class",int(avg))  
   
   
 #Highest and Lowest  
 index1=0  
 max=M[0]  
 for i in range(1,len(M)):  
   if max<M[i]:  
    max=M[i]  
    index1=i  
      
 print("Highest Marks",max)  
 print("Roll no. of highest mark student :",R[index1])  
   
   
 index2=0  
 min=M[0]  
 for i in range(1,len(M)):  
   if min>M[i]:  
    min=M[i]  
    index2=i  
      
 print("Lowest Marks",min)    
 print ("Roll no. of lowest mark student :",R[index2])  
   
   
 #abs cout  
 a=0  
 abs=[]  
 for i in range (len(U)):  
  flag=0  
  for j in range(len(R)):  
   if U[i]==R[j]:  
    flag=1  
    break  
  if flag==0:  
   abs.append(U[i])  
   a=a+1  
 print("Roll no. of absent students :",abs)  
 print("Total no. students absent for test :",a)  
     
     
 #frequency  
 freq=[]  
 for i in range (len(M)):  
  freq.append(1)  
    
   
 for i in range(len(M)):  
  for j in range(len(M)):  
    if M[i]==M[j]:  
     freq[i]+=1  
 index=0      
 fmax=freq[0]      
 for i in range(1,len(freq)):  
   if fmax<freq[i]:  
     fmax=freq[i]  
     index=i  
 if freq[i]==1:  
     print("All marks are unique")    
 else:    
     print("max frequency",M[index])      

Comments

Popular posts from this blog

DSL A1

Hello Friends lets See the first practical of Data Structure Laboratory(DSL) of SPPU Second Year. Some of the students are afraid of coding as it is new to all of us. So we are here to conquer your fear. You will find it easy as it explained by students only. So lets Get into it The first practical of part A is : In second year computer engineering class, group A student’s play cricket, group B students play badminton and group C students play football. Write a Python program using functions to compute following: -  a) List of students who play both cricket and badminton  b) List of students who play either cricket or badminton but not both  c) Number of students who play neither cricket nor badminton  d) Number of students who play cricket and football but not badminton.  (Note- While realizing the group, duplicate entries should be avoided, Do not use SET built-in functions)  So most of us know the SET theory in mathematics. The above problem is very easy if you have knowledge about

Bouncing Ball

Group B   Practical 4 a   Problem Statement :   Write a C++ program to implement bouncing ball using sine wave form. Apply the concept of polymorphism. Check Out Code Here  ðŸ‘‡ Outputs :  Code can get updated so also come back later to see if there is any changes. Also if there is any problem with code you can comment below. If you like it, do share with your friends.😊

OOP 6

   Object Oriented Programming Group B - Practical : 6 Problem Statement :  Write C++ program using STL for sorting and searching user defined records such as personal records (Name, DOB, Telephone number etc) using vector container. Check Out Code Here  ðŸ‘‡ Code can get updated so also come back later to see if there is any changes. Also if there is any problem with code you can comment below. If you like it, do share with your friends.😊