Below are the few basic C programs which I had written when I was doing my B.C.A. The programs are very basic ones and will only be useful for those who are new to computers programming. I will try to improve this section with more programs and which are written in different language, and not just C.

Add A List Of Numbers Using Pointers

/* Add A List Of Numbers Using Pointers */ #include<stdio.h> #include<conio.h> int add(int *a[20],int n) { int s=0,j; for(j=0;j<n;j++) s=s+*a[j]; return(s); } void main() { int *arr[20],n,i,sum; clrscr(); printf("Enter the limit : "); scanf("%d",&n); printf("Enter the numbers :\n"); for(i=0;i<n;i++) scanf("%d",arr[i]); sum=add(&arr,n); printf("Sum = %d",sum); getch(); }

Sort Numbers Using Bubble-Sort Technique

/* Sort Numbers Using Bubble-Sort Technique */ #include<stdio.h> #include<conio.h> void main() { int i,j,n,x,a[10]; clrscr(); printf("Enter how many numbers you want to sort\n"); scanf("%d",&n); printf("Enter the numbers\n"); for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n-1;i++) for(j=i+1;j<n;j++) { if(a[i]>a[j]) { x=a[i]; a[i]=a[j]; a[j]=x; } } printf("The sorted numbers are\n"); for(i=0;i<n;i++) printf("%4d",a[i]); getch(); }

Find Biggest Among Given Three Numbers

/* Find Biggest Among Given Three Numbers */ #include<stdio.h> #include<conio.h> void main() { float a,b,c,big; clrscr(); printf("\nEnter three numbers:\n"); scanf("%f%f%f", &a,&b,&c); if(a>b) big=a; else big=b; if(c>big) big=c; printf("The biggest among %3.2f,%3.2f,%3.2f is %3.2f",a,b,c,big); getch(); }

Search An Element Using Binary Search

/* Search An Element Using Binary Search */ #include <stdio.h> #include <conio.h> void main() { int i,j,high,low,n,x[20],ele,mid; printf("Enter limit:\n"); scanf("%d",&n); printf("Enter elements:\n"); for(i=0;i<n;i++) scanf("%d",&x[i]); printf("Enter element to be searched:\n"); scanf("%d",&ele); low=0; high=n-1; mid=(low+high)/2; while (low<=high && ele!=x[mid]) { if(ele<x[mid]) high=mid-1; else low=mid+1; mid=(low+high)/2; } if(ele==x[mid]) { printf("Element found!\n"); getch(); } else { printf("Not found!\n"); getch(); } }

Convert Decimal Number To Binary And Vice Versa

/* Convert Decimal Number To Binary And Vice Versa */ #include<stdio.h> #include<conio.h> void main(){ int r,n,x,b,d,choice; clrscr(); printf ("Enter your choice 1 or 2\n"); printf ("1 For binary to decimal conversion\n"); printf ("2 For decimal to binary conversion\n"); scanf ("%d",&choice); switch(choice){ case 1:/*BINARY TO DECIMAL CONVERSION*/ n=0; x=1; printf ("\nEnter a binary number : "); scanf ("%d",&b); while(b>=1){ r=b%10; n=n+r*x; x=x*2; b=b/10; } printf ("The decimal number is : %d\n",n); break; case 2:/*DECIMAL TO BINARY CONVERSION*/ n=0; x=1; printf ("Enter the decimal number: "); scanf ("%d",&d); while(d>=1){ r=d%2; n=n+r*x; x=x*10; d=d/2; } printf ("The binary number is : %d\n",n); break; default:/*ERROR MESSAGE*/ printf ("The data entered is incorrect\n"); } getch(); }

Search For An Element Using Binary Search Method

