Calculate Electricity Bill With If

8/3/2019 Calculate Electricity Bill With If

1/118

October 29, 2011 [C LANGUAGE PROGRAMS BY MR.K-MANIKANTA] For More @ www.stylewap.in

Manikanta Page 1M.C.A

Calculate Electricity Bill with if-else conditionCalculate Electricity Bill with if-else condition 100 and 300 and 500 Rs.5/units

#include#includevoid main (){int unit, total;clrscr ();printf("Enter Total Units:");scanf ("%d",&unit);if(unit100&& unit300&& unit


2/118



}

Add two matrices and store the result#include#includevoid main(){int a[3][3],b[3][3],c[3][3],i,j;clrscr();printf("Enter the elements into matrix A\n");for(i=0;i


3/118



printf("%4d\t%4d\n", test[i++], head->number);head = head->next;}

/* free the list */for(current = head; current != NULL; current = next)next = current->next, free(current);

return 0;}

void insert_node(int value){struct node *temp = NULL;struct node *one = NULL;struct node *two = NULL;

if(head == NULL) {head = (struct node *)malloc(sizeof(struct node *));head->next = NULL;

}

one = head;two = head->next;

temp = (struct node *)malloc(sizeof(struct node *));temp->number = value;

while(two != NULL && temp->number number) {one = one->next;two = two->next;}

one->next = temp;temp->next = two;}A bubblesort routine# include# includevoid bubblesort(int array[],int size);void main(){int values[10],j;for(j=0;j


4/118



int tmp ,i,j;for(i = 0;ifor(j=0;j < size;j++)if(array[i] < array[j]){tmp = array[i];array[i] = array[j];array[j] = tmp;}}A simple example showing some comparison operators#includeint main(){int number1 , number2;printf("Enter the number1 number to compare.\n");scanf("%d",&number1);printf("Enter the number2 number to compare.\n");scanf("%d",&number2);printf("number1 > number2 has the value %d\n", number1 > number2);

printf("number1 < number2 has the value %d\n", number1 < number2);printf("number1 == number2 has the value %d\n", number1 == number2);return 0;}

Add numbers using command line arguments (CLA)#include#include#include

void main(int argc,char *argv[]){int sum=0,i;//Compare if proper number of arguments have been enteredif(argc


5/118



int *j;int i,n;clrscr();printf("Enter how many elements u want to add:");scanf("%d",&n);printf("Enter the elements:");for(i=0;i


6/118



printf(%d\t,z[i][j]);

}

printf(\n\n);

}

}

int main()

{

int A[10][10]={0},B[10][10]={0};

printf(Enter the column and row of first matrix(m x n)\n);

scanf(%d%d,&m1,&n1);

printf(Enter the column and row of second matrix(m x n)\n);


printf(\n\n);

if (n1==m1||n2==m2)

{

value_sub(m1,n1,A);

printf(\n\n);

value_sub(m2,n2,B);

printf(\n\n);

mat_mul(m1,n2,A,B);

}

else

printf(Addition of Matrix cannot be done);

getch();

}AREA OF CIRCLE#includevoid main (){float r,c;clrscr();printf ("Enter Radius: ");
http://free-c-programs.blogspot.com/2007/08/area-of-circle.htmlhttp://free-c-programs.blogspot.com/2007/08/area-of-circle.html


7/118



scanf ("%f",&r);c=3.14*r*r;printf ("\nArea is : %.2f",c);getch ();}

Output

ARRANGE THE ELEMENTS IN ARRAY IN DESSENDING ORDERmain(){int a[100],i,n,j,search,temp;printf("\n how many no's in array");

scanf("%d",&n);printf("\n enter %d elements in array",n);for(i=0;iscanf("%d",&a[i]);for(i=0;i{for(j=i+1;j{if(a[i]{temp=a[i];a[i]=a[j];a[j]=temp;

}}printf("%4d",a[i]);}getch();}ATM programingATM C programing language Program code

/*Note Pin code is 1234*/#include#include

void main(void)

{ unsigned long amount=1000,deposit,withdraw;int choice,pin=0,k=0;char another='y';

while(pin!=1234){ clrscr();gotoxy(30,25);printf("Enter pin:");scanf("%d",&pin);}
http://free-c-programs.blogspot.com/2008/12/arrange-elements-in-array-in-dessending.htmlhttp://free-c-programs.blogspot.com/2011/08/atm-programing.htmlhttp://bp0.blogger.com/_urRtV3T_f1g/RtPcIGrnSUI/AAAAAAAAABQ/6crpx1md1Sk/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2011/08/atm-programing.htmlhttp://free-c-programs.blogspot.com/2008/12/arrange-elements-in-array-in-dessending.html


8/118



clrscr();do{

printf("********Welcome to ATM Service**************\n");printf("1. Check Balance\n");printf("2. Withdraw Cash\n");printf("3. Deposit Cash\n");printf("4. Quit\n");printf("*********************************************\n\n");printf("Enter your choice: ");scanf("%d",&choice);switch(choice){case 1:printf("\nYour Balance is Rs : %lu ",amount);break;case 2:printf("\nEnter the amount to withdraw: ");scanf("%lu",&withdraw);

if(withdraw%100!=0){printf("\nPlease enter

amount in multiples of 100");}else if(withdraw>(amount-500)){

printf("\nInsufficient Funds");}else{

amount=amount-withdraw;

printf("\n\nPlease collect cash");

printf("\nYour balance is %lu",amount);}break;case 3:printf("\nEnter amount to deposit");scanf("%lu",&deposit);amount=amount+deposit;printf("Your balance is %lu",amount);break;case 4:printf("\nThank you for using ATM");

break;default:printf("\nInvalid Choice");}printf("\n\n\nDo you want another transaction?(y/n): ");fflush(stdin);scanf("%c",&another);if(another=='n'||another=='N')k=1;}while(!k);


9/118


10/118



}printf("No. OF AVG STUDENTS ARE:%d\n",ae);printf("No. OF ABOVE AVERAGE STUDENTS:%d\n",aa);printf("No. OF BELOW AVERAGE STUDENTS ARE:%d",ba);getch();}

Binary search#define TRUE 0#define FALSE 1

int main(void){int array[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};int left = 0;int right = 10;int middle = 0;int number = 0;int bsearch = FALSE;int i = 0;

printf("ARRAY: ");for(i = 1; i


11/118



void llist_bubble_sort(void);/* print the entire linked list */void llist_print(void);

int main(void) {/* linked list */struct lnode *newnode = NULL;int i = 0; /* a general counter */

/* load some random values into the linked list */for(i = 0; i < MAX; i++){llist_add(&newnode, (rand() % 100));}

head = newnode;printf("Before bubble sort:\n");llist_print();printf("After bubble sort:\n");llist_bubble_sort();

llist_print();

return 0;}

/* adds a node at the end of a linked list */void llist_add(struct lnode **q, int num){struct lnode *tmp;

tmp = *q;

/* if the list is empty, create first node */if(*q == NULL) {*q = malloc(sizeof(struct lnode));tmp = *q;} else {/* go to last node */while(tmp->next != NULL)tmp = tmp->next;

/* add node at the end */tmp->next = malloc(sizeof(struct lnode));tmp = tmp->next;}

/* assign data to the last node */

tmp->data = num;tmp->next = NULL;}

/* print the entire linked list */void llist_print(void){visit = head;

while(visit != NULL)


12/118



{printf("%d ", visit->data);visit = visit->next;}printf("\n");}

/* preform a bubble sort on the linked list */void llist_bubble_sort(void) {struct lnode *a = NULL;struct lnode *b = NULL;struct lnode *c = NULL;struct lnode *e = NULL;struct lnode *tmp = NULL;

/*// the `c' node precedes the `a' and `e' node// pointing up the node to which the comparisons// are being made.*/

while(e != head->next){c = a = head;b = a->next;while(a != e){if(a->data > b->data){if(a == head){tmp = b -> next;b->next = a;a->next = tmp;head = b;c = b;} else {tmp = b->next;b->next = a;a->next = tmp;c->next = b;c = b;}} else{c = a;a = a->next;}

b = a->next;if(b == e)e = a;}}}bubble sort#include
http://free-c-programs.blogspot.com/2008/12/bubble-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/bubble-sort.html


13/118


14/118



int n = 0;int i = 0;

for(i = 0; scanf("%s", word) == 1; ++i){if(i >= N)printf("Limit reached: %d\n", N), exit(1);

x[i] = calloc(strlen(word)+1, sizeof(char));strcpy(x[i], word);}

n = i;sort_words(x, n);for(i = 0; i < n; ++i)printf("%s\n", x[i]);

return(0);}

void sort_words(char *x[], int y){int i = 0;int j = 0;

for(i = 0; i < y; ++i)for(j = i + 1; j < y; ++j)if(strcmp(x[i], x[j]) > 0)swap(&x[i], &x[j]);}

void swap(char **p, char **q){char *tmp;

tmp = *p;*p = *q;*q = tmp;}C Program find Positive Negative with Switch Case Without ConditionalOperator#include#includevoid main(void){char num;clrscr();

printf("Enter a number +ve or -ve : ");scanf("%c",&num);switch(num){case '-':printf("Negative number");break;default:printf("Positive number");}
http://free-c-programs.blogspot.com/2011/08/c-program-find-positive-negative-with.htmlhttp://free-c-programs.blogspot.com/2011/08/c-program-find-positive-negative-with.htmlhttp://free-c-programs.blogspot.com/2011/08/c-program-find-positive-negative-with.htmlhttp://free-c-programs.blogspot.com/2011/08/c-program-find-positive-negative-with.html


15/118



getch();}

C Program to calcuate interest and total amount at the end of each yearWrite ac programcalculate interest and total amount at da end of each year

Note: Output is not in the form of table and rate is taken as 2%. Itcalculates amount of each year

#include #include void main(){int t=1;int r=2;int y;

int y1=0;long int p,a;float i1;double total;;clrscr();printf("enter starting amount&year");scanf("%ld""%d",&p,&y);while(y1

calculate the power in watts#includeint main(){float power,voltage,current;voltage = current = 0;

printf("Power calculator.\n");printf("This will calculate the power in watts , ");printf("when you input the voltage and current.");/*get the voltage*/printf("Enter the voltage in volts.\n");scanf("%f",&voltage);/*get the current*/printf("Enter the current in amps.\n");scanf("%f",t);

/*calculate the power*/power = voltage * current;printf("The power in watts is %.2f watts\n",power);

return 0;}Concatenate Two Strings

#include#include#include
http://free-c-programs.blogspot.com/2009/02/write-program-to-calculate-interest-and.htmlhttp://free-c-programs.blogspot.com/2008/12/calculate-power-in-watts.htmlhttp://free-c-programs.blogspot.com/2011/08/concatenate-two-strings.htmlhttp://free-c-programs.blogspot.com/2011/08/concatenate-two-strings.htmlhttp://free-c-programs.blogspot.com/2008/12/calculate-power-in-watts.htmlhttp://free-c-programs.blogspot.com/2009/02/write-program-to-calculate-interest-and.html


16/118



void main(){char c[100];char a[50];char b[50];clrscr();printf("Enter a string1:");gets(a);printf("Enter a string2:");gets(b);strcat( a,b);printf("%s",a);getch();}

Count no. of students above,below and average students#include

#includevoid main(){int a[10];

int aa=0,ba=0,ae=0,i;clrscr();printf("Enter the marks:\n");for(i=0;i55)aa++;else if(a[i]


17/118



{int i;

for(i = 0;i < elements;i++){printf("%d ",grades[i]);}printf("\n");}

int count_passes(int grades[], int elements,int value){int i ,passes = 0 ;for(i = 0;i < elements;i++){if(grades[i] >= value)passes++;}return(passes);}

count the array elements#include#includevoid main(){int a[10],i,c=0;clrscr();printf("enter array elements=");for(i=0;i


18/118



strarray = (char **)realloc(strarray, (strcount + 1) * sizeof(char *));strarray[strcount++] = strdup(line);}

printf("### Before ###\n");for(i = 0; i < strcount; i++)printf("%2d: %s", i, strarray[i]);

sortstrarr(strarray, strcount);

printf("### After ###\n");for(i = 0; i < strcount; i++)printf("%2d: %s", i, strarray[i]);

/* free mem... */for(i = 0; i < strcount; i++)free(strarray[i]);

free(strarray);

return 0;}

static int cmpr(const void *a, const void *b){return strcmp(*(char **)a, *(char **)b);}

void sortstrarr(void *array, unsigned n){qsort(array, n, sizeof(char *), cmpr);}Example of Using Strings in C# include# include# include

void main(){char *a;printf("Enter your name=");gets(a);printf("%s",a);getch();}Factorial Function In C#include "stdio.h"

#include "conio.h"long int factorial(int n);void main(){int n,i;float s,r;char c;clrscr();repeat : printf("You have this series:- 1/1! + 2/2! + 3/3! + 4/4!");printf("To which term you want its sum? ");
http://free-c-programs.blogspot.com/2011/08/example-of-using-strings-in-c.htmlhttp://free-c-programs.blogspot.com/2008/12/factorial-function-in-c.htmlhttp://free-c-programs.blogspot.com/2008/12/factorial-function-in-c.htmlhttp://free-c-programs.blogspot.com/2011/08/example-of-using-strings-in-c.html


19/118



scanf("%d",&n);s=0;for (i=1;i


20/118



getch();}find a given number is positive or negative number in C without if statement,relational and conditional operator# include # include # include void main(){clrscr();int p,n;printf("Enter two no=");scanf("%d",&p);switch(n=abs(p) +(-p)){case 0:{printf("Positiv e number");break;}

default:{printf("Negativ e number");break;}}getch();}Find address of char, string, integer#include#includemain(){char *chp,*sp;int i;char ch,s[10];int *ip;clrscr();printf("Enter a char:");scanf("%c",ch);printf("Enter a string:");scanf("%s",s);printf("Enter a integer:");scanf("%d",&i);chp=&ch;sp=s;ip=&i;

printf("\nchar\tadd\tstring\t\tstringadd\tint\tint add\n");printf("%c\t%u\t%s\t\t%u\t\t%d\t%u",ch,&chp,s,&s,i,&i);printf("\nchar pointer value is:%u",chp);printf("\nstring pointer value is:%u",sp);printf("\nint pointer value is:%u",ip);getch();}

