C program for Quantitative Analysis of given data

-

C program for various statistical descriptions (Mean, Median, Mode,variance, standard deviation) of data and comments about characteristics of data. (i.e. Symmetric or skewed distributed)

Code:


#include <stdio.h>

#include <stdlib.h>

#include<math.h>


struct entry{

int value;

int frequency;

int meandiffs;

};

int main()

{

int n,i=0,j=0,temp=0,ci=0,x=0,larfrei=0;

float mean=0.0,median=0.0,variance=0.0;

int sig=0;

printf("Enter Number of Values:");

scanf("%d",&n);

struct entry *v = (struct entry*) malloc(n*sizeof(struct entry));

int *aray = (int*)malloc(n*sizeof(int));

printf("Enter Values: ");

for(i=0;i<n;i++){

scanf("%d",&aray[i]);

mean=mean+aray[i];

v[i].value=0;

v[i].frequency=0;

v[i].meandiffs=0;

}

mean = mean / n;

printf("Mean is: %.2f\n",mean);

for(i=0;i<n-1;i++){

for(j=0;j<n-1;j++){

if(aray[j]>aray[j+1]){

temp = aray[j];

aray[j]=aray[j+1];

aray[j+1]=temp;

}}}

if(sizeof(aray)%2==0){

median = ((float)aray[(n-1)/2]+(float)aray[(n/2)])/2;

}

else{median = aray[(n/2)];}

printf("Median is: %.2f\n",median);

v[0].value=aray[0];v[0].frequency=1;ci++;

for(i=1;i<n;i++){

sig=0;

for(x=0;x<ci;x++){

if(v[x].value==aray[i]){v[x].frequency++;sig=1;}

}

if(!sig){

v[ci].value=aray[i];v[ci].frequency=1;ci++;

}

}

printf("Value \tFrequency \t(X-Mean) \t(X-Mean)^2\n");

for(i=0;i<ci;i++){

v[i].meandiffs=pow((v[i].value-mean),2)*v[i].frequency;

variance = variance + v[i].meandiffs;

printf(" %d\t %d\t\t %.2f\t\t%.2f\n",v[i].value,v[i].frequency,v[i].value-mean,pow((v[i].value-mean),2));

if(v[i].frequency > v[larfrei].frequency){larfrei = i;}

}

if(v[larfrei].frequency==1){printf("All Numbers Have Same Frequency:1\n");}

else{

printf("Largest Frequency Number: %d Having Frequency: %d\n",v[larfrei].value,v[larfrei].frequency);

}

printf("Variance is: %.2f\n",round((variance/n)));

printf("Standard Deviation is: %.2f\n\n",round((sqrt(variance/n))));

if(mean>median){printf("Characteristic of Data: Data is Right Skewed\n");}

else if(mean<median){printf("Characteristic of Data: Data is Left Skewed\n");}

else{printf("Characteristic of Data: Data is Symmetric\n");}

}

Comments

Post a Comment

Popular posts from this blog

C program to evaluate Prefix Expression using Stack data structure

-
Simple C program to evaluate Prefix Expression using Stack data structure Code: #include<stdio.h> #include<conio.h> #include<string.h> int steck[10]; int top=-1; void push(int value) { steck[top++]=value; } int pop() { return(steck[top--]); } int ope(char c) { if(c=='+'||c=='-'||c=='*'||c=='/') return 1; else return 0; } void main() { char prefix[10]; int len,val,i,opr1,opr2,res; clrscr(); printf("Enter the prefix Expression: "); scanf("%s",prefix); len=strlen(prefix); for(i=len-1;i>=0;i--) { switch(ope(prefix[i])) { case 0: val=prefix[i]; push(val); break; case 1: opr1=pop(); opr2=pop(); switch(prefix[i]) { case '+': res=opr1+opr2; break; case '-': res=opr1-opr2; break; case '*': res=opr1*opr2; break; case '/': res=opr1/opr2; break; } push(res); } } printf("Result is %d",steck[top]); getch(); }
Read more

Java Program to Implement sorting algorithm using TCP on Server application

-
Simple Java program to Implement sorting algorithm using TCP on Server application Input: Give input on client side and client should receive sorted output from server and display sorted list on input(client) side. Note: You can implement any sorting algorithm by changing the sorting algorithm code on server side Code: Server: package aj.pkg7; import java.io.*; import java.net.*; import java.util.*; class Server { public static void main(String args[]) throws Exception { ServerSocket ss=new ServerSocket(1111); Socket s=ss.accept(); DataInputStream din=new DataInputStream(s.getInputStream()); DataOutputStream dout=new DataOutputStream(s.getOutputStream()); int r,i=0; int n=din.readInt(); int a[]=new int[n]; System.out.println("data:"); int count=0; for(i=0;i<n;i++) { a[i]=din.readInt(); } int number = a.length; for (int i1 = 0; i1 < number-1; i1++) for (int j1 = 0; j1 < number-i1-1; j1++) if (a[j1] > a[j1+1]) { int temp = a[j1]; a[j1] = a[j1+1]; a[j1+1] = temp; } ...
Read more

C++ program to perform data transformation Min-max and Z score Normalization

-
Simple C++ program to perform data transformation using min-max normalization, z-score normalization and decimal scaling operation. Code: #include<iostream> #include<math.h> using namespace std; int main() { int n; double sum=0; cout<<"Enter The Number of values:"; cin>>n; int a[n],r1,r2; for(int i=0;i<n;i++) { cin>>a[i]; } cout<<"Enter starting and ending range for normalization:"; cin>>r1>>r2; double max = a[0]; int min = a[0]; for (int i = 0; i <n; i++) { if (a[i] > max) { max = a[i]; } else if (a[i] < min) { min = a[i]; } } float v[n];double temp; for(int i=0;i<n;i++) { temp=double(double(double(a[i]-min)*(r2-r1))/(max-min))+ r1; v[i]=temp; } cout<<"normalization by Min-max"<<endl; cout<<"Values a...
Read more