Problem Solving Through Programming in C Week 12: Programming Assignments Jan-Jun 2022

 NPTEL PROGRAMMING ASSIGNMENTS

Problem Solving Through Programming in C

Week-12: Program 01

Due Date of Submission 2022-04-21, 23:59 IST

Write a program in C to find the factorial of a given number using pointers.

--Solution-- 

  void findFact(int n, long int* fa){ int i=1; *fa=1; for(i=1;i<=n;i++){ *fa=*fa*i; } }

Week-12: Program 02

Due Date of Submission 2022-04-21, 23:59 IST

Write a C program to print the Record of the Student Merit wise in descending order.
Here a structure variable is defined which contains student rollno, name and score

#include<stdio.h>
struct student
{
int rollno;
char name[20];
int score;
};
void main()
{
struct student s[20];
int i, n;
scanf("%d" ,&n);
for(i=0;i<n;i++)
{
scanf("%d", &s[i].rollno);
scanf("%s", s[i].name);
scanf("%d", &s[i].score);
}

--Solution-- 

  struct student t; int j; for(i=0;i<n;i++){ for(j=i+1;j<n;j++){ if(s[i].score<s[j].score){ t=s[i]; s[i]=s[j]; s[j]=t; } } }

Week-12: Program 03

Due Date of Submission 2022-04-21, 23:59 IST

Write a C program to store n elements using Dynamic Memory Allocation - calloc() and find the Largest element.

--Solution-- 

  element = (float*) calloc(n, sizeof(float)); if(element == NULL) { printf("Error!!! memory not allocated."); exit(0); } int i; 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\n", *element); return 0; }

Week-12 Problem 04

Due Date of Submission 2022-04-21, 23:59 IST

Write a C program to find the sum of two 1D integer arrays ‘A’ and ‘B’ of same size and store the result in another array ‘C’, where the size of the array and the elements of the array are taken as input.

For example: In the Test case the input is given as follows 5 10 20 30 40 50 1 2 3 4 5
So the output will be displayed as

Result is
11
22
33
44
55

 Write the program accordingly. Use dynamic memory allocation.

#include<stdio.h>

#include<stdlib.h>

void main()

{

 int i,n;

 scanf("%d", &n);

--Solution-- 

  int *a,*b,*c; a=(int*)malloc(n*sizeof(int)); for(i=0;i<n;i++){ scanf("%d",a+i); } b=(int*)malloc(n*sizeof(int)); c=(int*)malloc(n*sizeof(int)); for(i=0;i<n;i++){ scanf("%d",b+i); } for(i=0;i<n;i++){ *(c+i)=*(a+i)+*(b+i); }