Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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); }
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); }
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); }
//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); }
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); }
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); }
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); }
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); }
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); }
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); }
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); }
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); }
case 5:
print(marks_arr,count);
cout<<"\nContinue [0-yes / 1-no] :";
cin>>ch;
}while(ch!=1);
Program is to define a class as employee: Write a program to define a class as employee and collect information about them by using classes and object class employee {
the problem description. The order of the C Program should be as follows: Variables and constants Use #define statements to define the constants. Use arr
Write a program called OddEven that will prompt the user for an integer and print/display a message indicating whether it is even or odd. Continue prompting for numbers from the us
In this assignment you are required to develop a program that allows the creation, viewing and storage of information about ITECH7603 Students. In order to complete the task you ha
Static Member Functions All the objects of the class share static data members of a class. The example above demonstrates how to keep track of all the objects of a class which
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
Write a function to determine whether a number is prime: it will return true if the input is prime and false otherwise. Use it to see whether -7 is prime.
Rules of function: Inline function created without prototype it reduces the memory and it is used only for small function. Inline function cannot have recursion, static var
A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concate
Define the Processing of a Structure? The members of structure are typically processed individually as separate entities. So we must be able to access the individual structure
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd