Program to calculate average of marks, C/C++ Programming

Assignment Help:

Program for calculate average of total marks:

#include

using namespace std;

void print(int marks_arr[],int cnt)

{

int ind[cnt];

int i=0;

int j=0;

int k=0;

int s=0;

for(k=0;k

{

ind[k]=0;

}

int cnt1=0;

for(i=0;i

{

ind[cnt1]=1;

for(j=i+1;j

{

//cout<

if((marks_arr[i]==marks_arr[j])&&(marks_arr[i]!=-1))

{

ind[cnt1]=ind[cnt1]+1;

marks_arr[j]=-1;

//if(marks_arr[j]==-1)

//{

//break;

//}

}

}

cnt1++;

}

for(s=0;s

{

if(marks_arr[s]!=-1)

{

cout<<"\n"<

}

}

}

int add()

{

int mark;

cout<<"Enter the mark:";

cin>> mark;

return mark;

}

float avg(int mark[],int c)

{

int i,sum=0;

float average;

for(i=0;i

{

sum= sum+mark[i];

}

average=sum/c;

return average;

}

int marks_arr[100];

int main()

{

static int count=0;

//int marks_arr[100],

int choice,i,ch,searchelement,totalcount;

float val;

do

{

cout<<"\n 1.Add marks";

cout<<"\n 2.Display marks";

cout<<"\n 3.Find average";

cout<<"\n 4. Search marks ";

cout<<"\n 5.Print";

cout<<"\nEnter choice : ";

cin>>choice;

switch(choice)

{

case 1:

{

marks_arr[count]=add();

count++;

break;

}

case 2:

{

for(i=0;i

{

cout<

}

break;

}

case 3:

{

val= avg(marks_arr,count);

cout<

break;

}

case 4:

{

cout<<"\n Enter the mark to search:";

cin>>searchelement;

totalcount=0;

for(i=0;i

{

if(marks_arr[i]==searchelement)

{

totalcount=totalcount+1;

}

}

cout<<"No of times the element is present : "<

break;

}

case 5:

{

print(marks_arr,count);

}

}

cout<<"\nContinue [0-yes / 1-no] :";

cin>>ch;

}while(ch!=1);

}

 

 


Related Discussions:- Program to calculate average of marks

Sparce matrices, Write an algorithm for multiplication of two sparse matric...

Write an algorithm for multiplication of two sparse matrices using Linked Lists.

What are pre-processor directives, What are pre-processor directives? -...

What are pre-processor directives? - Pre-processor directives are placed at the beginning of a C program. They begin with # symbol. - This is the place, where library files

Prepare aime crossover alert expert adviso, Prepare aime crossover alert ex...

Prepare aime crossover alert expert adviso Project Description: Need to develop an expert advisor base on aime crossover alert indicator. Skills required is C Programming

Luminous and jewels, Byteland county is very famous for luminous jewels. Lu...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

201 it, overloadstream insertion opertator to display the data of object on...

overloadstream insertion opertator to display the data of object on the console

Net salary, please may i have a brief theory about a c++ program to find ne...

please may i have a brief theory about a c++ program to find net salary of employees

Error handling and constructor, Provide me the answer, Can a constructor th...

Provide me the answer, Can a constructor throws an exception? How to handle the error when the constructor fails?

Define the data type modifiers in c language, Define the Data Type Modifier...

Define the Data Type Modifiers in C language? There are three data types(int, float & double) above have the following modifiers. 1. short 2. long 3. signed 4. unsigned

Friend function in c++, Friend function in c++: class miles; class ...

Friend function in c++: class miles; class km  {    float value;    public :   // void input();     km convert(km  ,int a ) ;    void output()    {

How to implement tr- 069 protocol, Description - The TR-069 CPE WAN Managem...

Description - The TR-069 CPE WAN Management Protocol (CWMP) is a protocol that was created by the Broadband Forum (formally the DSL Forum) which sets out a common method for CPE de

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd