First Semester

#include <conio.h>#include <stdio.h>void main(){ int i,j,tmp, first, last, middle, n, val, num[100]; clrscr(); printf(“Enter number of elementsn”); scanf(“%d”,&n); printf(“Enter %d integersn”, n); for ( i = 0 ; i < n ; i++ ) scanf(“%d”,&num[i]); for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(num[i]>num[j]) …

#include <stdio.h>#include <conio.h>#include <stdlib.h>void sort_asc(int [],int);void sort_dsc(int [],int);void search_lin(int [],int);void search_bin(int [],int);void insert(int [],int);void delet(int [],int);void merge(int [], int);void display(int [],int);void menu(int [], int);void main(){ int n, a[50],b[50],c[100],i; clrscr(); printf(“Enter no. of values:”); scanf(“%d”,&n); printf(“Enter %d values:”,n); for(i=0;i<n;i++) { scanf(“%d”,&a[i]); …

//program to test armstrong number#include <stdio.h>#include <conio.h>#include <math.h>void main(){ int n,dig,sum=0,temp; clrscr(); printf(“Enter a number:”); scanf(“%d”,&n); temp=n; while(temp!=0) { dig=temp%10; sum=sum+pow(dig,3); temp=temp/10; } if(sum==n) { printf(“nn%d is armstrong”,n); } else { printf(“nn%d is not armstrong”,n); } getch();}

addition of matrics #include <conio.h>#include <stdio.h>void main(){ int m, n, c, d, first[10][10], second[10][10], sum[10][10]; clrscr(); printf(“Enter the number of rows and columns of matrixn”); scanf(“%d%d”, &m, &n); printf(“Enter the elements of first matrixn”); for ( c = 0 ; …