Find Inverse of a Given Matrix#include#include
http://free-c-programs.blogspot.com/2011/08/find-given-number-is-positive-or.htmlhttp://free-c-programs.blogspot.com/2011/08/find-given-number-is-positive-or.htmlhttp://free-c-programs.blogspot.com/2011/08/find-address-of-char-string-integer.htmlhttp://free-c-programs.blogspot.com/2011/08/find-inverse-of-given-matrix.htmlhttp://free-c-programs.blogspot.com/2011/08/find-inverse-of-given-matrix.htmlhttp://free-c-programs.blogspot.com/2011/08/find-address-of-char-string-integer.htmlhttp://free-c-programs.blogspot.com/2011/08/find-given-number-is-positive-or.htmlhttp://free-c-programs.blogspot.com/2011/08/find-given-number-is-positive-or.html


21/118



#include#include

//Read Matrixvoid read_mat(float a[][10],int n){

int i,j;printf("\n\nEnter %d X %d matrix below:\n",n,n);for(i=0;i


22/118



{int i,j;for(i=0;i1.0e-6)break;if(j==n){printf("Inverse does not exist");getch();exit(0);}swap_rows(a,n,i,j);swap_rows(ia,n,i,j);}row_mult(ia,n,i,1/a[i][i]);row_mult(a,n,i,1/a[i][i]);for(j=0;j


23/118



if(r2!=0)d3=r2;elsed3=0;}elsed2=0;d3=0;}sum=d1+d2+d3;printf("\n sum of 3 digit no is %d",sum);getch();}Hsort, heap sort/* array of MAXARRAY length ... */#define MAXARRAY 5

/* preform the heapsort */void heapsort(int ar[], int len);/* help heapsort() to bubble down starting at pos[ition] */

void heapbubble(int pos, int ar[], int len);

