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!
#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,total; float val; do { cout<<"\n 1. Add student marks"; cout<<"\n 2. Display student marks"; cout<<"\n 3. Find average of all marks"; cout<<"\n 4. Calculate the standard deviation"; cout<<"\n 5. Delete a student mark"; cout<<"\n 6. Search all marks "; cout<<"\n 7. Print all marks";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<< "The avg of total marks is: "< break; } case 4: case 5: case 6: { 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 7: { print(marks_arr,count); } } cout<<"\nContinue [0-yes / 1-no] :"; cin>>ch; }while(ch!=1); }
Implement, in rPeANUt, the a Fibonacci function by using the simple recursive approach. The Fibonacci function can be implemented in c as follow: int fib(int x) { if (x
Step 1 Define the program headers and the variables #include #include #include #include void main() { char prompt; float a,b,c,d,e; floa
If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms? Your mission (sho
write a program to accept ten numbers and display the total
We are seeking a talented developer/team with great experience in programming apps for both Android and iOS. Our project needs great skills and experience in making good functional
Write a program to compute the following equation for values of time. y = 2x+3 The values of time are stored in the file program.dat and the solution should be display
store the name of the political parties and the corresponding votes in two lists of equal length. access the lists is provided by two methods, each of which creates an interator th
Explain the class invariant. - It's a condition that ensures correct working of a class and defines all the valid states for an object. - When an object is created class inv
#questio A charitable organization wants to design a special ATM machine to be used by needy people. The association supplies the needy person with a pin number to be able to use
Assume we wish to partition the square roots of the integers from 1 to 100 in to two piles of fifty numbers every, such that the sum of the numbers in the first pile is as close as
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