/* Search For An Element Using Binary Search Method */ #include<stdio.h> #include<conio.h> void main(){ int array[10]; int i,j,n,temp,keynum; int low,mid,high; clrscr(); printf("Enter the limit: "); scanf("%d",&n); printf("Enter %d numbers :\n",n); for(i=0;i<n; i++) scanf("%d",&array[i]); printf("Input array elements :\n"); for(i=0; i<n ; i++){ printf(" %d ",array[i]); } /* Bubble sorting begins */ for(i=0;i<n;i++){ for(j=0;j<(n-i-1);j++){ if(array[j]> array[j+1]){ temp = array[j]; array[j]=array[j+1]; array[j+1] = temp; } } } printf("\nSorted array is...\n"); for(i=0;i<n;i++){ printf(" %d ",array[i]); } printf("\nEnter the element to be searched: "); scanf("%d", &keynum); /* Binary searching begins */ low=0; high=n-1; do{ mid= (low + high) / 2; if(keynum<array[mid]) high=mid-1; else if(keynum>array[mid]) low=mid+1; }while(keynum!=array[mid]&&low<=high); if(keynum==array[mid]){ printf("Search Successful. Number found at position %d \n",mid+1); } else printf("Search Failed. Number not found.\n"); getch(); }

Search For An Element Using Binary Search Method

/* Search For An Element Using Binary Search Method */ #include<stdio.h> #include<conio.h> void main(){ int array[10]; int i,j,n,temp,keynum; int low,mid,high; clrscr(); printf("Enter the limit: "); scanf("%d",&n); printf("Enter %d numbers :\n",n); for(i=0;i<n; i++) scanf("%d",&array[i]); /* Bubble sorting begins */ for(i=0;i<n;i++){ for(j=0;j<(n-i-1);j++){ if(array[j] > array[j+1]){ temp = array[j]; array[j]=array[j+1]; array[j+1] = temp; } } } printf("\nSorted array is...\n"); for(i=0;i<n;i++){ printf(" %d ",array[i]); } getch(); }

Find The Area Of A Circle Given Radius

/* Find The Area Of A Circle Given Radius */ #include<stdio.h> #include<conio.h> #define PI 3.142 void main() { float r,area; clrscr(); printf("Enter radius for a circle\n"); scanf("%f",&r); if(r<=0) printf("\nRadius of a circle should be greater than zero.\n"); else { area=PI*r*r; printf("\nArea of circle with radius %3.2f is: %3.2f",r,area); } getch(); }

Convert Fahrenheit Temperature To Degree Celcius And Vice Versa

/* Convert Fahrenheit Temperature To Degree Celcius And Vice Versa */ #include<stdio.h> #include<conio.h> void main(){ int unit; float f,c,deg; clrscr(); printf ("Enter the temperature : "); scanf ("%f",°); printf ("\nEnter the unit of temperature 1 for (C) or 2 for (F)\n"); scanf ("%d",&unit); switch (unit){ case 1:/*CELCIUS TO FAHRENHEIT*/ f=1.8*deg+32; printf ("The converted temperature is=%4.2fF\n",f); break; case 2:/*FAHRENHEIT TO DEGREE CELCIUS*/ c=(deg-32)/1.8; printf ("The converted temperature is=%4.2fC\n",c); break; default:/*ERROR MESSAGE*/ printf ("The data entered is incorrect."); } getch(); }

Evaluate A Postfix Expression

/* Evaluate A Postfix Expression */ #include<stdio.h> #include<stdlib.h> #include<math.h> #include<conio.h> #include<ctype.h> #define MAX 80 struct stack { int top; int items[MAX]; }; int eval(char expr[]); int oper(char symb,int op1,int op2); void push(struct stack *ps,int x); int pop(struct stack *ps); int temp; void main() { char expr[MAX]; int pos=0; clrscr(); printf("Enter a valid postfix expression\n"); while((expr[pos++]=getchar())!='\n') ; expr[--pos]='\0'; printf("\nThe result of postfix expression is: %d",eval(expr)); getch(); } int eval(char expr[]) { int pos; char c; int opnd1,opnd2,value,t; struct stack opndstk; opndstk.top=-1; printf("\nEnter value:\n"); for(pos=0;(c=expr[pos])!='\0';pos++) if(isalpha(c)) { scanf("%d",&t); push(&opndstk,t); } else { opnd2=pop(&opndstk); opnd1=pop(&opndstk); value=oper(c,opnd1,opnd2); push(&opndstk,value); } return(pop(&opndstk)); } int oper(char symb,int op1,int op2) { switch(symb) { case '+': return(op1+op2); case '-': return(op1-op2); case '*': return(op1*op2); case '/': return(op1/op2); case '$': return(pow(op1,op2)); default:printf("Illegal operation"); exit(1); } } void push(struct stack *ps,int x) { if(ps->top==MAX-1) { printf("Stack overflow!"); exit(1); } else ps->items[++(ps->top)]=x; } int pop(struct stack *ps) { if(ps->top==-1) { printf("Stack underflow\n"); exit(1); } temp=ps->items[ps->top]; ps->top--; return(temp); }