int main(void) {int array[MAXARRAY];int i = 0;

/* load some random values into the array */for(i = 0; i < MAXARRAY; i++)array[i] = rand() % 100;

/* print the original array */printf("Before heapsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}printf("\n");

heapsort(array, MAXARRAY);

/* print the `heapsorted' array */printf("After heapsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}printf("\n");

return 0;}

void heapbubble(int pos, int array[], int len){int z = 0;int max = 0;int tmp = 0;int left = 0;
http://free-c-programs.blogspot.com/2008/12/hsort-heap-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/hsort-heap-sort.html


24/118



int right = 0;

z = pos;for(;;) {left = 2 * z + 1;right = left + 1;

if(left >= len)return;else if(right >= len)max = left;else if(array[left] > array[right])max = left;elsemax = right;

if(array[z] > array[max])return;

tmp = array[z];

array[z] = array[max];array[max] = tmp;z = max;}}

void heapsort(int array[], int len){int i = 0;int tmp = 0;

for(i = len / 2; i >= 0; --i)heapbubble(i, array, len);

for(i = len - 1; i > 0; i--){tmp = array[0];array[0] = array[i];array[i] = tmp;heapbubble(0, array, i);}}Program for demonstration of Tree Operations - INSERTION, INORDER .#include #include # include

struct node{struct node *left;int data;struct node *right;};

void main(){void insert(struct node **,int);
http://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree_14.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree_14.html


25/118



void inorder(struct node *);void postorder(struct node *);void preorder(struct node *);struct node *ptr;int will,i,num;ptr = NULL;ptr->data=NULL;clrscr();

printf("Enter the number of terms you want to add to the tree.");scanf("%d",&will);

/* Getting Input */for(i=0;i{printf("Enter the item");scanf("%d",&num);insert(&ptr,num);}

getch();printf("INORDER TRAVERSAL");inorder(ptr);getch();printf("PREORDER TRAVERSAL");preorder(ptr);getch();printf("POSTORDER TRAVERSAL");postorder(ptr);getch();}

void insert(struct node **p,int num){

if((*p)==NULL){ printf("Leaf node created.");(*p)=malloc(sizeof(struct node));(*p)->left = NULL;(*p)->right = NULL;(*p)->data = num;return;}else

{ if(num==(*p)->data){printf("REPEATED ENTRY ERRORVALUE REJECTED");return;}if(numdata){printf("Directed to left link.");


26/118



insert(&((*p)->left),num);}else{printf("Directed to right link.");insert(&((*p)->right),num);}}return;}

void inorder(struct node *p){if(p!=NULL){inorder(p->left);printf("Data :%d",p->data);inorder(p->right);}

elsereturn;}

void preorder(struct node *p){if(p!=NULL){printf("Data :%d",p->data);preorder(p->left);preorder(p->right);}elsereturn;}

void postorder(struct node *p){if(p!=NULL){postorder(p->left);postorder(p->right);printf("Data :%d",p->data);}

elsereturn;}Program for demonstration of Tree Operations - INSERTION, INORDER .# include# include# include

struct node{
http://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree.html


27/118



struct node *left;int data;struct node *right;};

void main(){void insert(struct node **,int);void inorder(struct node *);void postorder(struct node *);void preorder(struct node *);struct node *ptr;int will,i,num;ptr = NULL;ptr->data=NULL;clrscr();



getch();printf("INORDER TRAVERSAL");inorder(ptr);getch();printf("PREORDER TRAVERSAL");preorder(ptr);getch();printf("POSTORDER TRAVERSAL");postorder(ptr);getch();}


if((*p)==NULL)

{ printf("Leaf node created.");(*p)=malloc(sizeof(struct node));(*p)->left = NULL;(*p)->right = NULL;(*p)->data = num;return;}else{ if(num==(*p)->data){


28/118



printf("REPEATED ENTRY ERRORVALUE REJECTED");return;}if(numdata){printf("Directed to left link.");insert(&((*p)->left),num);}else{printf("Directed to right link.");insert(&((*p)->right),num);}}return;}

void inorder(struct node *p){if(p!=NULL){inorder(p->left);printf("Data :%d",p->data);inorder(p->right);}elsereturn;}

void preorder(struct node *p){if(p!=NULL){printf("Data :%d",p->data);preorder(p->left);preorder(p->right);}elsereturn;}

void postorder(struct node *p)

{if(p!=NULL){postorder(p->left);postorder(p->right);printf("Data :%d",p->data);}else


29/118



return;}Isort, insertion sort#include

void isort(float arr[], int n);int fm(float arr[], int b, int n);

int main(void){float arr1[5] = {4.3, 6.7, 2.8, 8.9, 1.0};float arr2[5] = {4.3, 6.7, 2.8, 8.9, 1.0};int i = 0;

isort(arr2, 5);

printf("\nBefore\tAfter\n--------------\n");

for(i = 0; i < 5; i++)

printf("%.2f\t%.2f\n", arr1[i], arr2[i]);

return 0;}

int fm(float arr[], int b, int n) {int f = b;int c;

for(c = b + 1; c < n; c++)if(arr[c] < arr[f])f = c;

return f;}

void isort(float arr[], int n){int s, w;float sm;

for(s = 0; s < n - 1; s++){w = fm(arr, s, n);sm = arr[w];arr[w] = arr[s];arr[s] = sm;

}}Insertion sort in linked liststruct lnode {char *str;struct lnode *next;};

struct lnode *insert(char *data, struct lnode *list);void free_list(struct lnode *list);
http://free-c-programs.blogspot.com/2008/12/isort-insertion-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/insertion-sort-in-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/insertion-sort-in-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/isort-insertion-sort.html


30/118



void print_list(struct lnode *list);

int main(void) {char line[1024];struct lnode *list;

list = NULL;while((fgets(line, 1024, stdin)) != NULL)list = insert(line, list);

print_list(list);free_list(list);return 0;}

struct lnode *insert(char *data, struct lnode *list) {struct lnode *p;struct lnode *q;

/* create a new node */

p = (struct lnode *)malloc(sizeof(struct lnode));/* save data into new node */p->str = strdup(data);

/* first, we handle the case where `data' should be the first element */if(list == NULL || strcmp(list->str, data) > 0) {/* apperently this !IS! the first element *//* now data should [be|becomes] the first element */p->next = list;return p;} else {/* search the linked list for the right location */q = list;while(q->next != NULL && strcmp(q->next->str, data) < 0) {q = q->next;}p->next = q->next;q->next = p;return list;}}

void free_list(struct lnode *list) {struct lnode *p;

while(list != NULL) {p = list->next;

free(list);list = p;}}

void print_list(struct lnode *list) {struct lnode *p;

for(p = list; p != NULL; p = p->next)


31/118



printf("%s", p->str);}Find address of char, string, integer#include#includemain(){char *chp,*sp;int i;char ch,s[10];int *ip;clrscr();printf("Enter a char:");scanf("%c",ch);printf("Enter a string:");scanf("%s",s);printf("Enter a integer:");scanf("%d",&i);chp=&ch;sp=s;

ip=&i;printf("\nchar\tadd\tstring\t\tstringadd\tint\tint add\n");printf("%c\t%u\t%s\t\t%u\t\t%d\t%u",ch,&chp,s,&s,i,&i);printf("\nchar pointer value is:%u",chp);printf("\nstring pointer value is:%u",sp);printf("\nint pointer value is:%u",ip);getch();}

Isort, insertion sort#include

void isort(float arr[], int n);int fm(float arr[], int b, int n);

int main(void){float arr1[5] = {4.3, 6.7, 2.8, 8.9, 1.0};float arr2[5] = {4.3, 6.7, 2.8, 8.9, 1.0};int i = 0;

isort(arr2, 5);

printf("\nBefore\tAfter\n--------------\n");

for(i = 0; i < 5; i++)printf("%.2f\t%.2f\n", arr1[i], arr2[i]);

return 0;}

int fm(float arr[], int b, int n) {int f = b;int c;

for(c = b + 1; c < n; c++)if(arr[c] < arr[f])
http://free-c-programs.blogspot.com/2011/08/find-address-of-char-string-integer.htmlhttp://free-c-programs.blogspot.com/2008/12/isort-insertion-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/isort-insertion-sort.htmlhttp://free-c-programs.blogspot.com/2011/08/find-address-of-char-string-integer.html


32/118



f = c;

return f;}

void isort(float arr[], int n){int s, w;float sm;

for(s = 0; s < n - 1; s++){w = fm(arr, s, n);sm = arr[w];arr[w] = arr[s];arr[s] = sm;}}UPPER, LOWER AND REVERSEvoid main ()

{char str [20];clrscr ();printf ("Enter your name: ");gets (str);printf("\nLength is : %d",strlen(str));printf("\nUpper is : %s",strupr(str));printf("\nLower is : %s",strlwr(str));printf("\nReverese is : %s",strrev(str));getch ();}

Linked List implementation#include"m_list.h"

void main(){list *first=NULL,*second=NULL,*third=NULL;int choice,i;char ch='y';while(1){clrscr();printf("
http://free-c-programs.blogspot.com/2007/08/upper-lower-and-reverse.htmlhttp://free-c-programs.blogspot.com/2008/12/linked-list-implementation.htmlhttp://bp1.blogger.com/_urRtV3T_f1g/RtQK7GrnS-I/AAAAAAAAAGg/DzbqUNmJsGo/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2008/12/linked-list-implementation.htmlhttp://free-c-programs.blogspot.com/2007/08/upper-lower-and-reverse.html


33/118



case 1: Create list");printf("case 2: Add in the list");printf("case 3: Delete in the list");printf("case 4: Append two list");printf("case 5: show list");printf("case 6: Exit");printf("Enter your choice : ");scanf("%d",&choice);switch(choice){case 1: //create listwhile(ch!='n'){printf("Enter element : ");

scanf("%d",&i);create(&first,i);printf("Enter element (y/n) : ");fflush(stdin);scanf("%c",&ch);}break;case 2: //add in the listint c;clrscr();printf("case 1: Add in Beginning");printf("case 2: Add in End");printf("case 3: Add After a given element");printf("case 4: Return to main menu");printf("Enter your choice : ");scanf("%d",&c);switch(c){case 1: add_at_beg(&first);break;case 2: add_at_end(&first);break;case 3: add_after_given_element(&first);break;case 4: break;}break;

case 3:clrscr();printf("case 1: Delete in Beginning");printf("case 2: Delete in End");printf("case 3: Delete a specified element");printf("case 4: Return to main menu");printf("Enter your choice : ");scanf("%d",&c);switch(c){


34/118



case 1: del_at_beg(&first);break;case 2: del_at_end(&first);break;case 3: del_specified_element(&first);break;case 4: break;}break;case 4:char ch='y';printf("Enter element in second list : ");while(ch!='n'){printf("Enter element : ");scanf("%d",&i);create(&second,i);printf("Enter element (y/n) : ");fflush(stdin);scanf("%c",&ch);

}append(&third,first,second);

break;case 5: //show listclrscr();printf("case 1: List 1");printf("case 2: List 2");printf("case 3: List 3");printf("Enter choice : ");scanf("%d",&choice);switch(choice){case 1: show(first);break;case 2: show(second);break;case 3: show(third);break;}break;case 6: exit(0);

}

}}

*********************************#include#include#include#includetypedef struct list


35/118



{int info;struct list *next;};

//.................Function Declaration ...........

void create(struct list **p,int i){struct list *temp,*q=*p;temp=(struct list*)malloc(sizeof(struct list));temp->info=i;temp->next=NULL;if(*p==NULL)*p=temp;else{while(q->next!=NULL)q=q->next;q->next=temp;

}}int append(struct list **t,struct list *f,struct list *s){struct list *temp=*t;if(f==NULL && s==NULL)return 0;while(f){create(t,f->info);f=f->next;}while(s){create(t,s->info);s=s->next;}

return 0;}void show(struct list *p){if(p==NULL)printf(" List is Empty");elsewhile(p){

printf("%d ",p->info);p=p->next;}getch();}void add_at_beg(struct list **l){struct list *temp=(struct list *)malloc(sizeof(struct list));printf("Enter element : ");


36/118



scanf("%d",&temp->info);temp->next=NULL;if(*l==NULL)*l=temp;else{temp->next=*l;*l=temp;}}void del_at_beg(struct list **l){list *temp;if(*l==NULL){printf("List is empty");getch();}else

{temp=*l;*l=(*l)->next;free(temp);}}void add_at_end(struct list **l){list *temp,*p;temp=(struct list *)malloc(sizeof(struct list));printf("Enter element : ");scanf("%d",&temp->info);temp->next=NULL;if(*l==NULL)*l=temp;else{p=*l;while(p->next!=NULL)p=p->next;p->next=temp;}}

