Skip to main content

The Fundamentals of Digital Marketing Certification

The Fundamentals of Digital Marketing Certification
Trying to make use of some spare time during these endless lockdowns. I completed The Fundamentals of Digital Marketing course on Google Digital Garage and got certified. This is not a great victory, nevertheless, I celebrate every small step towards a greater goal. #googlegarage #fundamentalsofdigitalmarketing #digitalmarketing

FDS 2

 Practical No: -2

Experiment No. 2: Write a Python program to store marks scored in subject “Fundamentals of Data

Structure” by n students in the class. Write function 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

Code:

# Function for average score of the class

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]<Min:

 Min=listofmarks[i]

 return(Min)

#<------------------------------------------------------------------------------------------------------->

# 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))

 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==3:

 print("Number of Students absent in the test : ", absentcount(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==4:

 mark,fr = maxFrequency(marksinFDS)

 print("Highest frequency is of marks {0} that is {1} ".format(mark,fr))

 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==5:

 flag=0

 print("Thanks for using this program!")

 else:

 print("!!Wrong Choice!! ")

 a=input("Do you want to continue (yes/no) :")

 if a=="yes":

 flag=1

 else:

 flag=0

 print("Thanks for using this program!")

#<---------------------------------------------END OF PROGRAM---------------------------------------







Output:

Enter total number of students : 10

Enter marks of student 1 : 80

Enter marks of student 2 : 30

6Enter marks of student 3 : 66

Enter marks of student 4 : 54

Enter marks of student 5 : 90

Enter marks of student 6 : 45

Enter marks of student 7 : 70

Enter marks of student 8 : 60

Enter marks of student 9 : 70

Enter marks of student 10 : 80

--------------------MENU--------------------

1. Total and Average Marks of the Class

2. Highest and Lowest Marks in the Class

3. Number of Students absent for the test

4. Marks with Highest Frequency

5. Exit

Enter your Choice (from 1 to 5) :1

Total Marks : 645

Average Marks : 64.50

Do you want to continue (yes/no) :yes

--------------------MENU--------------------

1. Total and Average Marks of the Class

2. Highest and Lowest Marks in the Class

3. Number of Students absent for the test

4. Marks with Highest Frequency

5. Exit

Enter your Choice (from 1 to 5) :2

Highest Score in Class : 90

Lowest Score in Class : 30

Do you want to continue (yes/no) :yes

--------------------MENU--------------------

1. Total and Average Marks of the Class

2. Highest and Lowest Marks in the Class

3. Number of Students absent for the test

4. Marks with Highest Frequency

5. Exit

Enter your Choice (from 1 to 5) :3

Number of Students absent in the test : 0

Do you want to continue (yes/no) :yes

--------------------MENU--------------------

1. Total and Average Marks of the Class

2. Highest and Lowest Marks in the Class

3. Number of Students absent for the test

4. Marks with Highest Frequency

5. Exit

Enter your Choice (from 1 to 5) :4

Marks | Frequency

80 | 2

30 | 1

66 | 1

54 | 1

90 | 1

45 | 1

70 | 2

60 | 1

Highest frequency is of marks 80 that is 2

Do you want to continue (yes/no) :yes

--------------------MENU--------------------

1. Total and Average Marks of the Class

2. Highest and Lowest Marks in the Class

3. Number of Students absent for the test

4. Marks with Highest Frequency

5. Exit

Enter your Choice (from 1 to 5) :5

Thanks for using this program!


GALLERY

GALLERY
photos

ABOUT

HTML CSS, VB.net Developer and Java, C programming. With Loves Problem Solving and to Unreval the Mysteries behind the Magic of Computer Programming

Followers

MY PROJECTS

Popular posts from this blog

FDS 12

 Practical No: -12 Experiment No. 12: A double-ended queue(deque) is a linear list in which additions and deletions may be made at either end. Obtain a data representation mapping a deque into a one-dimensional array. Write C++ program to simulate deque with functions to add and delete elements from either end of the deque. Code: using namespace std; #include<iostream> #include<stdio.h> #include<process.h> #define MAX 30 typedef struct dequeue {  int data[MAX];  int rear,front; }dequeue; void initialize(dequeue *p); int isEmpty(dequeue *p); int isFull(dequeue *p); void enqueueRear(dequeue *p,int x); void enqueueFront(dequeue *p,int x); int dequeueFront(dequeue *p); int dequeueRear(dequeue *p); void display(dequeue *p); main() {  int i,x,choice,n;  dequeue q;  initialize(&q);  do  {  cout<<"\n 1.Create \n 2.Insert(rear) \n 3.Insert(front) \n 4.Delete(rear) \n 5.Delete(front)";  cout<<"\n 6.Display \n 7.Ex...
View More

dsa

 https://drive.google.com/drive/folders/1xaWUPlioGjpK0WAmAD-mvlxAuA8eTK1c https://github.com/khan0003-py/SPPU-Computer-4th-Sem-Lab-Codes/tree/master/DSAL
View More

FDS 11

 Practical No: -11 Experiment No. 11: Queues are frequently used in computer programming, and a typical example is the creation of a job queue by an operating system. If the operating system does not use priorities, then the jobs are processed in the order they enter the system. Write C++ program for simulating job queue. Write functions add job and delete job from queue. Code: using namespace std; #include<iostream> #include<stdio.h> #include<conio.h> #include<stdlib.h> #define SIZE 5 void enqueue(int x); void dequeue(); void display(); int FRONT=-1; int REAR=-1; int QUEUE[SIZE]; main() {  int x,ch;  while(1)  {  cout<<"\n 1:Add Job";  cout<<"\n 2:Delete Job";  cout<<"\n 3:Display";  cout<<"\n 4:Exit";  cout<<"\n Enter Your Choice:";  cin>>ch;  switch(ch)  {  case 1:  cout<<"Enter Job:";  cin>>x;  enqueue(x);  break;  case 2: ...
View More

Contact us

Name

Email *

Message *