Nptel Problem Solving Through Program In C assignment 12 programing part.
1.
int f=0;
void findFact(int a,long int* p)
{
if(f==0)
{
*p=1;
f=1;
}
while(a>1){
*p*=a;
a=a-1;
}
return;
}
2.
#include<string.h>
int j = 0;
for(i = 0;i < n-1;i++)
{
for(j = 0;j < n-1-i;j++)
{
if (s[j].score<s[j+1].score)
{
int scoreswap = s[j].score;
s[j].score=s[j+1].score;
s[j+1].score=scoreswap;
int rollnoswap = s[j].rollno;
s[j].rollno=s[j+1].rollno;
s[j+1].rollno=rollnoswap;
char nameswap[20];
strcpy(nameswap,s[j].name);
strcpy(s[j].name,s[j+1].name);
strcpy(s[j+1].name,nameswap);
}
}
}
3.
int i;
element = (float*) calloc(n, sizeof(float));
if(element == NULL)
{
exit(0);
}
for(i = 0; i < n; ++i)
{
scanf("%f", element + i);
}
for(i = 1; i < n; ++i)
{
if(*element < *(element + i))
*element = *(element + i);
}
printf("Largest element = %.2f", *element);
return 0;
}
4.
int i = 0;
int j = 0;
i=(d1.inch+d2.inch)/12;
j=(d1.inch+d2.inch)%12;
if (i!=0) {
sum.feet=d1.feet+d2.feet+i;
sum.inch=j;
}
else
{
sum.feet=d1.feet+d2.feet;
sum.inch=d1.inch+d2.inch;
}
5.
int *a, *b, *c;a = (int *)malloc(n * sizeof(int));
b = (int *)malloc(n * sizeof(int));
c = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
{
scanf("%d", a + i);
}
for (i = 0; i < n; i++)
{
scanf("%d", b + i);
}
for (i = 0; i < n; i++)
{
*(c + i) = *(a + i) + *(b + i);
}
