Problem Solving Through Programming in C Week 6: Programming Assignments Jul-Dec 2022

    NPTEL PROGRAMMING ASSIGNMENTS

Problem Solving Through Programming in C

Week-06 Program-01

Last Day of Submission: 8-Sep-2022

Write a C Program to find Largest Element of an Integer Array.

--Solution-- 

  /*#include <stdio.h> int main() { int i, n, largest; int arr[100]; scanf("%d", &n); for(i = 0; i< n; ++i) { scanf("%d", &arr[i]); }*/ largest=arr[0]; for(i=1;i<n;i++){ if(largest<arr[i]){ largest=arr[i];} } printf("Largest element = %d", largest); return 0; }

Week-06 Program-02

Last Day of Submission: 8-Sep-2022

Write a C Program to print the array elements in reverse order.

first element will be the last and last become first, second will become second last and so on.

--Solution-- 

  /*#include<stdio.h> int main() { int arr[20], i, n; scanf("%d", &n); for (i = 0; i< n; i++) scanf("%d", &arr[i]);*/ int temp; for(i=0;i<n/2;i++){ temp=arr[i]; arr[i]=arr[n-i-1]; arr[n-i-1]=temp; } /*for (i = 0; i< n; i++) { printf("%d\n", arr[i]); } return (0); }*/

Week-06 Program-03

Last Day of Submission: 8-Sep-2022

Write a C program to read Two One Dimensional Arrays of same data type (integer type) and merge them into another One Dimensional Array of same type.

--Solution-- 

  /*#include<stdio.h> int main() { int arr1[20], arr2[20], array_new[40], n1, n2, size, i; scanf("%d", &n1); for (i = 0; i< n1; i++) scanf("%d", &arr1[i]); scanf("%d", &n2); for (i = 0; i< n2; i++) scanf("%d", &arr2[i]);*/ size=n1+n2; for(i=0;i<size;i++){ if(i<n1){array_new[i]=arr1[i];} else{array_new[i]=arr2[i-n1];} } /*for (i = 0; i< size; i++) { printf("%d\n", array_new[i]); } }*/

Week-06 Program-04

Last Day of Submission: 8-Sep-2022

Write a C Program to delete duplicate elements from an array of integers.

--Solution-- 

  /*#include<stdio.h> int main() { int array[50], i, size; scanf("%d", &size); for (i = 0; i< size; i++) scanf("%d", &array[i]);*/ for(i=0;i<size-1;i++){ for(int j=i+1;j<size;j++){ if(array[i]==array[j]){ for(int k=j;k<size-1;k++){ array[k]=array[k+1]; } size--; j--; } } } /*for (i = 0; i< size; i++) { printf("%d\n", array[i]); } }*/