Find The Factorial Of A Number

/* Find The Factorial Of A Number */ #include<stdio.h> #include<conio.h> int factorial(int n) { int fact; if(n<=0) fact=1; else fact=n*factorial(n-1); return fact; } void main() { int n,fact; clrscr(); printf("Enter a number\n"); scanf("%d",&n); fact=factorial(n); printf("Factorial of %d is: %d\n",n,fact); getch(); }

Generate Fibonacci Series Upto N Using While Loop

/* Generate Fibonacci Series Upto N Using While Loop */ #include<stdio.h> #include<conio.h> void main(){ int n,a,b,fib; clrscr(); printf ("Enter the range of the series to generated : "); scanf ("%d",&n); a=0; b=1; fib=a+b; printf ("\nFibonacci series : \n"); printf ("%d\n",a); printf ("%d\n",b); while(fib<=n){ printf ("%d\n",fib); a=b; b=fib; fib=a+b; } getch(); }

Write And Read From A File

/* Write And Read From A File */ #include<stdio.h> #include<conio.h> void main() { FILE *fp; char ch,name; int regno,m1,m2,m3,choice; clrscr(); printf("1.Read from a file\n"); printf("2.Write to a file\n"); scanf("%c",choice); if(choice==1) { fp=fopen("Studrec.txt","r"); printf("The contents of %s is:\n\n"); while((ch=getc(fp))!=EOF) printf("%c",ch); } else { fp=fopen("Studrec.txt","w"); printf("Student Record File\n"); printf("Enter name: "); scanf("%s",name); printf("Enter reg no: "); scanf("%d",®no); printf("Enter marks of Sub1,Sub2,Sub3\n"); scanf("%d %d %d",&m1,&m2,&m3); fprintf(fp,"%s %d %d %d %d\n",name,regno,m1,m2,m3); printf("The data has been entered into the 'Studrec.txt' file"); } fclose(fp); getch(); }

Find The GCD And LCM Of Two Numbers

/* Find The GCD And LCM Of Two Numbers */ #include<stdio.h> #include<conio.h> int gcdof(int a,int b) { int temp; temp=a%b; if(temp==0) return b; else return gcdof(b,temp); } void main() { int a,b,gcd,lcm; clrscr(); printf("Enter any two numbers.\n"); scanf("%d%d",&a,&b); gcd=gcdof(a,b); lcm=(a*b)/gcd; printf("The GCD of %d,%d is: %d\n",a,b,gcd); printf("The LCM of %d,%d is: %d\n",a,b,lcm); getch(); }

Find The GCD Of Three Numbers

/* Find The GCD Of Three Numbers */ #include<stdio.h> #include<conio.h> int gcdof(int a,int b) { int temp; temp=a%b; if(temp==0) return b; else return gcdof(b,temp); } void main() { int a,b,c,gcd; clrscr(); printf("Enter any three numbers.\n"); scanf("%d%d%d",&a,&b,&c); gcd=gcdof(a,b); gcd=gcdof(gcd,c); printf("The GCD of %d,%d,%d is: %d",a,b,c,gcd); getch(); }

Sort A List Of N Integers Using Heap Sort Algorithm

