Wednesday, May 2, 2012

*~* VuPak2009 *~* CS201 ASSIGNMENT NO.2 COMPLETE AND CORRECT SOLUTION KINDLY FIND THE ATTACHMENT BY VIRTUALIANS GROUP

//VIRTUALIANS GROUP
#include <cstdlib>
#include <iostream>
double high_Temp(double [],int);
double low_Temp(double []);
double Average_Temp(double [],int);
using namespace std;
int main(int argc, char *argv[])
{
cout<<"Temperature Calculation system By VIRTUALIANS GROUP "<<endl ;
int days;
cout<<"Enter the number of consecutive days to read their temperature : ";
cin>>days;
double temp[days];
int i, j;
double t;
for(i=0;i<days;i++)
{
cout<<endl<<"Enter temperature for day "<<i+1<<" : ";
cin>>temp[i];
cout<<" VIRTUALIANS GROUP VIRTUALIANS GROUP"<<endl ;
}

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

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

if (temp[j] > temp[j+1])
{
t = temp[j];

temp[j] = temp[j+1];

temp[j+1] = t;
}
}
}

cout<<endl<<"The Average Temprature is : "<<Average_Temp(temp,days);

cout<<endl<<"The Higest Temprature is : "<<high_Temp(temp,days);

cout<<endl<<"The Lowest Temprature is : "<<low_Temp(temp)<<endl;

system("pause");
}
double high_Temp(double a[],int arraysize)
{
return a[arraysize-1];
}

double low_Temp(double a[])
{

int b=0;


return a[b];
}

double Average_Temp(double a[],int arraysize)
{


int i;

double c=0;

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


c=c+a[i];
}


c=c/i;

return c;
}












Dear students this is the complete solution of cs201 assignments no.2

kindly make some changes and submit it.

For any problem you surely welcome for consulting 

 Kindly find the attachment

Remember us in your pray by

VIRTUALIANS GROUP


--
MIT VIRTUALIANS

--
You received this message because you are subscribed to the Google Groups "Virtual University of Pakistan 2009" group.
To post to this group, send email to virtual-university-of-pakistan-2009@googlegroups.com.
To unsubscribe from this group, send email to virtual-university-of-pakistan-2009+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/virtual-university-of-pakistan-2009?hl=en.

No comments:

Post a Comment