void del_at_end(struct list **l){

list *temp,*p;if(*l==NULL){printf("List is Empty");getch();}else if((*l)->next==NULL){temp=*l;


37/118



*l=NULL;free(temp);}else{p=*l;while(p->next->next!=NULL)p=p->next;temp=p->next->next;p->next=NULL;free(temp);}}void add_after_given_element(list **l){list *temp,*p;int m;temp=(struct list *)malloc(sizeof(struct list));printf("Enter element : ");

scanf("%d",&temp->info);printf("Enter position after which element inserted : ");scanf("%d",&m);temp->next=NULL;if(*l==NULL)*l=temp;else{p=*l;while(p->next!=NULL)if(p->info==m)break;elsep=p->next;

temp->next=p->next;p->next=temp;

}}void del_specified_element(list **l){list *temp,*p,*q;int m;printf("Enter element which is deleted : ");

scanf("%d",&m);if(*l==NULL){printf("List is Empty");getch();}else if((*l)->next!=NULL && (*l)->info==m){temp=*l;


38/118



*l=(*l)->next;free(temp);}else if((*l)->next==NULL && (*l)->info==m){temp=*l;*l=NULL;free(temp);}else{p=*l;while(p!=NULL)if(p->info==m)break;else{q=p;p=p->next;}

temp=p;q->next=p->next;free(temp);}}Matrix Multiplicationvoid main(){int row1=0,col1=1,row2=0,col2=0,**matrix1,**matrix2,**result;

clrscr();printf(" Enter number of row for first matrix ");scanf("%d",&row1);

while (col1!=row2){printf(" Enter number of column for first matrix ");scanf("%d",&col1);

printf(" Enter number of row for second matrix ");scanf("%d",&row2);

if (col1!=row2){clrscr();printf("Column number of first matrix must be same as the row number ofsecond matrix");}

}
http://free-c-programs.blogspot.com/2008/12/matrix-multiplication.htmlhttp://free-c-programs.blogspot.com/2008/12/matrix-multiplication.html


39/118



printf(" Enter number of column for second matrix ");scanf("%d",&col2);

matrix1=init(matrix1,row1,col1);matrix2=init(matrix2,row2,col2);/* setting values in matrix */printf("First matrix \n");set(matrix1,row1,col1);printf("Second matrix \n");set(matrix2,row2,col2);/* printint matrix */clrscr();printf(" [ First matrix ]\n");get(matrix1,row1,col1);printf(" [ Second matrix ]\n");get(matrix2,row2,col2);

printf(" [ Multiplication Result ]\n");

result=mul(matrix1,matrix2,row1,col2,col1);get(result,row1,col2);printf("\n\t\t Thanks from debmalya jash");getch();free(matrix1);free(matrix2);fress(result);

} /* end main */