/* Sort A List Of N Integers Using Heap Sort Algorithm */ #include<stdio.h> #include<conio.h> void heapify(int a[],int n) { int i,j,k,item; for(k=2;k<=n;k++) { item=a[k]; i=k; j=i/2; while(j!=0 && item>a[j]) { a[i]=a[j]; i=j; j=i/2; } a[i]=item; } } void adjust(int a[],int n) { int i,j,item; j=1; item=a[j]; i=2*j; while(i<n) { if(i+1<n) if(a[i]<a[i+1]) i++; if(item<a[i]) { a[j]=a[i]; j=i; i=2*j; } else break; } a[j]=item; } void heapsort(int a[],int n) { int i,temp; heapify(a,n); for(i=n;i>=1;i--) { temp=a[1]; a[1]=a[i]; a[i]=temp; adjust(a,i); } } void main() { int a[10],n,temp,i; clrscr(); printf("Enter the limit\n"); scanf("%d",&n); printf("Enter the elements\n"); for(i=1;i<=n;i++) scanf("%d",&a[i]); heapsort(a,n); printf("The sorted array is\n"); for(i=1;i<=n;i++) printf("%3d", a[i]); getch(); }

Convert Infix String To Postfix

/* Convert Infix String To Postfix */ #include<stdio.h> #include<conio.h> #include<process.h> int counter=0,pos=0,top=-1; char inf[20]; char post[20],stack[10]; char temp,symbol; infixtopostfix(char inf[],char post[]); void push(char symbol); char pop(); int preced(char symbol); void main() { int i,count=0; clrscr(); printf("Enter the infix string\n"); scanf("%s",inf); for(i=0;inf[i]!='\0';i++) { if(inf[i]=='(') count++; else if(inf[i]==')') count--; } if(count!=0) { printf("The string entered is not valid\n"); getch(); exit(0); } infixtopostfix(inf,post); printf("The postfix string is %s\n",post); getch(); } infixtopostfix(char inf[],char post[]) { int len; len=strlen(inf); push('#'); while(counter<len) { symbol=inf[counter]; switch(symbol) { case '(': push(symbol); break; case ')': temp=pop(); while(temp!='(') { post[pos]=temp; pos++; temp=pop(); } break; case '$': case '+': case '-': case '*': case '/': case '^': while(preced(stack[top])>preced(symbol)) { temp=pop(); post[pos]=temp; post++; } push(symbol); break; default: post[pos++]=symbol; break; } counter++; } while(top>0) { temp=pop(); post[pos++]=temp; } return; } void push(char symbol) { top=top+1; stack[top]=symbol; } char pop() { char symb; symb=stack[top]; top=top-1; return(symb); } int preced(char symbol) { int prec; switch(symbol) { case '$': prec=4; break; case '^': prec=3; break; case '*': case '/': prec=2; break; case '+': case '-': prec=1; break; case ')': case '(': prec=0; break; case '#':prec=-1; break; } return(prec); }

Search An Element Using Linear Search

/* Search An Element Using Linear Search */ #include <stdio.h> #include <conio.h> void main() { int i,j,n,x[10],ele,flag=0; printf("Enter limit:\n"); scanf("%d",&n); printf("Enter element:\n"); for(i=0;i<n;i++) scanf("%d",&x[i]); printf("Element to be searched:\n"); scanf("%d",&ele); for(i=0;i<n;i++) { if(ele==x[i]) flag=1; } if(flag) { printf("Element found!\n"); getch(); } else { printf("Element not found!\n"); getch(); } }

Add Two Matrices

/* Add Two Matrices */ #include<stdio.h> #include<conio.h> void main() { int a[5][5],b[5][5],c[5][5],i,j,k,m,n,p,q; clrscr(); printf("Enter the order of matrix A (m*n)\n"); printf("m:"); scanf("%d",&m); printf("n:"); scanf("%d",&n); printf("Enter the elements of matrix\n"); for(i=0;i<m;i++) for(j=0;j<n;j++) scanf("%d",&a[i][j]); printf("Enter the elements of matrix B\n"); for(i=0;i<m;i++) for(j=0;j<m;j++) scanf("%d",&b[i][j]); c[i][j]=0; for(i=0;i<m;i++) for(j=0;j<n;j++) c[i][j]=a[i][j]+b[i][j]; printf("The sum matrix C of matrices A and B is:\n"); for(i=0;i<m;i++) { for(j=0;j<n;j++) printf("%3d",c[i][j]); printf("\n"); } getch(); }

Multiply Two Matrices

/* Multiply Two Matrices */ #include<stdio.h> #include<conio.h> void main() { int a[5][5],b[5][5],c[5][5],i,j,k,m,n,p,q; clrscr(); printf("Enter the order of matrix A (m*n)\n"); printf("m:"); scanf("%d",&m); printf("n:"); scanf("%d",&n); printf("Enter the elements of matrix\n"); for(i=0;i<m;i++) for(j=0;j<n;j++) scanf("%d",&a[i][j]); printf("Enter the order of matrix B (p*q)\n"); printf("p:"); scanf("%d",&p); printf("q:"); scanf("%d",&q); printf("Enter the elements of matrix\n"); for(i=0;i<p;i++) for(j=0;j<q;j++) scanf("%d",&b[i][j]); if(n!=p) printf("Multiplication not possible!...Check order of matrices\n"); else { for(i=0;i<m;i++) for(j=0;j<q;j++) { c[i][j]=0; for(k=0;k<n;k++) c[i][j]=c[i][j]+a[i][k]*b[k][j]; } } printf("The product matrix of matrices A and B is:\n"); for(i=0;i<m;i++) { for(j=0;j<q;j++) printf("%3d",c[i][j]); printf("\n"); } getch(); }

Find The Norm Of A Matrix

/* Find The Norm Of A Matrix */ #include<stdio.h> #include<conio.h> #include<math.h> void main (){ int i,j,m,n,sum=0,a[10][10]; clrscr(); printf ("Enter the order of the matrix\n"); scanf ("%d %d", &m,&n); printf ("Enter the elements of the matrix \n"); for (i=0;i<m;++i) for (j=0;j<n;++j) { scanf("%d",&a[i][j]); sum = sum+(a[i][j]*a[i][j]); } printf ("The norm of the given matrix is:%3.2f\n",sqrt(sum)); getch(); }

Find The Trace Of A Matrix

/* Find The Trace Of A Matrix */ #include<stdio.h> #include<conio.h> void main () { int i,j,m,n,sum=0,a[10][10]; clrscr(); printf ("Enter the order of the matrix:\n"); scanf ("%d %d", &m,&n); printf ("Enter the elements of the matrix:\n"); for (i=0;i<m;++i) for (j=0;j<n;++j) scanf ("%d",&a[i][j]); for (i=0;i<m;++i) sum = sum + a[i][i]; printf ("Trace of the matrix is %d\n",sum); getch(); }

Generate N Prime Numbers

/* Generate N Prime Numbers */ #include<stdio.h> #include<conio.h> void main() { int n,j,i,f; clrscr(); printf ("How many prime numbers you wnat to generate: "); scanf ("%d",&n); printf ("The %d prime numbers are :",n); i=1; while(n>=1) { f=1; for(j=2;j<=i-1;j++) { if(i%j==0) { f=0; break; } } if(f==1) { printf("\n%d",i); n--; } i++; } getch(); }

Reverse The Given Integer

/* Reverse The Given Integer */ #include<stdio.h> #include<conio.h> void main(){ int num,rev=0,found=0,temp,digit; clrscr(); printf("Enter the number: "); scanf("%d", &num); temp=num; while(num>0) { digit=num%10; rev=rev*10+digit; num/=10; } printf("Reverse of %d is %d", temp,rev); getch(); }

Generate Prime Numbers Upto Limit N

/* Generate Prime Numbers Upto Limit N */ #include<stdio.h> #include<conio.h> void main() { int n,i=1,j=2,f; clrscr(); printf("Enter the limit\n"); scanf("%d",&n); if(i<=0) printf("Check input!\n"); else { printf("The prime numbers are:\n"); while(i<n) { for(j=2;j<=i-1;j++) { if(i%j==0) { f=0; break; } else f=1; } if(f) printf("%d\n",i); i++; } } getch(); }

Find The Roots Of A Quadratic Equation

