Beruflich Dokumente
Kultur Dokumente
Qanita Zakir
1|P a g e
Qanita Zakir
TableofContents
Acknowledgements: .................................................................................................................... 3 Abstract: ..................................................................................................................................... 3 Requirement engineering: ........................................................................................................... 3
2|P a g e
Qanita Zakir
Acknowledgements:
The students of BS(IT) 2010 and our teacher Miss Saima assigned us to prepare a software that performs statistical calculations and automate the generation of frequency distribution table. We were given freedom of choice. This software mainly focuses grouped data but it can also perform calculations regarding ungrouped data Thanks to Miss Saima who has taught us Statistics in this semester, Miss Sana Mehdi who has taught us programming, Miss Narmeen Shawoo Bawani for her utmost effort in present algorithms. Thanks also to my parents and siblings who supported me when I was preparing this report.
Abstract:
This software automates the statistical calculations and help user in giving quick and accurate answers. This software can calculate Arithmetic Mean, Geometric Mean, Harmonic Mean, Median and Mode for Grouped and Ungrouped Data. Not only that, it can also calculate Variance, Standard Deviation, Co-efficient of Variance, Mean Deviation about Mean and Median and Quartile Deviations for Grouped Data
Requirement engineering:
Feasibility Studies:
Ungrouped Data only works for integer raw data. Useful for every technical or non-technical Statistics student. Can be used even in outdated computers. No as such hardware requirements.
1. 2. 3. 4. 5.
For Grouped Data:
1.
3|P a g e
Qanita Zakir
4|P a g e
Qanita Zakir
//takes input from the user //arranging the values in ascending order //prints the list //prints the frequency distribution table //calculates Frequency, Cumulative frequency etc //number of classes to be made with an interval //calculating class boundries //calculating class intervals //calculating mid points //calculating frequency //calculating relative frequency //calculating cumulative frequency //frequency distribution //calculates AM //calculates HM //calculates GM //calculates Mode //calculates Median
5|P a g e
Qanita Zakir
cout<<"\n\n\n\n1.Arithmetic Mean\n2.Geometric Mean\n3.Harmonic Mean\n4.Mode\n"; cout<<"5.Median\n6.Frequency Distribution\n7.Exit\n\nChoice:"; cin>>opchoice; if(opchoice==1) {arithmetic();getch();} if(opchoice==2) {geometric();getch();} if(opchoice==3) {harmonic();getch();} if(opchoice==4) {mode();getch();} if(opchoice==5) {median();getch();} if(opchoice==6) {clrscr();FD();getch();} }
getch(); clrscr(); cout<<"\nDo you want to enter into Main Menu?\nEnter Y/N: ";cin>>YN; will++; if(YN=='Y' || YN=='y') will=1; } getch(); return 0; } //--------------------------------------------------------------function------------------------------------------------------------------------------void getdata() { int loop=0, loop2; char * classes=(char *)NULL, *frequency=(char *)NULL; cout<<"\n\n"; int r=1;while(r<=80){cout<<"\xDB";r++;} cout<<"\n";
6|P a g e
Qanita Zakir
for(loop2=0;loop2<=max-1;loop2++) { loop=0;while(*(classes+loop)!=(char)NULL){cout<<*(classes+loop);loop++;} cout<<loop2+1<<"\t:"; cin>>list[loop2]; cout<<endl; } } //--------------------------------------------------------------function------------------------------------------------------------------------------void printlist() { cout<<endl<<endl; for(int a=0;a<max;a++) cout<<list[a]<<'\t'; cout<<endl; } //function void FD() { calculation(); printtable(); } //--------------------------------------------------------------function------------------------------------------------------------------------------void calculation() { n=no_of_classes(); classboundry(0); classinterval(0); midpoint(0); frequency(0); relativefrequency(0); CF[0]=F[0]; cumulativefrequency(1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void printtable() { cout<<endl<<endl; int row=1;while(row!=80){cout<<"\xDB";row++;} cout<<endl<<endl; cout<<setw(50)<<"FREQUENCY DISTRIBUTION\n\n"; row=1;while(row!=80){cout<<"\xDB";row++;}
7|P a g e
Qanita Zakir
cout<<setw(12)<<"C.I"<<setw(5)<<"\xDE"<<setw(10)<<"C.B"<<setw(6)<<"\xDE"<<setw(5)<<"F"; cout<<setw(4)<<"\xDE"<<setw(8)<<"C.F"<<setw(4)<<"\xDE"<<setw(5)<<"X"<<setw(5)<<"\xDE"; cout<<setw(11)<<"R.F\n"<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; for(int a=0; a<n;a++) { cout<<endl<<" "<<setw(4)<<CI[a].lowest<<" "<<setw(2)<<"\x7C"<<" "<<setw(5)<<CI[a].highest; cout<<setw(2)<<"\xDE"<<" "<<setw(5)<<CB[a].lowest<<setw(2)<<"\x7C"<<" "<<setw(5)<<CB[a].highest; cout<<setw(2)<<"\xDE"<<setw(5)<<F[a]<<setw(4)<<"\xDE"<<setw(7)<<CF[a]<<setw(5)<<"\xDE"; cout<<setw(6)<<Midpoint[a]<<setw(4)<<"\xDE"; cout<<setw(6)<<setprecision(2)<<RF[a]; } cout<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} } //--------------------------------------------------------------function------------------------------------------------------------------------------int no_of_classes() { int maxn, minn; maxn=maximum(list); minn=minimum(list); int HB; cout<<"Enter the class interval:"; cin>>h; h=h+1; int x=h-(maxn%h) ; //finding the difference between max and highest class boundry int y=minn%h; //finding the difference between min and lowest class boundry int n; //no of classes LB=minn-y; HB=maxn+x; n=(HB-LB)/h; return n; //returning the no of classes t calling function } //--------------------------------------------------------------function------------------------------------------------------------------------------void classboundry(int a) { if(a<n) { CB[a].lowest=(a*h+LB)-0.5; CB[a].highest=CB[a].lowest+h; } else return; classboundry(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void classinterval(int a) { if(a<n) { CI[a].lowest=CB[a].lowest+0.5; CI[a].highest=CB[a].highest-0.5; } else return;
8|P a g e
Qanita Zakir
classinterval(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void midpoint(int a) { if(a<n) Midpoint[a]=(CB[a].lowest+CB[a].highest)/2.0; else return; midpoint(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void frequency(int a) { if(a<n) { for(int b=0;b<=max-1;b++) if(list[b]>=CI[a].lowest && list[b]<=CB[a].highest) F[a]=F[a]+1; } else return; frequency(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void relativefrequency(int a) { if(a<n) { RF[a]=F[a]; RF[a]=RF[a]/max; } else return; relativefrequency(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void cumulativefrequency(int a) { if(a<n) CF[a]=CF[a-1]+F[a]; else return; cumulativefrequency(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void sorting() { for(int a=0;a<max;a++) { for(int b=0;b<max-a-1;b++) { float temp=0; //if the element is greater than the following one then swap if(list[b]>list[b+1]) { temp=list[b]; //swaping list[b]=list[b+1]; list[b+1]=temp; } } } } //--------------------------------------------------------------function-------------------------------------------------------------------------------
9|P a g e
Qanita Zakir
int maximum(int list1[]) { int maxn=list1[0]; for(int loop=0;loop<max;loop++) if(list1[loop]>maxn) maxn=list1[loop]; return maxn; } //--------------------------------------------------------------function------------------------------------------------------------------------------int minimum(int list1[]) { int minn=list1[0]; for(int loop=0;loop<max;loop++) if(list1[loop]<minn) minn=list1[loop]; return minn; } /********************************************************************************************************************** ******* --------------------------------------------------------------CALCULATIONS-----------------------------------------------------------------********************************************************************************************************************** *******/ //--------------------------------------------------------------function------------------------------------------------------------------------------void arithmetic() { double temp1=0; for(int b=0;b<max;b++) temp1=temp1+list[b]; AM=temp1/max; cout<<"\n\n\nAM="<<AM; } //--------------------------------------------------------------function------------------------------------------------------------------------------void harmonic() { double temp1=0; for(int b=0;b<max;b++) temp1=temp1+(1.0/list[b]); HM=max/temp1; cout<<"\n\n\nHM="<<HM; } //--------------------------------------------------------------function------------------------------------------------------------------------------void geometric() { double temp1=1, temp2; for(int b=0;b<max; b++) temp1=temp1*list[b]; temp2=1.0/max; GM=pow(temp1, temp2); cout<<"\n\n\nGM="<<GM; } //--------------------------------------------------------------function------------------------------------------------------------------------------void median() { int term=0; if(max%2==1) term=(max+1)/2; if(max%2==0) term=max/2; Median=list[term-1]; cout<<"\n\n\nMedian="<<Median; }
10|P a g e
Qanita Zakir
//--------------------------------------------------------------function------------------------------------------------------------------------------void mode() { int maxn; int fre[100]; int counter,loc; for(int a=0;a<max;a++) { counter=0; for(int b=0;b<max;b++) { if(list[a]==list[b]) counter++; } fre[a]=counter; } maxn=maximum(fre); loc=location(maxn,fre,max); Mode=list[loc]; cout<<"\n\n\nMode="<<Mode; } //--------------------------------------------------------------function------------------------------------------------------------------------------int location(int item, int* list1, int loop) { int loc=(int)NULL; for(int a=0;a<loop;a++) if(*(list1+a)==item) loc=a; return loc; }
11|P a g e
Qanita Zakir
//This function takes input of frequency from the //prints the frequency distribution table //find out the location of given frequency //frequency distribution //calculates Frequency, Cumulative frequency etc //number of classes to be made with an interval //find out maximum no in a given list //calculating class boundries //calculating class intervals //calculating mid points //calculating frequency //calculating relative frequency //calculating cumulative frequency //calculates AM //calculates HM //calculates GM //calculates Mode //calculates Median //calculates Standard Deviation //calculates Variance
12|P a g e
Qanita Zakir
//clear the screen //whileloop variable, choice of operation e.g 1 for //stores y if user wants to enter main menu //clearing the screen
cout<<"\n\n\n\n1.Arithmetic Mean\n2.Geometric Mean\n3.Harmonic Mean\n4.Mode\n"; cout<<"5.Median\n6.Standard Deviation\n7.Variance\n8.Quartile Deviation\n; cout<<9.Mean Deviation\n10.Exit\n\nChoice:"; cin>>opchoice; if(opchoice==1) {clrscr();arithmetic();getch();} if(opchoice==2) {clrscr();geometric();getch();} if(opchoice==3) {clrscr();harmonic();getch();} if(opchoice==4) {clrscr();mode();getch();} if(opchoice==5) {clrscr();median();getch();} if(opchoice==6) {clrscr();sdeviation();getch();} if(opchoice==7) {clrscr();variance();getch();} if(opchoice==8) {qdeviation();getch();} if(opchoice==9) {mdeviation();getch();} } getch(); clrscr(); cout<<"\nDo you want to enter into Main Menu?\nEnter Y/N: ";cin>>YN; will++; if(YN=='Y' || YN=='y') will=1; } getch(); return 0; } //--------------------------------------------------------------function-------------------------------------------------------------------------------
13|P a g e
Qanita Zakir
for(int loop=0;loop<n;loop++) { cout<<"\n"<<setw(22)<<CB[loop].lowest<<"-"<<CB[loop].highest<<"\t\t"; cin>>F[loop];} } //--------------------------------------------------------------function------------------------------------------------------------------------------void FD() { calculation();printtable(); } //--------------------------------------------------------------function------------------------------------------------------------------------------void calculation() { classinterval(0);midpoint(0);relativefrequency(0);CF[0]=F[0];cumulativefrequency(1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void printtable() { cout<<endl<<endl; int row=1;while(row!=80){cout<<"\xDB";row++;} cout<<endl<<endl; cout<<setw(50)<<"FREQUENCY DISTRIBUTION\n\n"; row=1;while(row!=80){cout<<"\xDB";row++;} cout<<endl<<endl<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<setw(12)<<"C.I"<<setw(5)<<"\xDE"<<setw(10)<<"C.B"<<setw(6)<<"\xDE"<<setw(5)<<"F";
14|P a g e
Qanita Zakir
cout<<setw(4)<<"\xDE"<<setw(8)<<"C.F"<<setw(4)<<"\xDE"<<setw(5)<<"X"<<setw(5)<<"\xDE"; cout<<setw(11)<<"R.F\n"<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; for(int a=0; a<n;a++) { cout<<endl<<" "<<setw(4)<<CI[a].lowest<<" "<<setw(2)<<"\x7C"<<" "<<setw(5)<<CI[a].highest; cout<<setw(2)<<"\xDE"<<" "<<setw(5)<<CB[a].lowest<<setw(2)<<"\x7C"<<" "<<setw(5)<<CB[a].highest; cout<<setw(2)<<"\xDE"<<setw(5)<<F[a]<<setw(4)<<"\xDE"<<setw(7)<<CF[a]<<setw(5)<<"\xDE"; cout<<setw(6)<<Midpoint[a]<<setw(4)<<"\xDE"; cout<<setw(6)<<setprecision(2)<<RF[a]; } cout<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} } //--------------------------------------------------------------function------------------------------------------------------------------------------float summation(float *list) { float summ=0; for(int b=0;b<n;b++) summ=summ+*(list+b); return summ; } //--------------------------------------------------------------function------------------------------------------------------------------------------void classboundry(int a) { if(a<n) { CB[a].lowest=(a*h+LI)-diff; CB[a].highest=CB[a].lowest+h; } else return; classboundry(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void classinterval(int a) { if(a<n) { CI[a].lowest=CB[a].lowest+diff; CI[a].highest=CB[a].highest-diff; } else return; classinterval(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void midpoint(int a) { if(a<n) Midpoint[a]=(CB[a].lowest+CB[a].highest)/2.0; else return; midpoint(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void relativefrequency(int a) { sum=summation(F); if(a<n) {
15|P a g e
Qanita Zakir
else
return; relativefrequency(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------void cumulativefrequency(int a) { if(a<n) CF[a]=CF[a-1]+F[a]; else return; cumulativefrequency(a+1); } //--------------------------------------------------------------function------------------------------------------------------------------------------float maximum(float list1[]) { float maxn=list1[0],loop=0; for(loop=0;loop<n;loop++) if(list1[loop]>maxn) maxn=list1[loop]; return maxn; } /********************************************************************************************************************** ******* --------------------------------------------------------------CALCULATIONS-----------------------------------------------------------------********************************************************************************************************************** *******/ //--------------------------------------------------------------function------------------------------------------------------------------------------void arithmetic() { for(int a=0;a<n;a++) fx[a]=F[a]*Midpoint[a]; sumfx=summation(fx); AM=sumfx/sum; cout<<endl<<endl<<endl<<endl; int row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; cout<<setw(22)<<"C.B"<<setw(8)<<"\xDE"<<setw(5)<<"F"<<setw(4)<<"\xDE"<<setw(8)<<"X"<<setw(4)<<"\x DE"<<setw(5)<<"FX"; cout<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; for(a=0; a<n;a++) { cout<<endl<<setw(18)<<CB[a].lowest<<setw(3)<<"\x7C"<<setw(5)<<CB[a].highest<<setw(4)<<"\xD E"; cout<<setw(5)<<F[a]<<setw(4)<<"\xDE"<<setw(8)<<Midpoint[a]<<setw(4)<<"\xDE"<<setw(6)<<fx[a]; } cout<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<endl<<"\xE4"<<"f="<<sum<<endl<<endl<<"\xE4"<<"fx="<<sumfx; cout<<"\n\nAM="<<AM; }
16|P a g e
Qanita Zakir
//--------------------------------------------------------------function------------------------------------------------------------------------------void harmonic() { for(int a=0;a<n;a++) f_x[a]=F[a]/Midpoint[a]; sumf_x=summation(f_x); HM=sum/sumf_x; cout<<endl<<endl<<endl<<endl; int row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<setw(22)<<"C.B"<<setw(8)<<"\xDE"<<setw(5)<<"F"<<setw(4)<<"\xDE"<<setw(8)<<"X"; cout<<setw(4)<<"\xDE"<<setw(7)<<"1/FX"<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; for(a=0; a<n;a++) { cout<<endl<<setw(18)<<CB[a].lowest<<setw(3)<<"\x7C"<<setw(5)<<CB[a].highest; cout<<setw(4)<<"\xDE"<<setw(5)<<F[a]<<setw(4)<<"\xDE"<<setw(8)<<Midpoint[a]; cout<<setw(4)<<"\xDE"<<setw(6)<<setprecision(2)<<f_x[a]; } cout<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<endl<<"\xE4"<<"f="<<sum<<endl<<endl<<"\xE4"<<"1/fx="; cout<<setprecision(2)<<sumf_x; cout<<"\n\nHM="<<HM; } //--------------------------------------------------------------function------------------------------------------------------------------------------void geometric() { for(int a=0;a<n;a++) flogx[a]=F[a]*(log10(Midpoint[a])); sumflogx=summation(flogx); GM=exp((sumflogx/sum)*log(10)); cout<<endl<<endl<<endl<<endl; int row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<setw(22)<<"C.B"<<setw(8)<<"\xDE"<<setw(5)<<"Fi"<<setw(4)<<"\xDE"<<setw(7)<<"log xi"<<setw(3)<<"\xDE"; cout<<setw(10)<<"fi log xi"<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; for(a=0; a<n;a++) { cout<<endl<<setw(18)<<CB[a].lowest<<setw(3)<<"\x7C"<<setw(5)<<CB[a].highest<<setw(4)<<"\xD E"; cout<<setw(5)<<F[a]<<setw(4)<<"\xDE"<<" "; cout<<setprecision(2)<<setw(5)<<flogx[a]/F[a]<<setw(3)<<"\xDE"<<" "; cout<<setprecision(2)<<setw(6)<<flogx[a]; } cout<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<endl<<"\xE4"<<"f="<<sum<<endl<<endl<<"\xE4"<<"flogx=";
17|P a g e
Qanita Zakir
cout<<setprecision(2)<<sumflogx; cout<<"\n\nGM="<<GM; } //--------------------------------------------------------------function------------------------------------------------------------------------------void median() { int term=0; if(n%2==1) term=(n+1)/2; if(n%2==0) term=n/2; Median=CB[term-1].lowest+((h/F[term-1])*((sum/2)-CF[term-2])); printtable(); cout<<"\n\nL="<<CB[term-1].lowest<<"\n\nh="<<h<<"\n\nf="<<F[term1]<<"\n\n\xE4"<<"f="<<sum<<"\n\nCF="<<CF[term-2]<<"\n\n"; cout<<"Median="<<Median; } //--------------------------------------------------------------function------------------------------------------------------------------------------void mode() { float maxn=(float)NULL; int index=(int)NULL; maxn=maximum(F); index=location(maxn,F,n); Mode=CB[index].lowest+(((F[index]-F[index-1])/((2*F[index])-F[index-1]-F[index+1]))*h); printtable(); cout<<"\n\nL="<<CB[index].lowest<<"\n\nfm="<<F[index]<<"\n\nf1="<<F[index1]<<"\n\nh="<<h<<"\n\nf2="<<F[index-2]<<"\n\n"; cout<<"Mode="<<Mode; } //--------------------------------------------------------------function------------------------------------------------------------------------------void sdeviation() { variance(); SD=sqrt(Var); C=(SD/AM)*100; cout<<"\n\nStandard Deviation="<<SD<<"\n\nCo-efficient of Variance="<<C<<"%"; } //--------------------------------------------------------------function------------------------------------------------------------------------------void variance() { arithmetic(); for(int a=0;a<n;a++) fxAM[a]=F[a]*pow((Midpoint[a]-AM),2); sumfxAM=summation(fxAM); Var=sumfxAM/sum; getch(); clrscr(); cout<<endl<<endl<<endl<<endl; int row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<setw(19)<<"C.B"<<setw(8)<<"\xDE"<<setw(5)<<"Fi"<<setw(4)<<"\xDE"<<setw(9)<<"(XiAM)2"<<setw(4)<<"\xDE"; cout<<setw(11)<<"fi(Xi-AM)2"<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; for(a=0; a<n;a++) { cout<<endl<<setw(15)<<CB[a].lowest<<setw(3)<<"\x7C"<<setw(5)<<CB[a].highest<<setw(4)<<"\xD E"; cout<<setw(6)<<F[a]<<setw(3)<<"\xDE"<<" "<<setw(9)<<fxAM[a]/F[a]; cout<<setw(2)<<"\xDE"<<" "<<setw(9)<<fxAM[a];
18|P a g e
Qanita Zakir
cout<<endl<<endl<<"\xE4"<<"f="<<sum<<endl<<endl<<"\xE4"<<"f(Xi-AM)2="; cout<<setprecision(4)<<sumfxAM<<"\n\nVariance="<<Var; } //--------------------------------------------------------------function------------------------------------------------------------------------------void qdeviation() { int term=0, choice; if(n%2==1) term=(n+1)/2; if(n%2==0) term=n/2; cout<<"\n\t1.First Quartile Deviation\n\t2.Second Quartile Deviation\n\t3.Third Quartile Deviation\n\t4.Fourth Quartile Deviation\n\tChoice:"; cin>>choice; if(choice>0&&choice<5) { clrscr(); Q=CB[term-1].lowest+((h/F[term-1])*(((sum/4)*choice)-CF[term-2])); printtable(); cout<<"\n\nL="<<CB[term-1].lowest<<"\n\nh="<<h<<"\n\nf="<<F[term1]<<"\n\n\xE4"<<"f="<<sum<<"\n\nCF="<<CF[term-2]<<"\n\n"; cout<<"Q"<<choice<<"="<<Q; } } //--------------------------------------------------------------function------------------------------------------------------------------------------void mdeviation() { int choice; cout<<"\n\t1.Mean Deviation about Mean\n\t2.Mean Deviation about Median\n\tChoice:"; cin>>choice; if(choice==1) { arithmetic(); float temp; for(int a=0;a<n;a++) { temp=Midpoint[a]-AM; if(temp<0) temp=-temp; fxMD[a]=F[a]*temp; } sumfxMD=summation(fxMD); MD=sumfxMD/sum; getch(); clrscr(); cout<<endl<<endl<<endl<<endl; int row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<setw(22)<<"C.B"<<setw(8)<<"\xDE"<<setw(5)<<"Fi"<<setw(4)<<"\xDE"<<setw(4)<<"\x B3"<<"X-AM"<<"\xB3"; cout<<setw(2)<<"\xDE"<<setw(3)<<"fi"<<"\xB3"<<"X-AM"<<"\xB3"<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; for(a=0; a<n;a++) {
19|P a g e
Qanita Zakir
E";
cout<<endl<<endl<<"\xE4"<<"f="<<sum<<endl<<endl<<"\xE4"<<"fi"<<"\xB3"<<"XAM"<<"\xB3"<<"="; printf("%.3f\n\n",sumfxMD); cout<<"Mean Deviation about Mean="<<MD; C=(MD/AM)*100; cout<<"\n\nCo-efficient of Mean Deviation about Mean="<<C; } if(choice==2) { median(); for(int a=0;a<n;a++) { float temp=Midpoint[a]-Median; if(temp<0) temp=-temp; fxMD[a]=F[a]*temp; } sumfxMD=summation(fxMD); MD=sumfxMD/sum; getch(); clrscr(); cout<<endl<<endl<<endl<<endl; int row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<setw(22)<<"C.B"<<setw(8)<<"\xDE"<<setw(5)<<"Fi"<<setw(4)<<"\xDE"<<setw(2)<<"\x B3"<<"X-Med"<<"\xB3"; cout<<setw(4)<<"\xDE"<<setw(7)<<"fi"<<"\xB3"<<"X-Med"<<"\xB3"<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl; for(a=0; a<n;a++) { cout<<endl<<setw(18)<<CB[a].lowest<<setw(3)<<"\x7C"<<setw(5)<<CB[a].highest<<setw(4)<<"\xD E"; cout<<setw(5)<<F[a]<<setw(4)<<"\xDE"<<" "; cout<<setw(4)<<setprecision(2)<<fxMD[a]/F[a]; cout<<setw(6)<<"\xDE"<<" "; cout<<setprecision(2)<<fxMD[a]; } cout<<endl<<endl; row=1;while(row!=80){cout<<"\xDF";row++;} cout<<endl<<endl<<"\xE4"<<"f="<<sum<<endl<<endl<<"\xE4"<<"fi"<<"\xB3"<<"XAM"<<"\xB3"<<"="; printf("%.3f\n\n",sumfxMD); cout<<"Mean Deviation about Median="<<MD; C=(MD/Median)*100; cout<<"\n\nCo-efficient of Mean Deviation about Median="<<C<<"%";
20|P a g e
Qanita Zakir
} //--------------------------------------------------------------function------------------------------------------------------------------------------int location(float item, float* list1, int loop) { int loc=(int)NULL; for(int a=0;a<loop;a++) if(*(list1+a)==item) loc=a; return loc; }
References
Lectures of Miss Saima
21|P a g e