/* to initialize matrix */int** init(int** arr,int row,int col){int i=0,j=0;

arr=(int**)malloc(sizeof(int)*row*col);

for(i=0;i{for(j=0;j{*((arr+i)+j)=(int*)malloc(sizeof(int));*(*(arr+i)+j)=0;}

}return arr;}

/* to set value in matrix */int** set(int** arr,int row,int col){int i=0,j=0,val=0;


40/118



for(i=0;i{for(j=0;j{printf("Enter value for row %d col %d :",(i+1),(j+1));scanf("%d",&val);*(*(arr+i)+j)=val;}}return arr;}

/* print values of the passed matrix */void get(int** arr,int row,int col){int i=0,j=0;

for(i=0;i{for(j=0;j{printf("%d\t",*(*(arr+i)+j));}printf("\n");}}

/* mutiply two matrices and return the resultant matrix */int** mul(int** arr1,int** arr2,int row,int col,int col1){int **result,i=0,j=0,k=0;

result=init(result,row,col);

for(i=0;i{for(j=0;j{for(k=0;k{printf("%dX%d(%d)",*(*(arr1+i)+k),*(*(arr2+k)+j),(*(*(arr1+i)+k))*(*(*(arr2+k

)+j)));*(*(result+i)+j)+=(*(*(arr1+i)+k))*(*(*(arr2+k)+j));

if (k!=(col1-1))printf("+");}printf("\t");}printf("\n");


41/118



}return result;Merge sort - linked liststruct node {int number;struct node *next;};

/* add a node to the linked list */struct node *addnode(int number, struct node *next);/* preform merge sort on the linked list */struct node *mergesort(struct node *head);/* merge the lists.. */struct node *merge(struct node *head_one, struct node *head_two);

int main(void) {struct node *head;struct node *current;struct node *next;int test[] = {8, 3, 2, 6, 1, 5, 4, 7, 9, 0};

int i;

head = NULL;/* insert some numbers into the linked list */for(i = 0; i < 10; i++)head = addnode(test[i], head);

/* sort the list */head = mergesort(head);

/* print the list */printf(" before after\n"), i = 0;for(current = head; current != NULL; current = current->next)printf("%4d\t%4d\n", test[i++], current->number);

/* free the list */for(current = head; current != NULL; current = next)next = current->next, free(current);

/* done... */return 0;}

/* add a node to the linked list */struct node *addnode(int number, struct node *next) {struct node *tnode;

tnode = (struct node*)malloc(sizeof(*tnode));

if(tnode != NULL) {tnode->number = number;tnode->next = next;}

return tnode;}
http://free-c-programs.blogspot.com/2008/12/merge-sort-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/merge-sort-linked-list.html


42/118



/* preform merge sort on the linked list */struct node *mergesort(struct node *head) {struct node *head_one;struct node *head_two;

if((head == NULL) || (head->next == NULL))return head;

head_one = head;head_two = head->next;while((head_two != NULL) && (head_two->next != NULL)) {head = head->next;head_two = head->next->next;}head_two = head->next;head->next = NULL;

return merge(mergesort(head_one), mergesort(head_two));}

/* merge the lists.. */struct node *merge(struct node *head_one, struct node *head_two) {struct node *head_three;

if(head_one == NULL)return head_two;

if(head_two == NULL)return head_one;

if(head_one->number < head_two->number) {head_three = head_one;head_three->next = merge(head_one->next, head_two);} else {head_three = head_two;head_three->next = merge(head_one, head_two->next);}

return head_three;}Msort Merge sort#define MAXARRAY 10

void mergesort(int a[], int low, int high);

int main(void) {int array[MAXARRAY];

int i = 0;


/* array before mergesort */printf("Before :");for(i = 0; i < MAXARRAY; i++)printf(" %d", array[i]);
http://free-c-programs.blogspot.com/2008/12/msort-merge-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/msort-merge-sort.html


43/118



printf("\n");

mergesort(array, 0, MAXARRAY - 1);

/* array after mergesort */printf("Mergesort :");for(i = 0; i < MAXARRAY; i++)printf(" %d", array[i]);

printf("\n");return 0;}

void mergesort(int a[], int low, int high) {int i = 0;int length = high - low + 1;int pivot = 0;int merge1 = 0;int merge2 = 0;

int working[length];

if(low == high)return;

pivot = (low + high) / 2;

mergesort(a, low, pivot);mergesort(a, pivot + 1, high);

for(i = 0; i < length; i++)working[i] = a[low + i];

merge1 = 0;merge2 = pivot - low + 1;

for(i = 0; i < length; i++){if(merge2


44/118



void value_sub(int a,int b,int arr[][10] )

{

for(i=0;i


45/118



int A[10][10]={0},B[10][10]={0};

printf(Enter the column and row of first matrix(m x n)\n);


printf(Enter the column and row of second matrix(m x n)\n);


printf(\n\n);

if (n1==m2)

{

value_sub(m1,n1,A);

printf(\n\n);

value_sub(m2,n2,B);

printf(\n\n);

mat_mul(m1,n2,A,B);

}

else

printf(Matrix multiplication cannot be done);

getch();

}SUM,SUB,PRODUCT,DIVISION#includevoid main (){int a,b,c,d,e,f;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);c=a+b;

d=a-b;e=a*b;f=a/b;printf ("\nSum is : %d",c);printf ("\nSubtraction is : %d",d);printf ("\nMultiplication is : %d",e);printf ("\nDivision is : %d",f);getch ();}
http://free-c-programs.blogspot.com/2007/08/three-actions-in-one.htmlhttp://free-c-programs.blogspot.com/2007/08/three-actions-in-one.html


46/118



Output

Method #2

WAP TO SUM, SUBTRACT, MULTIPLY & DIVISION OF TWO NUMBERS (3 VARIABLES)

#includevoid main (){int a,b,c;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);c=a+b;printf ("\nSum is %d",c);c=a-b;printf ("\nSubtraction is %d",c);c=a*b;

printf ("\nMultiplication is %d",c);c=a/b;printf ("\nDivision is %d",c);getch ();}

Output

Multiply and swap 2 nmbers using bitwise operators#include#include
http://free-c-programs.blogspot.com/2011/08/multiply-and-swap-2-nmbers-using.htmlhttp://bp1.blogger.com/_urRtV3T_f1g/RtPapWrnSTI/AAAAAAAAABI/2gVm4TU3k4A/s1600-h/output.JPGhttp://bp0.blogger.com/_urRtV3T_f1g/RtPaZGrnSSI/AAAAAAAAABA/GqNbF_L8eLI/s1600-h/output.JPGhttp://bp1.blogger.com/_urRtV3T_f1g/RtPapWrnSTI/AAAAAAAAABI/2gVm4TU3k4A/s1600-h/output.JPGhttp://bp0.blogger.com/_urRtV3T_f1g/RtPaZGrnSSI/AAAAAAAAABA/GqNbF_L8eLI/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2011/08/multiply-and-swap-2-nmbers-using.html


47/118



void main(void){int a,b;clrscr();printf("Input value of A: ");scanf("%d",&a);printf("Input value of B: ");scanf("%d",&b);a=a^b;b=b^a;a=b^a;printf("After Swapping:\n");printf("Value of A: %d",a);printf("\nValue of B: %d",b);getch();}Ohms law example In C#include#include#include

int main(){char ch;float voltage , current , resistance , result;printf("Ohms law calculator.\n");printf("Please choose from following calculcations.\n");printf("1. choose 1 to calculate the voltage.\n");printf("2. choose 2 to calculate the current.\n");printf("3. choose 3 to calculate the resistance.\n");printf("Anything else to quit.\n");scanf("%c",&ch);switch(ch){case '1' :printf("please enter the current in amps.\n");scanf("%f",t);printf("Now enter the resistance in ohms.\n");scanf("%f",&resistance);result = current * resistance;printf("The voltage is %0.2f volts.\n",result);break;case '2' :printf("please enter the voltage in volts.\n");scanf("%f",&voltage);printf("Now enter the resistance in ohms.\n");scanf("%f",&resistance);result = voltage / resistance;

printf("The current is %0.2f amps.\n",result);break;case '3' :printf("please enter the voltage in volts.\n");scanf("%f",&voltage);printf("Now enter the current in amps.\n");scanf("%f",t);result = voltage / current;printf("The resistance is %0.2f ohms.\n",result);break;
http://free-c-programs.blogspot.com/2008/12/ohms-law-example-in-c.htmlhttp://free-c-programs.blogspot.com/2008/12/ohms-law-example-in-c.html


48/118



default :exit(0);break;}return 0;}Print a double pyramidvoid main(void){clrscr();int i,j,k,l,b,n;printf("Enter the value of N:");scanf("%d",&n);for(i=0;i{printf("");for(l=0;lprintf(" ");for(j=i+1;ji;k--)printf("%d",k);}b=n-1;for(i=0;i{printf("");for(l=n-2;l>i;l--)printf(" ");for(j=b;j=b;k--)printf("%d",k);b--;}getch();}Print Armstrong numbers Less Than 1000

#include#includevoid main(){int q,a,b,c,z,x,n=1;clrscr();printf(" OUTPUT :");while(n


49/118



getch();}

Print Second Largest Among Given Three No.s#include

#includevoid main(){int a,b,c;clrscr();printf(" OUTPUT :\n");printf("Enter any three no.s:");scanf("%d%d%d",&a,&b,&c);if(a>b&&a>c)

if(b>c)printf("%d is the second largest no.",b);elseprintf("%d is the second largest no.",c);

if(b>a&&b>c)

if(a>c)printf("the second largest no. is % d",a);elseprintf(" the second largest no. is %d",c);

if(c>a&&c>b)

if(b>a)printf("second largest no. is %d",b);elseprintf("second largest no. is %d",a);

getch();}

Print Second Largest Among Given Three No.S#include

#includevoid main(){

int a,b,c;clrscr();printf(" OUTPUT :\n");printf("Enter any three no.s:");scanf("%d%d%d",&a,&b,&c);if(a>b&&a>c)

if(b>c)printf("%d is the second largest no.",b);
http://free-c-programs.blogspot.com/2011/08/print-second-largest-among-given-three_19.htmlhttp://free-c-programs.blogspot.com/2011/08/print-second-largest-among-given-three.htmlhttp://free-c-programs.blogspot.com/2011/08/print-second-largest-among-given-three.htmlhttp://free-c-programs.blogspot.com/2011/08/print-second-largest-among-given-three_19.html


50/118



elseprintf("%d is the second largest no.",c);

if(b>a&&b>c)

if(a>c)printf("the second largest no. is % d",a);elseprintf(" the second largest no. is %d",c);

if(c>a&&c>b)

if(b>a)printf("second largest no. is %d",b);elseprintf("second largest no. is %d",a);

getch();}

Progam that gives length of side of a Triangle//Progam that gives all details of a Triangle given the lengths of its sides#include#include#include#include

main(){clrscr();float a,b,c,S,D,A,B,C,Area,R;printf("Enter the lengths of the three sides of the triangle :");scanf("%f%f%f",&a,&b,&c);

S = (a+b+c)/2.0; // S is the semiperimeter of the triangleD = S*(S-a)*(S-b)*(S-c);//D is the square of the area of the triangleif(D


51/118



Area = sqrt(D);R = (a*b*c)/(4.0*Area);printf("PERIMETER = %.2f units",(2.0*S));printf("AREA = %.2f sq.units",Area);printf("CIRCUM RADIUS = %.2f units",R);// using sine rule,we get...A = (180.0/3.1415926)*asin(a/(2.0*R));// value of pi should be upto 7B = (180.0/3.1415926)*asin(b/(2.0*R));// decimal places of accuracy andalsoC = (180.0/3.1415926)*asin(c/(2.0*R));// note that the 7th decimal place// 6 and not 7 as it had to be if wereif(A==90.0 || B==90.0 || C==90.0)// approximated to 7 decimalplacesprintf("The triangle is RIGHT ANGLED");if(A90.0)printf("The triangle is OBTUSE ANGLED");

printf("The angles are as follows :");

printf("A = %.2f degrees",A);printf("B = %.2f degrees",B);printf("C = %.2f degrees",C);printf("Where A,B,C stand for angles opposite to sides%.2f,%.2f,%.2f",a,b,c);printf(" respectively");

getch();return 0;}Program for conversion of Decimal to Roman Number#include

main(){int a,b,c,d,e;clrscr();printf("Input a number (between 1-3000):");scanf("%d",&e);while (e==0||e>3000){printf ("ERROR: Invalid Input!");printf ("Enter the number again:");scanf ("%d",&e);}if (e>3000)printf("Invalid");

a = (e/1000)*1000;b = ((e/100)%10)*100;c = ((e/10)%10)*10;d = ((e/1)%10)*1;

if (a ==1000)printf("M");else if (a ==2000)printf("MM");else if (a ==3000)
http://free-c-programs.blogspot.com/2008/12/program-for-conversion-of-decimal-to.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-conversion-of-decimal-to.html


52/118



printf("MMM");

if (b == 100)printf("C");else if (b == 200)printf("CC");else if (b == 300)printf("CCC");else if (b == 400)printf("CD");else if (b ==500)printf("D");else if (b == 600)printf("DC");else if (b == 700)printf("DCC");else if (b ==800)printf("DCCC");else if (b == 900)printf("CM");

if (c == 10)printf("X");else if (c == 20)printf("XX");else if (c == 30)printf("XXX");else if (c == 40)printf("XL");else if (c ==50)printf("L");else if (c == 60)printf("LX");else if (c == 70)printf("LXX");else if (c ==80)printf("LXXX");else if (c == 90)printf("XC");

if (d == 1)printf("I");else if (d == 2)printf("II");else if (d == 3)printf("III");

else if (d == 4)printf("IV");else if (d ==5)printf("V");else if (d == 6)printf("VI");else if (d == 7)printf("VII");else if (d ==8)printf("VIII");


53/118



else if (d == 9)printf("IX");getch();}Program for demonstration of Tree Operations - INSERTION, INORDER .#include #include # include

struct node{struct node *left;int data;struct node *right;};

void main(){void insert(struct node **,int);void inorder(struct node *);

void postorder(struct node *);void preorder(struct node *);struct node *ptr;int will,i,num;ptr = NULL;ptr->data=NULL;clrscr();



getch();printf("INORDER TRAVERSAL");inorder(ptr);getch();printf("PREORDER TRAVERSAL");preorder(ptr);getch();printf("POSTORDER TRAVERSAL");

postorder(ptr);getch();}

http://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree_14.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree_14.html


54/118



if((*p)==NULL){ printf("Leaf node created.");(*p)=malloc(sizeof(struct node));(*p)->left = NULL;(*p)->right = NULL;(*p)->data = num;return;}else{ if(num==(*p)->data){printf("REPEATED ENTRY ERRORVALUE REJECTED");return;}if(numdata){printf("Directed to left link.");insert(&((*p)->left),num);

}else{printf("Directed to right link.");insert(&((*p)->right),num);}}return;}

void inorder(struct node *p){if(p!=NULL){inorder(p->left);printf("Data :%d",p->data);inorder(p->right);}elsereturn;}

void preorder(struct node *p){if(p!=NULL)

{printf("Data :%d",p->data);preorder(p->left);preorder(p->right);}elsereturn;}


55/118



void postorder(struct node *p){if(p!=NULL){postorder(p->left);postorder(p->right);printf("Data :%d",p->data);}elsereturn;}Program for demonstration of Tree Operations - INSERTION, INORDER .# include# include# include

struct node{struct node *left;

int data;struct node *right;};

void main(){void insert(struct node **,int);void inorder(struct node *);void postorder(struct node *);void preorder(struct node *);struct node *ptr;int will,i,num;ptr = NULL;ptr->data=NULL;clrscr();



getch();printf("INORDER TRAVERSAL");inorder(ptr);getch();printf("PREORDER TRAVERSAL");preorder(ptr);getch();printf("POSTORDER TRAVERSAL");postorder(ptr);getch();
http://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree.html


56/118



}


if((*p)==NULL){ printf("Leaf node created.");(*p)=malloc(sizeof(struct node));(*p)->left = NULL;(*p)->right = NULL;(*p)->data = num;return;}else{ if(num==(*p)->data){printf("REPEATED ENTRY ERROR

VALUE REJECTED");return;}if(numdata){printf("Directed to left link.");insert(&((*p)->left),num);}else{printf("Directed to right link.");insert(&((*p)->right),num);}}return;}

void inorder(struct node *p){if(p!=NULL){inorder(p->left);printf("Data :%d",p->data);inorder(p->right);}

elsereturn;}

void preorder(struct node *p){if(p!=NULL){printf("Data :%d",p->data);


57/118



preorder(p->left);preorder(p->right);}elsereturn;}

void postorder(struct node *p){if(p!=NULL){postorder(p->left);postorder(p->right);printf("Data :%d",p->data);}elsereturn;}

Program for finding the transpose of a martix in sparse form#include #include int a[100][100],b[100][100];

void main(){int i,m,n,p,q,col,t;clrscr();printf("Enter the no. of rows");scanf("%d", &a[0][0]);printf("Enter the no. of cols");scanf("%d", &a[0][1]);printf("Enter the number of non zero terms");scanf("%d", &a[0][2]);

for(i=1;i


58/118



/* Calling function for evaluation of transpose */

m = a[0][0];n = a[0][1];t = a[0][2];

b[0][0] = n;b[0][1] = m;b[0][2] = t;

q=1;

for( col = 1; col


59/118



setcolor(16);circle(x+(200*cos(i)),y+(200*sin(i)),8);setcolor(10);circle(x+(200*cos(i+40)),y+(200*sin(i+40)),8);//set2setcolor(16);circle(x+(160*sin(i)),y+(160*cos(i)),7); //anti clockwise:-sin,cosinterchangedcircle(x+(160*sin(i)),y+(160*cos(i)),5);setcolor(i);circle(x+(160*sin(i+40)),y+(160*cos(i+40)),7);circle(x+(160*sin(i+40)),y+(160*cos(i+40)),5);

setcolor(16);circle(x+(120*sin(i)),y+(120*cos(i)),6);//anti clockwise:-sin,cosinterchangedsetcolor(12);circle(x+(120*sin(i+40)),y+(120*cos(i+40)),6);

setcolor(16);

circle(x+(90*cos(i)),y+(90*sin(i)),5);setcolor(i);circle(x+(90*cos(i+40)),y+(90*sin(i+40)),5);}getch();return 0;}PROGRAM TO ARRANGE THE ELEMENTS IN ARRAY IN ASSENDING ORDER/*ARRANGE THE ELEMENTS IN ARRAY IN ASSENDING ORDER*/#include "stdio.h"#include "conio.h"main(){int a[100],i,n,j,search,temp;printf("\n how many no's in array");scanf("%d",&n);printf("\n enter %d elements in array",n);for(i=0;iscanf("%d",&a[i]);for(i=0;i{for(j=i+1;j{if(a[i]>a[j]){temp=a[i];a[i]=a[j];

a[j]=temp;}}printf("%4d",a[i]);}getch();}program to calculate sum all of the elments in an array#includevoid print_arr(int myArray[], int elements);
http://free-c-programs.blogspot.com/2008/12/program-to-arrange-elements-in-array-in.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-calculate-sum-all-of-elments.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-calculate-sum-all-of-elments.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-arrange-elements-in-array-in.html


60/118



int sum_arr(int myArray[], int elements);

int main(void){int myArray[5] = {78,34,25,98,12 };int sum;printf("Array info: ");print_arr(myArray,5);sum = sum_arr(myArray,5);printf("The sum of the array is : %d\n",sum);return 0;}

void print_arr(int myArray[], int elements){int i;for(i = 0;i < elements;i++){printf("%d ",myArray[i]);}

printf("\n");}

int sum_arr(int myArray[], int elements){int i, sum = 0;for(i = 0;i < elements;i++){sum = sum + myArray[i];}return(sum);}Program to compute difference between two dates#include "stdio.h"#include "math.h"void main(){int day1,mon1,year1,day2,mon2,year2;int ref,dd1,dd2,i;clrscr();printf("Enter first day, month, year");scanf("%d%d%d",&day1,&mon1,&year1);scanf("%d%d%d",&day2,&mon2,&year2);ref = year1;if(year2ref = year2;dd1=0;

dd1=func1(mon1);for(i=ref;i{if(i%4==0)dd1+=1;}dd1=dd1+day1+(year1-ref)*365;printf("No. of days of first date fronm the Jan 1 %d= %d",year1,dd1);/* Count for additional days due to leap years*/dd2=0;
http://free-c-programs.blogspot.com/2008/12/program-to-compute-difference-between.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-compute-difference-between.html


61/118



for(i=ref;i{if(i%4==0)dd2+=1;}dd2=func1(mon2)+dd2+day2+((year2-ref)*365);printf("No. of days from the reference year's first Jan = %d",dd2);printf("Therefore, diff between the two dates is %d",abs(dd2-dd1));

getch();}

int func1(x) //x for month y for dd{ int y=0;switch(x){case 1: y=0; break;

case 2: y=31; break;case 3: y=59; break;case 4: y=90; break;case 5: y=120;break;case 6: y=151; break;case 7: y=181; break;case 8: y=212; break;case 9: y=243; break;case 10:y=273; break;case 11:y=304; break;case 12:y=334; break;default: printf("Error encountered"); exit(1);}return(y);}Program to construct a pyramid of any input numbersmain(){int n,row=1,col=40,i=0,j,k=0,count=1;int a[10];clrscr();i=n-1;printf("Pyramid of how many numbers? ");scanf("%d",&n);for (j=0;j\=1;row--){k=0;k=40-(4*(row-1));i=row-1;for (col=40;col>=k;col=(col-4)){
http://free-c-programs.blogspot.com/2008/12/program-to-construct-pyramid-of-any.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-construct-pyramid-of-any.html


62/118



gotoxy(col,row);printf("%d",a[i]);--i;}}

for (count=n;count>=1;count--){k=0;k=40+(4*(count-1));i=count-1;for (col=40;col


63/118



while (fscanf(fin,"%f",&sales) != EOF){fprintf(fout,"Your sales for the year were %8.2f \n",sales);if(sales < 30000)commission = sales / 100 * 5;elsecommission = sales / 100 * 10;fprintf(fout,"Your commission is %8.2f",commission);}return 0;}Pyramid using nested for loops#include#includevoid main(){int i,j;for(i=5;i>=1;i--){for(j=i;j>=1;j--)

{printf("%d",j);}printf("\n");}}

OUTPUT

5 4 3 2 14 3 2 13 2 12 11Qcksort, quick sort#include

#define MAXARRAY 10

void quicksort(int arr[], int low, int high);

int main(void){int array[MAXARRAY] = {0};int i = 0;


/* print the original array */printf("Before quicksort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}
http://free-c-programs.blogspot.com/2011/08/pyramid-using-nested-for-loops.htmlhttp://free-c-programs.blogspot.com/2008/12/qcksort-quick-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/qcksort-quick-sort.htmlhttp://free-c-programs.blogspot.com/2011/08/pyramid-using-nested-for-loops.html


64/118



printf("\n");

quicksort(array, 0, (MAXARRAY - 1));

/* print the `quicksorted' array */printf("After quicksort: ");for(i = 0; i < MAXARRAY; i++) {printf(" %d ", array[i]);}printf("\n");

return 0;}

/* sort everything inbetween `low' `high' */void quicksort(int arr[], int low, int high){int i = low;int j = high;int y = 0;

/* compare value */int z = arr[(low + high) / 2];

/* partition */do {/* find member above ... */while(arr[i] < z) i++;

/* find element below ... */while(arr[j] > z) j--;

if(i


65/118



int main (void){char **strarray = NULL;int i = 0, strcount = 0;char line[1024];

while((fgets(line, 1024, stdin)) != NULL){if(strlen(line) == 1)continue;






free(strarray);return 0;}


void sortstrarr(void *array, unsigned n){qsort(array, n, sizeof(char *), cmpr);}Quick Sort : array of pointers to structures#include "stdio.h"#include "string.h"#include "stdlib.h"

struct node{char *str;};

/* compare function for qsort */static int cmpr(const void *a, const void *b);

int main(void){
http://free-c-programs.blogspot.com/2008/12/quick-sort-array-of-pointers-to.htmlhttp://free-c-programs.blogspot.com/2008/12/quick-sort-array-of-pointers-to.html


66/118



struct node **strarray = NULL;int i = 0, count = 0;char line[1024];

while(fgets(line, 1024, stdin) != NULL){/* add ONE element to the array */strarray = (struct node **)realloc(strarray, (count + 1) * sizeof(struct node*));

/* allocate memory for ONE `struct node` */strarray[count] = (struct node *)malloc(sizeof(struct node));

/* copy the data into the new element (structure) */strarray[count]->str = strdup(line);count++;}

/* before sorting ... */printf("Before:\n");

for(i = 0; i < count; i++){printf("[%d]->str: %s", i, strarray[i]->str);}

/* qsort array of structures */qsort(strarray, count, sizeof(*strarray), cmpr);

/* after sorting ... */printf("\n--\nAfter:\n");for(i = 0; i < count; i++){printf("[%d]->str: %s", i, strarray[i]->str);}

/* free all strarray elements */for(i = 0; i < count; i++){free(strarray[i]->str);free(strarray[i]);i++;}free(strarray);

return 0;}

/* compare function for qsort */static int cmpr(const void *a, const void *b){struct node * const *one = a;struct node * const *two = b;

return strcmp((*one)->str, (*two)->str);}Print all permutations of a given string
http://free-c-programs.blogspot.com/2011/08/print-all-permutations-of-given-string.htmlhttp://free-c-programs.blogspot.com/2011/08/print-all-permutations-of-given-string.html


67/118



# include # include

/* Function to swap values at two pointers */void swap (char *x, char *y){

char temp;temp = *x;*x = *y;*y = temp;

}

/* Function to print permutations of stringThis function takes three parameters:1. String2. Starting index of the string3. Ending index of the string. */

void permute(char *a, int i, int n){

int j;

if (i == n)printf("%s\n", a);

else{

for (j = i; j


68/118



reverse(word_begin, temp-1);word_begin = temp+1;}}

reverse(s, temp-1);}

void reverse(char *begin, char *end){char temp;while (begin < end){temp = *begin;*begin++ = *end;*end-- = temp;}}

int main( )

{char s[] = "i like this program very much";char *temp = s;reverseWords(s);printf("%s", s);getchar();return 0;}reversing a linked list#include "stdio.h"#include "stdlib.h"

#define MAX 10 /* max of 10 elements */

struct lnode{int number;struct lnode *next;};

/* add a lnode at the beginning of the list */void llist_add_begin(struct lnode **n, int val);/* reverse the whole list */void llist_reverse(struct lnode **n);/* display the whole linked list */void llist_display(struct lnode *n);

int main(void){struct lnode *new = NULL;int i = 0;

/* insert some numbers */for(i = 0; i


69/118



llist_display(new);llist_reverse(&new);printf("linked list after reversal:");llist_display(new);

return 0;}

/* add a lnode at the beginning of the list */void llist_add_begin(struct lnode **n, int val){struct lnode *temp = NULL;

/* add new node */temp = malloc(sizeof(struct lnode));temp->number = val;temp->next = *n;*n = temp;}

/* reverse the whole list */void llist_reverse(struct lnode **n){struct lnode *a = NULL;struct lnode *b = NULL;struct lnode *c = NULL;a = *n, b = NULL;

while(a != NULL){c = b, b = a, a = a->next;b->next = c;}

*n = b;}

/* display the whole linked list */void llist_display(struct lnode *n){while(n != NULL)printf(" %d", n->number), n = n->next;

printf("\n");}Search an array#include

void print_arr(int myArray[], int elements);int search_arr(int myArray[], int elements, int number);

int main(void){int myArray[10] = {12,23,56,35,18,65,12,87,73,9};int result,number;print_arr(myArray,10);number = 65;result = search_arr(myArray,10,number);
http://free-c-programs.blogspot.com/2008/12/search-array.htmlhttp://free-c-programs.blogspot.com/2008/12/search-array.html


70/118



if(result == -1)printf("%d was not found.\n",number);elseprintf("Found %d\n",result);return 0;}

void print_arr(int myArray[], int elements){int i;

for(i = 0;i < elements;i++){printf("%d ",myArray[i]);}printf("\n");}

int search_arr(int myArray[], int elements, int number){

int i;for(i = 0;i < elements;i++){if(myArray[i] == number)return(number);}return(-1);}Search An Element in Linked List#include stdio.h>#include conio.h>#include malloc.h>struct linlst{int info;struct link *next;}start, *node;

int search(int);void main(){int no,i,item,pos;clrscr();start.next=NULL;node=&start;printf("How many nodes, you want in linked list? ");

scanf("%d",&no);printf(" ");for(i=0;i{node->next=(struct linlst *)malloc(sizeof(struct linlst));printf("Enter element in node %d: ",i+1);scanf("%d",&node->info);node=node->next;}node->next=NULL;
http://free-c-programs.blogspot.com/2008/12/search-element-in-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/search-element-in-linked-list.html


71/118



printf("Linked list(only with info field) is:");

node=&start;while(node->next!=NULL){printf("%d ",node->info);node=node->next;}printf("Enter item to be searched : ");scanf("%d",&item);pos=search(item);if(posnext!=NULL){if(node->info==item)break;elsen++;node=node->next;}return n;}SEARCHING OF THE ELEMENTS OF BINARY NUMBERmain(){int a[100],i,n,j,search,mid,temp;printf("\n how many no's in array");scanf("%d",&n);printf("\n enter %d elements in array",n);for(i=0;iscanf("%d",&a[i]);for(i=0;i{for(j=i+1;j{if(a[i]>a[j]){

temp=a[i];a[i]=a[j];a[j]=temp;}}printf("%4d",a[i]);}printf("\n enter search element");scanf("%d",&search);mid=n/2;
http://free-c-programs.blogspot.com/2008/12/searching-of-elements-of-binary-number.htmlhttp://free-c-programs.blogspot.com/2008/12/searching-of-elements-of-binary-number.html


72/118



if(a[mid]==search){printf("\n location of searched element %d ",mid);}if(search>a[mid]){for(i=mid+1;i{if(a[i]==search){printf("\n location of sarched element is %d",i);}elsefor(i=0;i{if(a[i]==search)printf("\n location of searched element %d",i+1);}xcgetch();}

}}Ssort, selection sort in array#include "stdio.h"

void selection_sort(int a[], int size);

int main(void){int arr[10] = {10, 2, 4, 1, 6, 5, 8, 7, 3, 9};int i = 0;

printf("before:\n");for(i = 0; i < 10; i++) printf("%d ", arr[i]);printf("\n");

selection_sort(arr, 10);

printf("after:\n");for(i = 0; i < 10; i++) printf("%d ", arr[i]);printf("\n");

return 0;}

void selection_sort(int a[], int size){

int i = 0;int j = 0;int large = 0;int index = 0;

for(i = size - 1; i > 0; i--){large = a[0];index = 0;for(j = 1; j


73/118



if(a[j] > large){large = a[j];index = j;}a[index] = a[i];a[i] = large;}}Selection sort linked list#include "stdio.h"#include "stdlib.h"

#define MAX 10

struct lnode{int data;struct lnode *next;} *head, *visit;

/* add a new entry to the linked list */void llist_add(struct lnode **q, int num);/* preform a selection sort on the linked list */void llist_selection_sort(void);/* print the entire linked list */void llist_print(void);

int main(void){/* linked list */struct lnode *newnode = NULL;int i = 0; /* a general counter */

/* load some random values into the linked list */for(i = 0; i < MAX; i++) {llist_add(&newnode, (rand() % 100));}

head = newnode;printf("Before selection sort:\n");llist_print();printf("After selection sort:\n");llist_selection_sort();llist_print();

return 0;

}

/* adds a node at the end of a linked list */void llist_add(struct lnode **q, int num){struct lnode *temp;

temp = *q;

/* if the list is empty, create first node */
http://free-c-programs.blogspot.com/2008/12/selection-sort-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/selection-sort-linked-list.html


74/118



if(*q == NULL) {*q = malloc(sizeof(struct lnode));temp = *q;} else {/* go to last node */while(temp->next != NULL)temp = temp->next;

/* add node at the end */temp->next = malloc(sizeof(struct lnode));temp = temp->next;}

/* assign data to the last node */temp->data = num;temp->next = NULL;}

/* print the entire linked list */void llist_print(void)

{visit = head;

/* traverse the entire linked list */while(visit != NULL){printf("%d ", visit->data);visit = visit->next;}printf("\n");}

void llist_selection_sort(void){struct lnode *a = NULL;struct lnode *b = NULL;struct lnode *c = NULL;struct lnode *d = NULL;struct lnode *tmp = NULL;

a = c = head;while(a->next != NULL){d = b = a->next;while(b != NULL) {if(a->data > b->data){

/* neighboring linked list node */if(a->next == b){if(a == head){a->next = b->next;b->next = a;tmp = a;a = b;b = tmp;


75/118



head = a;c = a;d = b;b = b->next;} else {a->next = b->next;b->next = a;c->next = b;tmp = a;a = b;b = tmp;d = b;b = b->next;}} else{if(a == head){tmp = b->next;b->next = a->next;

a->next = tmp;d->next = a;tmp = a;a = b;b = tmp;d = b;b = b->next;head = a;} else{tmp = b->next;b->next = a->next;a->next = tmp;c->next = b;d->next = a;tmp = a;a = b;b = tmp;d = b;b = b->next;}}} else{d = b;b = b->next;}

}c = a;a = a->next;}}Shsort, shell sort array#include "stdio.h"

#define MAXARRAY 10
http://free-c-programs.blogspot.com/2008/12/shsort-shell-sort-array.htmlhttp://free-c-programs.blogspot.com/2008/12/shsort-shell-sort-array.html


76/118



void shellsort(int a[], int total, int index);



/* print the original array */printf("Before shellsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}printf("\n");

shellsort(array, MAXARRAY, 1);

/* print the `shellsorted' array */printf("After shellsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}printf("\n");

return 0;}

void shellsort(int a[], int total, int index){int i = 0;int j = 0;int k = 0;int l = 0;

for(k = 0; k < index; k++){for(i = k; i < total; i += index){l = a[i];for(j = (i - index); j >= 0; j -= index){if(a[j] > l)

a[j + index] = a[j];elsebreak;}a[j + index] = l;}}

return;}


77/118



Square Root of a number by using simple calculations#include#includemain(){float a,b,e=0.00001,p,k;clrscr();textcolor(GREEN);do {printf("*******************************************************");printf(" PROGRAM TO FIND SQUARE ROOT OF A NUMBERxDB");printf("*********************************************************");cprintf("ENTER A NUMBER(-1 to Quit) :");scanf("%f",&k);

a=k;p=a*a;while(p-k>=e){b=(a+(k/a))/2;

a=b;p=a*a;}printf("SQUARE ROOT IS = %f",a);getch();clrscr();}while(k!=-1);getch();}Qserch , string, dynamic pointer array#include "stdio.h"#include "stdlib.h"#include "string.h"

void sortstrarr(void *array, unsigned n);static int cmpr(const void *a, const void *b);

int main (void){char **strarray = NULL;int i = 0, strcount = 0;char line[1024];

while((fgets(line, 1024, stdin)) != NULL){if(strlen(line) == 1)

continue;


http://free-c-programs.blogspot.com/2008/12/square-root-of-number-by-using-simple.htmlhttp://free-c-programs.blogspot.com/2008/12/qserch-string-dynamic-pointer-array.htmlhttp://free-c-programs.blogspot.com/2008/12/qserch-string-dynamic-pointer-array.htmlhttp://free-c-programs.blogspot.com/2008/12/square-root-of-number-by-using-simple.html


78/118






free(strarray);return 0;}


void sortstrarr(void *array, unsigned n)

{qsort(array, n, sizeof(char *), cmpr);}Shsort, shell sort array#include "stdio.h"

#define MAXARRAY 10

void shellsort(int a[], int total, int index);



/* print the original array */printf("Before shellsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}printf("\n");

shellsort(array, MAXARRAY, 1);

/* print the `shellsorted' array */printf("After shellsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}printf("\n");
http://free-c-programs.blogspot.com/2008/12/shsort-shell-sort-array.htmlhttp://free-c-programs.blogspot.com/2008/12/shsort-shell-sort-array.html


79/118



return 0;}

void shellsort(int a[], int total, int index){int i = 0;int j = 0;int k = 0;int l = 0;

for(k = 0; k < index; k++){for(i = k; i < total; i += index){l = a[i];for(j = (i - index); j >= 0; j -= index){if(a[j] > l)a[j + index] = a[j];else

break;}a[j + index] = l;}}

return;}String array Qsort#include#include#include

void sortstrarr(void *array, unsigned n);static int cmpr(const void *a, const void *b);

int main(void){char line[1024];char *line_array[1024];int i = 0;int j = 0;

while((fgets(line, 1024, stdin)) != NULL)if(i < 1024)line_array[i++] = strdup(line);else

break;

sortstrarr(line_array, i);

while(j < i)printf("%s", line_array[j++]);

return 0;}
http://free-c-programs.blogspot.com/2008/12/string-array-qsort.htmlhttp://free-c-programs.blogspot.com/2008/12/string-array-qsort.html


80/118




void sortstrarr(void *array, unsigned n){qsort(array, n, sizeof(char *), cmpr);}SUM,SUB,PRODUCT,DIVISION#includevoid main (){int a,b,c,d,e,f;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);c=a+b;

d=a-b;e=a*b;f=a/b;printf ("\nSum is : %d",c);printf ("\nSubtraction is : %d",d);printf ("\nMultiplication is : %d",e);printf ("\nDivision is : %d",f);getch ();}

Output

Method #2

WAP TO SUM, SUBTRACT, MULTIPLY & DIVISION OF TWO NUMBERS (3 VARIABLES)

#includevoid main (){int a,b,c;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");
http://free-c-programs.blogspot.com/2007/08/three-actions-in-one.htmlhttp://bp0.blogger.com/_urRtV3T_f1g/RtPaZGrnSSI/AAAAAAAAABA/GqNbF_L8eLI/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2007/08/three-actions-in-one.html


81/118



scanf ("%d",&b);c=a+b;printf ("\nSum is %d",c);c=a-b;printf ("\nSubtraction is %d",c);c=a*b;printf ("\nMultiplication is %d",c);c=a/b;printf ("\nDivision is %d",c);getch ();}

Output

Subtraction of Two Matrices

#include#include

//Read Matrixvoid read_mat(float a[][10],int m,int n){

int i,j;printf("\n\nEnter %d X %d matrix below:\n",m,n);for(i=0;i


82/118



for(i=0;i


83/118



{char string[10];int n,pos,p;clrscr();puts(Enter the string);gets(string);printf(Enter the position from where to delete);scanf(%d,&pos);printf(Enter the number of characters to be deleted);scanf(%d,&n);delchar(string, n,pos);getch();}// Function to delete n charactersvoid delchar(char *x,int a, int b){if ((a+b-1)


84/118



struct tnode *right;};

void insert(struct tnode **p, char *value);void print(struct tnode *root);

int main(void){char line[1024];struct tnode *root;

root = NULL;while((fgets(line, 1024, stdin)) != NULL)insert(&root, line);

print(root);return 0;}

/* call by reference .. ! */

void insert(struct tnode **p, char *value){if(!*p) {*p = (struct tnode *)malloc(sizeof(struct tnode));(*p)->left = (*p)->right = NULL;(*p)->str = strdup(value);return;}

if(strcmp(value, (*p)->str) < 0)insert(&(*p)->left, value);elseinsert(&(*p)->right, value);}

/* inorder binary tree print ... */void print(struct tnode *root){if(root != NULL){print(root->left);printf("%s", root->str);print(root->right);}}Use of Strlen() Function#include

#includevoid main(void){char str[31];int len;printf("\nEnter any String");gets(str);len=strlen(str);printf("\nNumber of Character in%s=%d\n",str,len);}
http://free-c-programs.blogspot.com/2010/12/use-of-strlen-function.htmlhttp://free-c-programs.blogspot.com/2010/12/use-of-strlen-function.html


85/118



INCREMENTAL / DECREMENTALWAP TO ADD 1 & SUBTRACT 1 FROM VALUE OF A & B(INCREMENTAL & DECREMENTAL OPERATORS)void main (){int a,b;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);a++;b--;printf ("\nA is %d",a);printf ("\nB is %d",b);getch ();}

ADD ENTERED DIGITSvoid main (){int no,r,res;clrscr ();printf ("Enter any value: ");

scanf ("%d",&no);r=res=0;while (no>0){r=no%10;no=no/10;res=(res+r);}printf ("Sum is %d",res);getch ();}

ADD TWO VARIABLES#includevoid main (){
http://free-c-programs.blogspot.com/2007/08/incremental-decremental.htmlhttp://free-c-programs.blogspot.com/2007/08/add-entered-digits.htmlhttp://free-c-programs.blogspot.com/2007/08/add-two-variables_28.htmlhttp://bp3.blogger.com/_urRtV3T_f1g/RtQDimrnSsI/AAAAAAAAAEQ/-z1d7jPCcX0/s1600-h/output.JPGhttp://bp1.blogger.com/_urRtV3T_f1g/RtPgqWrnSiI/AAAAAAAAADA/-hn8EJgb_XU/s1600-h/output.JPGhttp://bp3.blogger.com/_urRtV3T_f1g/RtQDimrnSsI/AAAAAAAAAEQ/-z1d7jPCcX0/s1600-h/output.JPGhttp://bp1.blogger.com/_urRtV3T_f1g/RtPgqWrnSiI/AAAAAAAAADA/-hn8EJgb_XU/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2007/08/add-two-variables_28.htmlhttp://free-c-programs.blogspot.com/2007/08/add-entered-digits.htmlhttp://free-c-programs.blogspot.com/2007/08/incremental-decremental.html


86/118



int a,b,c;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);c=a+b;printf ("\nSum is %d",c);getch ();}

Output

CONCATENATE TWO STRINGSvoid main (){char *str,*str1;clrscr ();printf("Enter your name: ");gets (str);str1="jeet";strcat(str,str1);printf("\n %s",str);getch ();}CELCIUS TO FAHRENHEITvoid main ()

{float c,f;clrscr ();printf ("Enter the value of celcius: ");scanf ("%f",&c);f=(float) 9/5*c+32;printf ("\nFahrenheit is %.2f",f);getch ();}

MATRIX 2 X 3WAP TO CREATE DOUBLE DIMENSION ARRAY OF 2X3 MATRIX AND DISPLAY ITS ELEMENTS

void main (){int a[2][3],i,j;clrscr ();
http://free-c-programs.blogspot.com/2007/08/concatenate-two-strings.htmlhttp://free-c-programs.blogspot.com/2007/08/celcius-to-fahrenheit.htmlhttp://free-c-programs.blogspot.com/2007/08/matrix-2-x-3.htmlhttp://bp3.blogger.com/_urRtV3T_f1g/RtPeV2rnSaI/AAAAAAAAACA/2VraR55x9go/s1600-h/output.JPGhttp://bp1.blogger.com/_urRtV3T_f1g/RtPZkWrnSRI/AAAAAAAAAA4/Bzet7Nqt9Oc/s1600-h/output.JPGhttp://bp3.blogger.com/_urRtV3T_f1g/RtPeV2rnSaI/AAAAAAAAACA/2VraR55x9go/s1600-h/output.JPGhttp://bp1.blogger.com/_urRtV3T_f1g/RtPZkWrnSRI/AAAAAAAAAA4/Bzet7Nqt9Oc/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2007/08/matrix-2-x-3.htmlhttp://free-c-programs.blogspot.com/2007/08/celcius-to-fahrenheit.htmlhttp://free-c-programs.blogspot.com/2007/08/concatenate-two-strings.html


87/118



for (i=0;i


88/118



SWITCH CASEWAP TO FIND AMOUNT OF GIVEN QUANTITY OF ANY COMPANY WITH 10% DISCOUNT USINGSWITCH CASEvoid main(){int,ch qty;long tb,dis,nb;clrscr();printf("1.BPL\n2.Onida\n3.Sony\n4.Samsung\n5.LG\n");printf("\nEnter Your

Documents

Calculate Electricity Bill With If