/* Find The Roots Of A Quadratic Equation */ #include<stdio.h> #include<conio.h> #include<math.h> void main() { float a,b,c,d,r1,r2,i1,i2; clrscr(); printf("Enter the a,b,c:\n"); scanf("%f%f%f",&a,&b,&c); if(a==0&&b==0&&c==0) printf("No roots\n"); else { if(a==0) { printf("\nEquation is linear - Single root.\n"); r2=-c/b; r2=0; i1=i2=0; } else { d=(b*b)-(4*a*c); if(d<0) { printf("\nComplex conjugate roots.\n"); d=-d; r1=-b/(2*a); r2=r1; i1=i2=0; } else if(d==0) { printf("\nEqual roots.\n"); r1=-b/(2*a); r2=r1; i1=i2=0; } else { printf("Real roots.\n"); r1=(-b+sqrt(d))/(2*a); r2=(-b-sqrt(d))/(2*a); i1=i2=0; } } printf("\nThe roots are\n"); printf("R1=%3.2f\n",r1); printf("R2=%3.2f\n",r2); printf("I1=%3.2f\n",i1); printf("I2=%3.2f\n",i2); } getch(); }

Find The Factorial Of A Number Using Recursive Function

/* Find The Factorial Of A Number Using Recursive Function */ #include<stdio.h> #include<conio.h> long fact (int n){ if (n<=0) return (1); else return (n*fact(n-1)); } void main(){ int m; long f; clrscr(); printf ("\nEnter a number : "); scanf ("%d",&m); f=fact(m); printf ("%d!=%u",m,f); getch(); }

Generate Fibonacci Series Using Recursive Function

/* Generate Fibonacci Series Using Recursive Function */ #include<stdio.h> #include<conio.h> int fib (int f,int s,int n){ if(f==0) printf ("%d\n",f); else if(s==1) printf ("%d\n",s); if(f+s<=n){ printf ("%d\n",(f+s)); fib(s,f+s,n); } } void main(){ int n; clrscr(); printf ("Enter the limit of the series : "); scanf ("%d",&n); printf ("\nFibonacci series :\n"); fib (0,1,n); getch(); }

Compute Row-Sum And Column-Sum Of A Matrix

/* Compute Row-Sum And Column-Sum Of A Matrix */ #include <stdio.h> void main() { int arr[10][10],i,j,row,col,rowsum,colsum,sumall=0; clrscr(); printf("Enter the order of the matrix\n"); scanf("%d %d", &row,&col); printf("Enter the elements of the matrix\n"); for(i=0;i<row;i++) { for(j=0;j<col;j++) { scanf("%d",&arr[i][j]); } } printf("\n"); for(i=0;i<row;i++) { rowsum=addrow(arr,i,col); printf("Sum of row %d = %d\n", i+1,rowsum); } for(j=0;j<col;j++) { colsum=addcol(arr,j,row); printf("Sum of column %d = %d\n", j+1,colsum); } for(j=0;j<row;j++) { sumall=sumall+addrow(arr,j,col); } printf("Sum of all elements of matrix = %d\n",sumall); } int addrow(int a[10][10],int k,int c) { int rsum=0,i; for(i=0;i<c;i++) { rsum=rsum+a[k][i]; } return(rsum); } int addcol(int a[10][10],int k,int r) { int csum=0,j; for(j=0;j<r;j++) { csum=csum+a[j][k]; } return(csum); }

Sort List Of Numbers Using Selection Sort Method

/* Sort List Of Numbers Using Selection Sort Method */ #include<stdio.h> #include<conio.h> void main() { int array[10]; int i,j,n,temp; int findmax(); void exchang(); clrscr(); printf("Enter the how many numbers do you wnat to enter\n"); scanf("%d",&n); printf("Enter the elements\n"); for(i=0;i<n;i++) scanf("%d",&array[i]); exchang(array,n); printf("Sorted array is\n"); for(i=0;i<n;i++) printf("%3d",array[i]); getch(); } int findmax(b,k) int b[10],k; { int max=0,j; for(j=1;j<=k;j++) { if(b[j]>b[max]) { max=j; } } return(max); } void exchang(b,k) int b[10],k; { int temp,big,j; for(j=k-1;j>=1;j--) { big = findmax(b,j); temp = b[big]; b[big] = b[j]; b[j] = temp; } return; }

Sort A Array By Quick Sort

