From 2460d95ae2611d45141b0ec87422451518ecf3a6 Mon Sep 17 00:00:00 2001 From: MayurNanaware <95172067+MayurNanaware@users.noreply.github.com> Date: Sun, 28 Nov 2021 18:23:05 +0530 Subject: [PATCH] Update enter.txt --- enter.txt | 331 ++++++++++++++++++++++++++++++++++++++++++++++++++++-- 1 file changed, 324 insertions(+), 7 deletions(-) diff --git a/enter.txt b/enter.txt index eca075e..0234d0b 100644 --- a/enter.txt +++ b/enter.txt @@ -1,7 +1,324 @@ -OUTPUT "are we insane?" -INPUT ans -IF ans = "yes" THEN - OUTPUT "correct" -ELSE - OUTPUT "incorrect" -ENDIF +def average(listofmarks): + sum=0 + count=0 + for i in range(len(listofmarks)): + if listofmarks[i]!=-999: + sum+=listofmarks[i] + count+=1 + avg=sum/count + print("Total Marks : ", sum) + print("Average Marks : {:.2f}".format(avg)) + +#<-----------------------------------------------------------------------------------------------------> + +# Function for Highest score in the test for the class + +def Maximum(listofmarks): + for i in range(len(listofmarks)): + if listofmarks[i]!=-999: + Max=listofmarks[0] + break + for i in range(1,len(listofmarks)): + if listofmarks[i]>Max: + + + + + + + +def average(listofmarks): + + + sum=0 + + + count=0 + + + for i in range(len(listofmarks)): + + + if listofmarks[i]!=-999: + + + sum+=listofmarks[i] + + + count+=1 + + + avg=sum/count + + + print("Total Marks : ", sum) + + + print("Average Marks : {:.2f}".format(avg)) + + + + + +#<-----------------------------------------------------------------------------------------------------> + + + + + +# Function for Highest score in the test for the class + + + + + +def Maximum(listofmarks): + + + for i in range(len(listofmarks)): + + + if listofmarks[i]!=-999: + + + Max=listofmarks[0] + + + break + + + for i in range(1,len(listofmarks)): + + + if listofmarks[i]>Max: + + + Max=listofmarks[i] + + + return(Max) + + + + + +#<------------------------------------------------------------------------------------------------------> + + + + + +# Function for Lowest score in the test for the class + + + + + +def Minimum(listofmarks): + + + for i in range(len(listofmarks)): + + + if listofmarks[i]!=-999: + + + Min=listofmarks[0] + + + break + + + for i in range(1,len(listofmarks)): + + + if listofmarks[i] + + + + + +# Function for counting the number of students absent for the test + + + + + +def absentcount(listofmarks): + + + count=0 + + + for i in range(len(listofmarks)): + + + if listofmarks[i]==-999: + + + count+=1 + + + return(count) + + + + + +#<-------------------------------------------------------------------------------------------------------> + + + + + +# Function for displaying marks with highest frequency + + +def maxFrequency(listofmarks): + + + i=0 + + + Max=0 + + + print("Marks | Frequency") + + + for j in listofmarks: + + + if (listofmarks.index(j)==i): + + + print(j," | ",listofmarks.count(j)) + + + if listofmarks.count(j)>Max: + + + Max=listofmarks.count(j) + + + mark=j + + + i=i+1 + + + return(mark,Max) + + + + + + + + +#<-------------------------------------------------------------------------------------------------------> + + + + + +# Main function + + + + + +marksinFDS=[] + + +numberofstudents=int(input("Enter total number of students : ")) + + +for i in range(numberofstudents): + + + marks=int(input("Enter marks of student "+str(i+1)+" : ")) + + + marksinFDS.append(marks) + + + + + +flag=1 + + +while flag==1: + + + print("\n\n--------------------MENU--------------------\n") + + + print("1. Total and Average Marks of the Class") + + + print("2. Highest and Lowest Marks in the Class") + + + print("3. Number of Students absent for the test") + + + print("4. Marks with Highest Frequency") + + + print("5. Exit\n") + + + ch=int(input("Enter your Choice (from 1 to 5) :")) + + + + + + if ch==1: + + + average(marksinFDS) + + + a = input("Do you want to continue (yes/no) :") + + + if a == "yes": + + + flag = 1 + + + else: + + + flag = 0 + + + print("Thanks for using this program!") + + + + + + elif ch==2: + + + print("Highest Score in Class : ", Maximum(marksinFDS)) + + + print("Lowest Score in Class : ", Minimum(marksinFDS))