/* Sort A Array By Quick Sort */ #include <stdio.h> #include <conio.h> void quicksort(int a[],int lb,int ub) { int i,j,temp,key,flag=1; if(lb<ub) { i=lb; j=ub+1; key=a[lb]; while(flag) { i++; while(a[i]<key && i><ub) i++; j--; while(a[j]>key) j--; if(i<j) { temp=a[i]; a[i]=a[j]; a[j]=temp; } else flag=0; } a[lb]=a[j]; a[j]=key; quicksort(a,lb,j-1); quicksort(a,j+1,ub); } } void main() { int a[20],i,n; clrscr(); printf("Enter the limit:\n"); scanf("%d",&n); printf("Enter the elements:\n"); for(i=0;i<n;i++) scanf("%d",&a[i]); quicksort(a,0,n-1); printf("The sorted elements are:\n"); for(i=0;i<n;i++) printf("%3d",a[i]); getch(); }

Implement Stack Operations

/* Implement Stack Operations */ #include<stdio.h> #include<stdlib.h> #include<conio.h> #define MAX 5 int st[10]; int top=-1,ele; void push() { if(top==MAX-1) { printf("\nStack is full!\n"); getch(); } else { printf("\nEnter the element to be pushed in the stack:\n"); scanf("%d",&ele); top++; st[top]=ele; } } void pop () { if(top==-1) printf("\nStack is empty\n"); else { ele=st[top]; printf("\nPoped element is: %d\n",st[top]); top--; } } void disp() { int i; if(top==-1) printf("\nStack is empty\n"); else { for(i=top;i>=0;i--) printf("%3d",st[i]); } } void main() { int i,ch,n; while(ch!=4) { clrscr(); printf("STACK operation\n"); printf("~~~~~~~~~~~~~~~~~~~~~~\n"); printf("1: PUSH operation\n"); printf("2: POP operation\n"); printf("3: DISPLAY operation\n"); printf("4: EXIT\n"); printf("~~~~~~~~~~~~~~~~~~~~~~\n"); printf("Enter your choice:"); scanf("%d",&ch); switch(ch) { case 1: { push(); } break; case 2: { pop(); getch(); } break; case 3: { printf("The stack elements are:\n"); disp(); getch(); } break; case 4: { exit(0); } break; } } }

Find Standard Deviation

/* Find Standard Deviation */ #include<stdio.h> #include<conio.h> #include<math.h> void main() { float val[10],stddev(); int i,n; clrscr(); printf("Enter how many numbers do you want to enter\n"); scanf("%d",&n); printf("Enter elements\n"); for(i=0;i<n;i++) scanf("%f",&val[i]); printf("Standard deviation is %3.2f\n",stddev(val,n)); getch(); } float stddev(a,n) float a[]; int n; { int i; float mean(),x,sum=0.0; x=mean(a,n); for(i=0;i<n;i++) sum=sum+(x-a[i])*(x-a[i]); return(sqrt(sum/(float)n)); } float mean(a,n) float a[]; int n; { int i; float sum=0.0; for(i=0;i<n;i++) sum=sum+a[i]; return(sum/(float)n); }

Concatinate Two Strings

/* Concatinate Two Strings */ #include <stdio.h> #include <string.h> #include <conio.h> void main(){ char str1[20],str2[20],str3[40]; int j,i,len1,len2; clrscr(); printf("Enter first string : "); scanf("%s",str1); printf("Enter second string : "); scanf("%s",str2); len1=strlen(str1); len2=strlen(str2); i=0; while(i<=len1){ str3[i]=str1[i]; i++; } j=len1; i=0; while(i<=len2){ str3[j]=str2[i]; i++; j++; } printf("\nConcatenated string : %s",str3); getch(); }

Compare Two Strings Without Using String Functions

/* Compare Two Strings Without Using String Functions */ #include<stdio.h> #include<conio.h> void main(){ char str1[20],str2[20]; int i,j,len1,len2,f=0; clrscr(); printf("Enter first string : "); scanf("%s",str1); printf("Enter second string : "); scanf("%s",str2); len1=strlen(str1); len2=strlen(str2); if(len1!=len2) f=0; if(len1==len2){ i=0; while(i<len1){ if(str1[i]==str2[i]){ f=1; } else{ f=0; break; } i++; } } if(f==1) printf("The strings are same."); else printf("The strings are not the same."); getch(); }

Check Whether A String Is Palindrome Or Not

/* Check Whether A String Is Palindrome Or Not */ #include<stdio.h> #include<conio.h> void main() { int i,j,l,f; char a[30]; clrscr(); printf("Enter a string\n"); scanf("%c",&a); l=strlen(a); i=l-1; j=0; while(j<=l-1) { if(a[i]!=a[j]) { f=0; break; } else { --i; f=1; j++; } } if(f) printf("The given string is a palindrome!\n"); else printf("The given string is not a palindrome!\n"); getch(); }

Demonstrate Structures

/* Demonstrate Structures */ #include<stdio.h> #include<conio.h> struct stud { int rno, yearjn; char name[20],dept[20],course[20]; }; void findyear(int yr,struct stud s[10],int n) { int i=0,f=0; printf("Names of the students who joined in %d :",yr); while(i<n) { if(s[i].yearjn==yr) { printf("\n%s ",s[i].name); f=1; } i++; } if(f==0) printf("\nNo student found for this year."); } void findroll(int roll, struct stud s[10], int n) { int i=0,f=0; printf("The data of the student with roll no : %d\n",roll); while(i<n) { if(s[i].rno==roll) { printf("Name : %s",s[i].name); printf(" Roll No : %d",s[i].rno); printf("\nDepartment : %s",s[i].dept); printf(" Year joined : %d",s[i].yearjn); printf(" Course : %s",s[i].course); f=1; break; } i++; } if(f==0) printf("No student found with this roll no."); } void main() { int n,yr,roll,i=0; struct stud s[10]; clrscr(); printf("Enter tbg he number of students : "); scanf("%d",&n); while(i<n) { printf("Enter data of student %d\n",i+1); printf("Student name :"); scanf("%s",s[i].name); printf("Roll No : "); scanf("%d",&s[i].rno); printf("Year of Joined : "); scanf("%d",&s[i].yearjn); printf("Department : "); scanf("%s",s[i].dept); printf("Course taken : "); scanf("%s",s[i].course); i++; } printf("Enter the year : "); scanf("%d",&yr); findyear(yr,s,n); printf("\nEnter a student's roll no : "); scanf("%d",&roll); findroll(roll,s,n); getch(); }

Convert A String Uppercase To Lowercase

/* Convert A String Uppercase To Lowercase */ #include <stdio.h> #include <string.h> #include <conio.h> main() { char str[20],str2[20]; int count,ch,i; clrscr(); printf("Enter a string : "); scanf("%s",str); printf("\nString in lower case : "); count=strlen(str); for(i=0;i<count+1;i++) { if(str[i]>=65 && str[i]<=90) str2[i]=str[i]+32; else str2[i]=str[i]; } printf("%s",str2); getch(); }

Find The Transpose Of A Matrix

/* Find The Transpose Of A Matrix */ #include<stdio.h> #include<conio.h> void main() { int a[5][5],b[5][5],i,j,k,m,n,p,q; clrscr(); printf("Enter the order of matrix A (m*n)\n"); printf("m:"); scanf("%d",&m); printf("n:"); scanf("%d",&n); printf("Enter the elements of matrix\n"); for(i=0;i<m;i++) for(j=0;j<n;j++) scanf("%d",&a[i][j]); for(i=0;i<m;i++) for(j=0;j<n;j++) { b[i][j]=a[j][i]; } printf("The transpose of matrix A is:\n"); for(i=0;i<m;i++) { for(j=0;j<n;j++) { printf("%3d",b[i][j]); } printf("\n"); } getch(); }

Number Of Vowels In A String

/* Number Of Vowels In A String */ #include<stdio.h> #include<conio.h> #include<string.h> void main() { int l,i,j,f; char a[30]; clrscr(); printf ("\nEnter a string: "); scanf ("%s",a); l=strlen(a); i=0;j=0; while(j<=l-1) { if(toupper(a[j])=='A'||toupper(a[j])=='E'||toupper(a[j])=='I' ||toupper(a[j])=='O'||toupper(a[j])=='U') ++i; ++j; } printf ("Number of vowels in '%s' is: %d",a,i); getch(); }