path matrix by Warshall's algorithm

2009-11-15T18:33:00.002+05:30

/* Program to find path matrix by Warshall's algorithm */ #include #define MAX 20 main() { int i,j,k,n; int w_adj[MAX][MAX],adj[MAX][MAX],path[MAX][MAX]; printf("Enter number of vertices : "); scanf("%d",&n); printf("Enter weighted adjacency matrix :\n"); for(i=0;i

traversing a graph through BFS and DFS

2009-11-15T18:32:00.003+05:30

/* Program for traversing a graph through BFS and DFS */ #include #define MAX 20 typedef enum boolean{false,true} bool; int adj[MAX][MAX]; bool visited[MAX]; int n; /* Denotes number of nodes in the graph */ main() { int i,v,choice; create_graph(); while(1) { printf("\n"); printf("1. Adjacency matrix\n"); printf("2. Depth First Search using stack\n"); printf("3. Depth

program for topological sorting

2009-11-15T18:32:00.000+05:30

/* Program for topological sorting */ #include #define MAX 20 int n,adj[MAX][MAX]; int front=-1,rear=-1,queue[MAX]; main() { int i,j=0,k; int topsort[MAX],indeg[MAX]; create_graph(); printf("The adjacency matrix is :\n"); display(); /*Find the indegree of each node*/ for(i=1;i<=n;i++) { indeg[i]=indegree(i); if( indeg[i]==0 ) insert_queue(i); } while(front<=rear) /*

minimum spanning tree from Prim's algorithm

2009-11-15T18:26:00.000+05:30

/* Program for creating minimum spanning tree from Prim's algorithm */ #include #define MAX 10 #define TEMP 0 #define PERM 1 #define FALSE 0 #define TRUE 1 #define infinity 9999 struct node { int predecessor; int dist; /*Distance from predecessor */ int status; }; struct edge { int u; int v; }; int adj[MAX][MAX]; int n; main() { int i,j; int path[MAX]; int wt_tree,count;

path matrix by powers of adjacency matrix

2009-11-15T18:25:00.002+05:30

/* Program to find out the path matrix by powers of adjacency matrix */ #include #define MAX 20 int n; main() { int w_adj[MAX][MAX],adj[MAX][MAX],adjp[MAX][MAX]; int x[MAX][MAX],path[20][20],i,j,p; printf("Input number of vertices : "); scanf("%d",&n); printf("Enter the weighted adjacent matrix :\n"); for(i=0;i

Warshall's algorithm to find shoretst path matrix

2009-11-15T18:24:00.002+05:30

/*Program for Modified Warshall's algorithm to find shoretst path matrix */ #include #define infinity 9999 #define MAX 20 main() { int i,j,k,n; int adj[MAX][MAX],path[MAX][MAX]; printf("Enter number of vertices : "); scanf("%d",&n); printf("Enter weighted matrix :\n"); for(i=0;i

insertion and deletion of nodes and edges in a graph using adjacency list

2009-11-15T18:23:00.002+05:30

/* Program for insertion and deletion of nodes and edges in a graph using adjacency list */ #include struct edge; struct node { struct node *next; char name; struct edge *adj; }*start=NULL; struct edge { char dest; struct edge *link; }; struct node *find(char item); main() { int choice; char node,origin,destin; while(1) { printf("1.Insert a node\n"); printf("2.Insert an

minimum spanning tree from Kruskal's algorithm

2009-11-15T18:15:00.002+05:30

/* Program for creating a minimum spanning tree from Kruskal's algorithm */ #include #define MAX 20 struct edge { int u; int v; int weight; struct edge *link; }*front = NULL; int father[MAX]; /*Holds father of each node */ struct edge tree[MAX]; /* Will contain the edges of spanning tree */ int n; /*Denotes total number of nodes in the graph */ int wt_tree=0; /*Weight of the

shortest path between two node in graph using Djikstra algorithm

2009-11-15T18:14:00.001+05:30

/* Program of shortest path between two node in graph using Djikstra algorithm */ #include #define MAX 10 #define TEMP 0 #define PERM 1 #define infinity 9999 struct node { int predecessor; int dist; /*minimum distance of node from source*/ int status; }; int adj[MAX][MAX]; int n; void main() { int i,j; int source,dest; int path[MAX]; int shortdist,count; create_graph(); printf("The

Program for creation of adjacency matrix

2009-11-15T18:12:00.000+05:30

#include #define max 20 int adj[max][max]; /*Adjacency matrix */ int n; /* Denotes number of nodes in the graph */ main() { int max_edges,i,j,origin,destin; char graph_type; printf("Enter number of nodes : "); scanf("%d",&n); printf("Enter type of graph, directed or undirected (d/u) : "); fflush(stdin); scanf("%c",&graph_type); if(graph_type=='u') max_edges=n*(n-1)/2;

addition and deletion of nodes and edges in a graph

2009-11-15T18:11:00.001+05:30

/* Program for addition and deletion of nodes and edges in a graph using adjacency matrix */ #include #define max 20 int adj[max][max]; int n; main() { int choice; int node,origin,destin; create_graph(); while(1) { printf("1.Insert a node\n"); printf("2.Insert an edge\n"); printf("3.Delete a node\n"); printf("4.Delete an edge\n"); printf("5.Dispaly\n"); printf("6.Exit\n"); printf("

Grade of Students

2009-11-15T18:08:00.000+05:30

/*Program to accept name , class and marks with the use of structure with pointer. Also print the grade which is based on the marks- 1. marks > = 75 grade-A 2. marks >=50 and < 75 grade-B 3. marks < 50 grade-C */ #include main ( ) { struct { char name[20]; int class; int marks; }*ptr; printf ( "Name:" ); scanf ( " %s", ptr->name ); printf ( "Class:" ); scanf

Program to accept name , class and marks of 10 students with the use of structure with array of pointer and also print them

2009-11-15T18:06:00.000+05:30

#include main ( ) { struct { char name[20]; int class; int marks; }*rec[10]; int i; for ( i=0;i< 10;i++ ) { printf ( "Name:" ); scanf ( " %s", rec[i]->name ); printf ( "Class:" ); scanf ( " %d", &rec[i]->class ); printf ( " Marks:" ); scanf ( " %d", &rec[i]->marks ); } printf ( "Name\tClass\tMarks\n" ); for ( i=0 ; i<10 ;i++ ) { printf ( " %s\t" , rec[i]-

program to use a pointer as a member of structure and print the value of members without use of arrow operator

2009-11-15T18:04:00.000+05:30

#include main ( ) { struct rec{ char *name; int *age; int *sal; }data; char name1[20] = "B.N.S. Srivastava"; int age1=23; int sal1=17000; strcpy(data.name , "B.N.S.Srivastava"); data.age=&age1; data.sal=&sal1; printf ( "Name:%s\n" , data.name ); printf ( "Age:%d\n" , *data.age ); printf ( "Salary:%d\n" , *data.sal ); }

program to use a pointer as a member of structure and print the value of members

2009-11-15T18:03:00.000+05:30

#include main( ) { struct rec{ char *name; int *age; int *sal; }data,*ptr; char name1[10]= "R.O. Verma"; int age1=50; int sal1=17000; ptr->name=&name1; ptr->age=&age1; ptr->sal=&sal1; printf ( "Name:%s\n" , ptr->name ); printf ( "Age:%d\n" , *ptr->age ); printf ( "Salary:%d\n" , *ptr->sal ); }

program to pass the address of the structure variable

2009-11-15T18:02:00.000+05:30

#include struct rec{ char name[10]; int age; int sal; }; main ( ) { static struct rec data = { "sachin" , 26 , 25000 }; function ( &data ); } function ( ptr ) struct rec *ptr; { printf ( "Name:%s\n" ,ptr->name ); printf ( "Age:%d\n" , ptr->age ); printf ( "Salary:%d\n" , ptr->sal ); }

Program to assign the value to member of structure with the use of structure pointer

2009-11-15T18:00:00.002+05:30

#include main ( ) { struct rec{ char name[10]; int age; int sal; }*ptr; strcpy(ptr->name, "suresh"); ptr->age= 24; ptr->sal = 5000; printf ( "Name:%s\n" , ptr->name ); printf ( "Age:%d\n" , ptr->age ); printf ( "Salary:%d ", ptr->sal ); }

Program to understand pointer to structure

2009-11-15T17:59:00.002+05:30

#include main ( ) { struct rec{ char name[10]; int age; int sal; }*ptr; printf ( " Enter the name:" ); scanf ( "%s" , ptràname ); printf ( " Enter the age:"); scanf ( "%d" , &ptràage ); printf ( " Enter the salary:" ); scanf ( "%d" , &ptràsal ); printf ( "Name:%s\n" , ptràname); printf ( " Age:%d\n" , ptràage ); printf ( " Salary:%d ", ptràsal ); }

program to understand the use of realloc function

2009-11-15T17:58:00.002+05:30

#include #include #include main ( ) { char *ptr; ptr = ( char * ) malloc ( 6 ); ptr = "ankit"; printf ("%s is in memory block\n",ptr ); ptr = ( char * ) realloc ( ptr,8); printf ("%s is in memory block\n",ptr ); strcpy ( ptr , "rishabh" ); printf ("Now %s is in memory block\n",ptr ); }

program to enter the 5 numbers and print them using malloc( )

2009-11-15T17:56:00.003+05:30

#include #include main ( ) { int i; int *a; a = ( int * ) malloc ( 5 * sizeof ( int ) ); for ( i=0;i<5;i++) { printf ( " number %d=", i+1); scanf ( "%d",( a+i) ); } for ( i =0;i<5;i++) printf ( " %d\n",*(a+i) ); }

program to understand the sizeof operator

2009-11-15T17:55:00.002+05:30

#include main ( ) { struct { char name[10]; int age; float sal; }rec; int arr[10]; printf ( " size of structure = %d",sizeof ( rec ) ); printf ( " size of int = %d",sizeof ( int ) ); printf ( " size of array = %d",sizeof ( arr ) ); }

program to print the address and string using array of pointer to string

2009-11-15T17:54:00.000+05:30

#include main ( ) { int i; char *arr[ ] = { "riti", "niti", "kriti", "kittu", "nitin" }; for ( i=0;i<5;i++) { printf ( "address=%u\t",(arr + i) ); printf ( "string = %s\n", *(arr + i) ); } }

program to print the address and character of the string with using pointer

2009-11-15T17:52:00.005+05:30

#include main ( ) { char arr[ ]= "reena"; char *a; a = arr; while ( *a !='\0' ) { printf ( "address= %u\t",a); printf ( "character = %c\n",*a); a = a+1; } }

program to print the strings of the two-dimensional character array

2009-11-15T17:52:00.003+05:30

#include main ( ) { char arr[5][10] = { "riti", "niti", "kriti", "kittu", "nitin" }; int i; for ( i=0;i<5;i++) { printf ( " base address = %u",&arr[ i] ); printf ( " string = %s\n",arr[ i] ); } }

program to print the character of any string and also address of each character

2009-11-15T17:51:00.003+05:30

#include main( ) { char arr[ ] = "reeta"; int i; for ( i=0;arr[i]!='\0';i++) { printf ( " address = %u\t",&arr[i] ); printf ( "character = %c\n",arr[i] ); } }

program for understanding array of pointers

2009-11-15T17:50:00.001+05:30

#include main ( ) { static int arr[4] = { 5 , 10 , 15 , 20 }; static int *a[4] = { arr , arr+1 , arr+2 , arr+3}; int i; int **b; b=a; for ( i = 0;i < 4 ; i++) { printf ( " address = %u",*b); printf ( " value = %d \n",**b); b = b + 1; } }

program for understanding the concept of array of pointers

2009-11-15T17:49:00.000+05:30

#include main ( ) { int *arr[3]; int a = 5, b = 10, c = 15,i; arr[0] = &a; arr[1] = &b; arr[2] = &c; for ( i=0;i< 3;i++) { printf ( "address = %u\t", arr[i] ); printf ( " value = %d \n",*(arr[i]) ); } }

program to print the elements of 3-D array

2009-11-15T17:48:00.000+05:30

#include main ( ) { int arr[2][3][2] = { { { 5 , 10 }, { 6 , 11 }, { 7 , 12 }, }, { { 20 , 30 }, { 21 , 31 }, { 22 , 32 }, } }; int i,j,k; for ( i=0;i < 2;i++) for ( j=0;j < 3 ; j++) { printf ( " \n"); for ( k =0;k<2;k++) printf ( " %d\t",*(*(*(arr+i)+j)+k)); } }

Program to print the elements of the array

2009-11-15T17:47:00.002+05:30

#include main ( ) { int arr[3][2] = { { 10 , 100 }, { 20 , 200 }, { 30 , 300 } }; int i , j; for ( i = 0 ; i < 3 ; i++) { printf ( " \n" ); for ( j=0;j< 2;j++) printf ( "value = %d\t", *(*(arr+i)+j)); } }

program to print the values and address of the array element

2009-11-15T17:46:00.000+05:30

#include main ( ) { int arr[3][2]= { {10,100}, {20,200}, {30,300} }; int i, j; for ( i = 0; i < 3; i++) { printf ( "address of %d array = %u\n",i,&arr[i]); for ( j=0 ; j < 2 ; j++); printf ( "value = %d\n",arr[i][j] ); } }

program to accept 10 numbers and sort them with use of pointer

2009-11-15T17:45:00.000+05:30

#include main ( ) { int i,j; int arr[10]; int *a; a=arr; for ( i=0;i<10;i++) { printf ( "Enter the number %d : ",i+1); scanf ( "%d",&arr[i]); } printf ( "Before sorting:\n" ); for ( i=0; i<10 ; i++) printf ( " %d " , arr[i] ); printf ( "\n" ); a=arr; for ( i=0;i<10;i++) for ( j=0;j<10-i-1;j++) if ( *(arr+j) > *(arr+j+1)) swap(arr+j , arr+j+1); printf ( "

program to accept 10 numbers and print the total with use of pointer

2009-11-15T17:42:00.001+05:30

#include main ( ) { int i,total; int arr[10]; int *a; a = arr; for ( i=0;i<10;i++) { printf ( " Enter the number %d : ",i+1); scanf ( "%d",&arr[i]); } for ( i=0;i < 10 ; i++) { printf ( "%d---",*a); total = total + *a; a=a+1; } printf ( "\n Total = %d\n",total); }

Use the pointer with function to print the value and address of the array element

2009-11-15T17:38:00.003+05:30

#include main ( ) { int arr[4]={ 5 , 10 , 15 , 20 }; fun ( arr); } fun ( int *a) { int i ; for ( i = 0; i <=4;i++) { printf ( " value of arr[%d]=%d\n",i,*a); printf ( "address of arr[%d]=%u\n",i,a); a=a+1; } }

Use pointer to print the value and address of array elements

2009-11-15T17:37:00.002+05:30

#include main ( ) { int arr[4] = { 5 , 10 , 15 , 20 }; int i = 0; int *b; b = arr; /*we can also write b = &arr[0] */ for ( i = 0;i<=4;i++) { printf ( "value of arr[%d]=%d\n",i,*b); printf ( "address of arr[%d]=%u\n",i,b); b=b+1; } }

program to print the value and address of the element

2009-11-15T17:35:00.004+05:30

#include main ( ) { int arr[4] = { 5 , 10 , 15 , 20 }; int i = 0; for ( i=0;i<4;i++) { printf ( "value of arr[%d] = %d\n",i,arr[i]); printf ( " address of arr[%d] = %u\n",i,&arr[i] ); } }

Implementation of Pointers : Part 7

2009-11-15T17:34:00.000+05:30

#include main ( ) { int a = 5; int *b; int *fun( ); b = &a; printf ( " Before calling the function address of a = %u\n",b); b = fun( &b); printf ( " After calling the function value of b = %u\n",b); } int *fun(int **x ) { *x = *x + 1; return ( *x ); }

program to interchange the value of variables from call by reference

2009-11-15T17:32:00.000+05:30

#include main ( ) { int a = 5; int b = 8; printf ( " Before swapping a = %d , b = %d\n",a,b); swap ( &a,&b); printf ( "After calling swap function a = %d , b = %d\n",a,b); } swap ( p , q) int *p,*q; { int temp; temp = *p; *p = *q; *q = temp; printf ( " In swapping function p = %d , q = %d\n",*p,*q); }

program to interchange the value of two variable from call by value

2009-11-15T17:31:00.003+05:30

#include main ( ) { int a = 5; int b = 8; printf ( " Before swapping a = %d , b = %d\n",a,b); swap( a , b); printf ( " After calling swap function a = %d , b = %d\n",a,b); } swap( p , q) int p , q; { int temp; temp = p; p = q; q = temp; printf ( " In swapping function p = %d , q = %d\n",p,q); }

program to explain call by reference

2009-11-15T17:30:00.003+05:30

#include main ( ) { int a = 5; int b = 8; printf (" Before calling the function a and b are %d , %d\n",a,b); ref ( &a , &b); printf ( " After calling the function a and b are %d , %d\n",a,b); } ref ( p , q ) int *p,*q; { (*p)++; (*q)++; printf ( " In function changes are %d , %d\n" , *p,*q); }

program to explain call by value

2009-11-15T17:29:00.003+05:30

#include main ( ) { int a = 5; int b = 8; printf ( " Before calling the function a and b are %d , %d\n",a,b); value( a , b ); printf ( " After calling the a and b are %d , %d\n",a,b); } value ( p , q ) int p , q; { p++; q++; printf ( " In function changes are %d , %d\n", p , q); }

Implementation of Pointers : Part 6

2009-11-15T17:27:00.004+05:30

#include main ( ) { int a = 5; int *a1; char b = 'x'; char *b1; float c = 5.5; float *c1; a1 = &a; b1 = &b; c1 = &c; printf ( " address of a=value of a1= %u\n",a1); printf ( " address of b=value of b1 = %u\n",b1); printf ( " address of c =value of c1= %u\n",c1); a1++; b1++; c1++; printf ( " Now value of a1=%u\n",a1); printf ( " Now value of b1 = %u\n",b1); printf ( " Now value of c1 = %u

Program to understand the postfix, prefix, increment, decrement in the pointer variable

2009-11-15T17:27:00.000+05:30

#include main ( ) { int a = 5; int *b; b = &a; printf(" address of a = %u\n",b); printf(" value of b = %u\n",++b); printf(" value of b = %u\n",b++); printf(" value of b = %u\n",--b); printf(" value of b = %u\n",b--); printf(" value of b = %u\n",b); }

Implementation of Pointers : Part 5

2009-11-15T17:23:00.002+05:30

#include main ( ) { int a = 5; int *b; int **c; b = &a; c = &b; printf("value of a = %d\n",a); printf(" value of a = %d\n",*(&a)); printf(" value of a = %d\n",*b); printf(" value of a = %d\n",**c); printf(" value of b = address of a = %u\n",b); printf(" value of c = address of b = %u\n",c); printf(" address of a = %u\n",&a); printf(" address of a = %u\n",b); printf("

Implementation of Pointers : Part 4

2009-11-15T17:22:00.001+05:30

#include main ( ) { char a = 'p'; char *a1; int b = 5; int *b1; float c = 5.5; float *c1; a1 = &a; b1 = &b; c1 = &c; printf("value of a = %c\n",a); printf("value of a = %c\n",*(&a)); printf("value of a = %c\n",*a1); printf("value of b = %d\n",b); printf("value of b = %d\n",*(&b)); printf("value of b = %d\n",*b1); printf("value of c = %f\n",c); printf("value of c = %f\n",*(&c)); printf("

Implementation of Pointers : Part 3

2009-11-15T17:21:00.001+05:30

#include main ( ) { int a = 5; int *b; b = &a; printf("value of a = %d\n",a); printf("value of a = %d\n",*( &a)); printf("value of a = %d\n",*b); printf("address of a = %u\n",&a); printf("address of a =%u\n",b); printf("address of b = %u\n",&b); printf("value of b = address of a = %u",b); }

Implementation of Pointers : Part 2

2009-11-15T17:20:00.001+05:30

#include main ( ) { int a = 5; printf("value of a = %d\n",a); printf("address of a = %u\n",&a); printf("value at address %u = %d\n",&a,*(&a)); }

Implementation of Pointers : Part 1

2009-11-15T17:17:00.002+05:30

#include main ( ) { int a = 5; printf("value of a = %d\n",a); printf("address of a = %u\n",&a); }

Kruskals Algorithm

2009-08-18T15:35:00.001+05:30

PROGRAM FOR KRUSKAL ALGORITHM#includestruct edge{ int vs,vd,wt,used;}s[20];int g[20][20];void kruskal(int n);main(){ int n,i,j; printf("ENTER THE NO. OF VERTICES"); scanf("%d",&n); printf("ENTER THE WEIGHTED ADJACENCY MATRIX\n"); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&g[i][j]); printf("THE ADJACENCY MATRIX IS\n"); for(i=1;i<=n;i++) {

Dijkistras Algorithm Implementation in C

2009-08-18T15:29:00.002+05:30

DIJKISTRA'S SHORTEST PATH#includestruct edge{ int vs,vd,wt;}a[20];void dj(int);int g[20][20];main(){ int n,i,j; printf("ENTER THE NO. OF VERTICES "); scanf("%d",&n); printf("ENTER THE DIRECTED ADJACENCY MATRIX\n"); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&g[i][j]); printf("THE MATRIX IS")

BFS and DFS

2009-08-18T15:18:00.000+05:30

Breadth First Traversal and Depth First Traversal#includeint q[20],top=-1,front=-1,rear=-1,a[20][20],vis[20],stack[20];int delete();void add(int item);void bfs(int s,int n);void dfs(int s,int n);void push(int item);int pop();main(){ int n,i,s,ch,j; char c,dummy; printf("ENTER THE NUMBER VERTICES "); scanf("%d",&n); for(i=1;i<=n;i++) {

Quick Sort

2009-08-18T15:17:00.000+05:30

Program for Quick sort in C#includeint a[50],n,i;void quick_sort(int [],int,int);int main(){ printf("RANGE : "); scanf("%d",&n); printf("ELEMENTS \n"); for(i=0;i

Priority Queue

2009-08-18T15:11:00.000+05:30

Program to implement Priority queue in C#include#includevoid insert();void del();void display();struct node { int priority; int info; struct node *next; }*start,*q,*temp,*new;typedef struct node *N;int main(){ int ch; do { printf("\n[1] INSERTION\t[2] DELETION\t[3] DISPLAY [4] EXIT\t:"); scanf("%d",&ch);

Merge Sort

2009-08-18T15:07:00.000+05:30

Merge Sort Using C c-pgms.blogspot.com#includeint a[50],n,p=0;main(){ int i; printf("NO OF ELTS.\n"); scanf("%d",&n); printf("ENTER THE ELTS.:\n"); for(i=0;i

Infix Expression Evaluation

2009-08-18T15:04:00.000+05:30

Program for Infix Prefix and Infix to Postfix Conversionc-pgms.blogspot.com#include#include#include#define MAX 50#define T stk[top]char stk[MAX],po[MAX],in[MAX];int top=-1;struct list{ char data; struct list *L,*R;};typedef struct list *node;node nstk[MAX],root;int ntop=-1;node exptree();int eval(node);main(){ printf("\n\nENTER THE EXPRESSION IN INFIX FORM : ");

Binary Search

2009-08-18T14:57:00.000+05:30

Binary Search using C http://c-pgms.blogspot.com#include#define MAX 10int a[MAX];void sort(int);int search(int,int);main(){ int range,i,item; printf("Enter Range\t: "); scanf("%d",&range); printf("Enter Elements\t: "); for(i=0;i

Heap Sort

2009-08-18T14:50:00.002+05:30

/* Heap Sort Using C Done By : c-pgms.blogspot.com */#includemain(){ int n,i,a[10]; printf("ENTER THE NO.OF ELEMENTS\n"); scanf("%d",&n); printf("ENTER THE ELEMENTS\n"); for(i=0;i

Program Listing - Site Map

2009-04-30T20:57:00.014+05:30

Introductory Programs in C This section includes program for starters in C Hello World C Program. Less than, Greater than Logic. C Program to Print ASCII Value. C Program to Find Average of Two Numbers C Program to Check Equality of a Float Value and Integer Value. C Program to Find Squares of Numbers within a Given Range. C Program to Swap or Interchange two values. Working of If Else

Binary Search Tree

2009-04-27T10:27:00.000+05:30

/* PROGRAM TO IMPLEMENT BINARY SEARCH TREE IN C*/#includestruct BT{ int data; struct BT *right,*left;};void insert(struct BT ** ptr,int d){ if((*ptr)==NULL) { (*ptr)=(struct BT*)malloc(sizeof(struct BT)); (*ptr)->data=d; (*ptr)->left=(*ptr)->right=NULL; } else { if((*ptr)->data>d) insert(&((*ptr)->left),d); else insert(&((*ptr)->right),d); } return;}int search(

File Operations

2009-02-09T17:45:00.002+05:30

// File Operation// Program to store students data into a file which can be accessed later.This is the basic program to study file operations in c#include#define SIZE 10struct student{ char name[SIZE]; int roll; int tot; int m1,m2,m3;}s,temp[SIZE],t[SIZE],s1;main(){ int ch; FILE *fp; do { printf("\n\tMenu\n"); printf("\t[1] Insert\n"); printf(

Jordan Elimination

2008-12-17T10:42:00.001+05:30

#includevoid solution(int a[][],int n);int main(){ int a[20][20],n,i,j,k,l; printf("\nENTER THE NUMBER OF VARIABLES:\n"); scanf("%d",&n); for(i=0;i

Merge Sort

2008-12-12T20:36:00.002+05:30

#includeint a[50],n,p=0;main(){ int i; printf("Enter the no.of elements to be sorted \n"); scanf("%d",&n); printf("Enter the elements to be sorted into the array:\n"); for(i=0;i

Various Linked List Operations

2008-12-12T20:32:00.004+05:30

#include#includevoid ins_beg();void ins_end();void ins_loc();void del_beg();void del_end();void del_loc();void display();void count();struct node{int info;int *next;}*start;typedef struct node N;main(){int ch;while(ch!=8){printf("\n\t\t\t\t\tMENU \n1.Insert at the begining \n2.Insert at the end \n3.Insert at the specified location \n4.Delete from the beginin \n5.Delete from the

Kruskals Algorithm

2008-12-12T20:28:00.001+05:30

#includestruct edge{ int vs,vd,wt,used;}s[20];int g[20][20];void kruskal(int n);main(){ int n,i,j; printf("ENTER THE NO. OF VERTICES"); scanf("%d",&n); printf("ENTER THE WEIGHTED ADJACENCY MATRIX\n"); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&g[i][j]); printf("THE ADJACENCY MATRIX IS\n"); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) printf(" %d ",g[i][j]); printf("\n"); } kruskal(n

Infix and Postfix Expression Evaluation using Expression Tree

2008-12-12T20:25:00.001+05:30

#includestruct NODE{ char data; struct NODE *lchild; struct NODE *rchild;};typedef struct NODE *node;node exptree(char[]);void push_cha(node);void push_op(char);node pop_cha();char pop_op();void inorder(node);void preorder(node);void postorder(node);int prec(char);node create(){ return((node)malloc(sizeof(node)));}node newnode=NULL,root,temp,nstack[50];int optop=-1,ntop=-1,p,i,

Heap Sort

2008-12-12T20:20:00.001+05:30

#includemain(){ int n,i,a[10]; printf("ENTER THE NO.OF ELEMENTS\n"); scanf("%d",&n); printf("ENTER THE ELEMENTS\n"); for(i=0;i0) { par=(loc-1)/2; if(b[loc]>b[par]) { temp=b[loc]; b[loc]=b[par]; b[par]=temp; } loc=par; } }printf("HEAP

Inverse of a Matrix in C

2008-12-01T12:58:00.004+05:30

#include#includefloat detrm(float[][],float);void cofact(float[][],float);void trans(float[][],float[][],float);main(){ float a[25][25],k,d; int i,j; printf("ENTER THE ORDER OF THE MATRIX:\n"); scanf("%f",&k); printf("ENTER THE ELEMENTS OF THE MATRIX:\n"); for(i=0;i

Matrix Multiplication

2008-12-01T12:56:00.003+05:30

#include#include#define MAX 25int main(){ int matrix_1[MAX][MAX],matrix_2[MAX][MAX],product_matrix[MAX][MAX]; int i,j,k,row_1,column_1,row_2,column_2; printf("Enter The no of rows & columns First Matrix\n"); scanf("%d%d",&row_1,&column_1); printf("Enter the Number of rows & columns of Second Matrix\n"); scanf("%d%d",&row_2,&column_2); if(column_1!=row_1) printf("Multiplication

Matrix Multiplication in C using function

2008-11-17T16:00:00.002+05:30

#includevoid matmul(int[][],int[][],int,int,int,int);main(){ int matrix_1[20][20],matrix_2[20][20],i,j,r1,r2,c1,c2; printf("Enter the number of rows and columns of first matrix :\t"); scanf("%d%d",&r1,&c1); printf("Enter the number of rows and columns of second matrix :\t"); scanf("%d%d",&r2,&c2); if(c1==r2) { printf("Enter the elements of first matrix :\n"); for(i=0;i

Upper and Lower

2008-11-17T15:52:00.000+05:30

int main(){ int lower,upper; printf("enter the limits\n"); scanf("%d%d,&lower,&upper); if(lower>upper) printf("NOT POSSIBLE"); else while(lower<=upper) { lower++; printf("%d,%d",lower,upper); }}

Number of dates to years months and days

2008-11-17T15:50:00.000+05:30

int main(){ int n,years,months,days; printf("enter num_days\n"); scanf("%d",&n); years=n/360; days=((n%360)%30); months=((n%360)/30); printf("%d,%d,%d",years,months,days);}

Swapping in C

2008-11-17T15:46:00.001+05:30

int main(){ int temp,num1 = 2,num2 = 3; temp=num1; num1=num2; num2=temp; printf("num1=%d,num2=%d\n",num1,num2);}

Program to find factorial of a number

2008-11-17T15:43:00.000+05:30

int main(){ int num,i=1,fact=1; printf("ENTER THE NUMBER"); scanf("%d",&num); while(i<=num) { fact=fact*i; i++; } printf("%d",fact);}

Change Case in C

2008-11-17T15:38:00.000+05:30

/*PROGRAM TO CHANGE THE CASE(LOWER-UPPER/UPPER-LOWER)OF A CHARACTER ENTERD FROM THE KEYBOARD*/int main(){ char c; c=getchar(); if(c>65&&c<90) { c=c+32; printf("%c",c); } else if(c>=97&&c<=122) { c=c-32; printf("%c",c); }}

String Permutation Using Recursion

2008-10-31T12:58:00.001+05:30

#include#includevoid permute(char * , int , int );char temp,n[20];int len;main(){ printf("ENTER THE STRING\n"); scanf("%s",n); len=strlen(n); permute(n,0,len);}void permute(char *n,const int start, int l){ int i,j; for(i=start;i

String Permutation

2008-10-29T13:05:00.001+05:30

#include#include#includevoid perm(char * , int , int );char temp,str[20];int l;main(){ printf("enter the string : "); scanf("%s",str); l=strlen(str); perm(str,0,l);}void perm(char *str,const int strt, int len){ int i,j; for(i=strt;i

Lexicographic sorting in c

2008-10-29T12:57:00.004+05:30

#include#includevoid lexi(char[][],int);main(){ char n[20][20]; int i=0,item; printf("ENTER THE NUMBER OF ITEMS TO BE SORTED\n"); scanf("%d",&item); printf("ENTER THE ITEMS TO BE SORTED\n"); while(i

Substring search and deletion

2008-10-28T17:13:00.001+05:30

#include#include#define SIZE 20int search(char [],char []);char* delete(char*,char*,int);int main(){ int p=0,i=0,pos=0,s=0,po=0; char a[SIZE],b[SIZE],d[SIZE],c[SIZE]; printf("enter the string\n"); gets(a); printf("enter the sub string\n"); gets(b); strcpy(d,a); while(p!=-1) { p=search(d,b); if(s

Palindrome or not

2008-10-28T17:12:00.002+05:30

#include#includevoid palindrome(char[],int);main(){ int f=0,len,i,j; char str[20]; printf("ENTER THE STRING\n"); gets(str); len=strlen(str); palindrome(str,len);}void palindrome(char n[],int l){ int i,j,f=0; for(i=0,j=l-1;i

Open Hashing Modular Technique

2008-10-23T22:35:00.001+05:30

/*Program to perform searching operation using Open hashing technique (modular technique)Done By : c-pgms.blogspot.com */#includevoid insert();void display();void search();void delete();struct node{ int info; int *next;}*start[10];typedef struct node N;int i,g,key;main(){ int ch; do { p1: printf("\n\t\t\t\t\tMENU \n1.Insert \n2.Search \n3.Delete \n4.Display \n5.Exit"); scanf("%d",&ch); switch

Closed Hashing Modular Technique

2008-10-23T22:32:00.004+05:30

/*Program to do searching using Closed Hashing (modular technique) Programmer :: c-pgms.blogspot.com*/#includeint ar[10],i,g=0,key;void insert();void search();void delete();void display();main(){ int ch; for(i=0;i<10;i++) //to initialise every element as '-1' ar[i]=-1; do{p1: printf("\n\t\t\t\t\tMENU \n1.Insert \n2.Search \n3.Delete \n4.Display \n5.Exit"); scanf("%d",&ch);

Program to find a number prime or not

2008-10-16T12:56:00.000+05:30

#includeint prime_or_not(int);int main(){ int number,re; printf("Enter the number : "); scanf("%d",&number); re=prime_or_not(number); if(re==1) printf("%d is not Prime\n",number); else if(re==0) printf("%d is Prime\n",number); else printf("It is neither prime nor composite\n");}int prime_or_not(int num){ int i; if(num==0) return 1; if(num==1) return -1; for(i=2;ilt;=num/2;i++) {

Taylors Series for Sin, Cos and Exponential

2008-10-06T14:28:00.001+05:30

#include#include#define PI 3.1415float exp_x(int,int);double sin_x(int,int);double cos_x(int,int);int fact(int);int main(){ int choice,x,n; do { printf("\nMenu\n[1] e^x)\n[2] Sin(x)\n[3] Cos(x)\n[4] Exit\n"); scanf("%d",&choice); switch(choice) { case 1: // to find exponential value printf("e^x\nEnter x and n:\t"); scanf("%d %d",&x,&n); printf("e^%d(%d) = %f\n",x,n,

implentation of queue using arrays

2008-09-28T22:55:00.000+05:30

/* Implentation of queue using arrays */# include # define SIZE 10int arr[SIZE], front = -1, rear = -1, i ;void enqueue() ;void dequeue() ;void display() ;int main(){ int ch ; do { printf("\n[1].ENQUEUE [2].DEQUEUE [3].Display [4].Exit\n") ; printf("Enter your choice [1-4] : ") ; scanf("%d", &ch) ; switch(ch) { case 1 : enqueue() ; break ; case 2 : dequeue() ; break

Floyd Warshalls Algorithm

2008-09-28T22:43:00.003+05:30

/* FLOYD WARSHALL'S ALGORITHM *//* author : c-pgms.blogspot.com */#include#define inf 9999int min(int a,int b);main(){ int i,j,n,k,a[20][20],p[20][20],t; printf("ENTER THE NO. OF VERTICES "); scanf("%d",&n); printf("ENTER THE WEIGHTED ADJACENCY MATRIX"); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&a[i][j]); for(i=1;i<=n;i++) for(j=1;j<=n;j++) { if(a[i][j]==0) p[i][j]=inf

BFS and DFS

2008-09-28T22:40:00.001+05:30

/* B.F.S AND D.F.S *//* done by : c-pgms.blogspot.com */#includeint q[20],top=-1,front=-1,rear=-1,a[20][20],vis[20],stack[20];int delete();void add(int item);void bfs(int s,int n);void dfs(int s,int n);void push(int item);int pop();main(){ int n,i,s,ch,j; char c,dummy; printf("ENTER THE NUMBER VERTICES "); scanf("%d",&n); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { printf("

infix expression evaluation

2008-09-28T22:33:00.003+05:30

/*Program to create an expression tree and perform the expression evaluation of an infix expression. done by : c-pgms.blogspot.com*/#includevoid check(char);void push(char);struct node{ char info; struct node *r,*l;}temp,*operator[10],*operand[10];typedef struct node N;int p,top1=0,top2=0;main(){ char exp[20]; printf("\nENter the expression :: "); gets(exp); for(i=0;exp[i]!='\0'

Various Base Conversions - Binary to Decimal, Decimal to Binary, Binary to Hexadecimal,Hexadecimal to Binary, Binary to Octal, Octal to Binary

2008-08-22T13:49:00.006+05:30

/******************************************* Various Base Conversions ********** Done By : C-PGMS.BLOGSPOT.COM******************************************/#include#include#define SIZE 20int binary_to_decimal(int);int decimal_to_binary(int);void binary_to_hexa(int);int hexa_to_binary(char []);void binary_to_octal(int);void octal_to_binary(int);int main(){ int choice=0,number=0;

Program to find Mean,Median,and Mode

2008-08-22T13:45:00.005+05:30

/********************************************************************** Program to find Mean,Median,and Mode ***********************************************************************/#define SIZE 100#includefloat mean_function(float[],int);float median_function(float[],int);float mode_function(float[],int);int main(){ int i,n,choice; float array[SIZE],mean,median,mode; printf("Enter No

Program to find HCF and LCM

2008-08-22T13:41:00.004+05:30

/********************************************************************** Program to find HCF and LCM ***********************************************************************/#define SIZE 100#include int hcf_function(int,int);int lcm_function(int,int);int main(){ int array[SIZE],n,i,choice,lcm,hcf; printf("Enter No of Elements\n"); scanf("%d",&n); printf("Enter

implementation of stack using array

2008-08-05T15:57:00.005+05:30

#includevoid push(int);int pop(void);void display(void);int main(){ int choice=0,val=0; do { printf("\n\t1.Push 2.Pop 3.Display 4.Exit\n\tSelect Your Choice : "); scanf("%d",&choice); switch(choice) { case 1: printf("\tElement to be Pushed : "); scanf("%d",&val); push(val); break;

queue operations using linked list

2008-04-10T16:26:00.010+05:30

/*queue operations using linked list*/#include#include#define MAXSIZE 10void insertion();void deletion();void display();struct node{int info;struct node *link;}*new,*temp,*p,*front=NULL,*rear=NULL;typedef struct node N;main(){int ch;do{ printf("\n\t\t\tLinked queue"); printf("\n 1.Insertion"); printf("\n 2.Deletion"); printf("\n 3.Display"); printf("\n 4.Exit"); printf("\

Implementation of stack using linked list

2008-04-10T16:24:00.011+05:30

/*Implementation of stack using linked list*/#include#include#define maxsize 10void push();void pop();void display();struct node{int info;struct node *link;}*start=NULL, *new,*temp,*p;typedef struct node N;main(){int ch,a;do{ printf("\t\t\tLinked stack"); printf("\n 1.Push"); printf("\n 2.Pop"); printf("\n 3.Display"); printf("\n 4.Exit"); printf("\n Enter your choice : ");

Number of words,lines,characters

2008-04-08T17:15:00.004+05:30

#includeint main(){int c,w=0,ch=0,l=0;while((c=getchar())!=-1){++ch;if (c=='\n'){++l;++w;}if (c==' ')++w;}printf("characters = %d, words = %d, lines = %d",ch,w,l);}Keys : Number of words lines characters, no of lines, number of lines, number of words, number of characters, find number of words in c, c program to find number of words, read one line in c, read a line c.

Chess Board

2008-03-24T18:36:00.011+05:30

#include/**********************************************************************************A chess board has coordinates (1,1) to (8,8). A Bishop is placed in one of the squares (m,n). Assuming the board to be empty, find the number of possible moves it can make on the board.eg:Input: 1, 1Output: 7**********************************************************************************/int main

Sum of 10 numbers

2008-02-14T17:56:00.011+05:30

#includeint main(){int sum=1,b=2;while(b<=10){ sum=sum+b; b=b+1;}printf("sum=%d\n",sum);}-------------------------------------------------------Keys : basic c programming, c program code, C Programming, c programming arrays, c programming char, c programming functions, c programming static, compiling c program, hello world c program

Bitwise Operation

2008-02-14T17:56:00.010+05:30

#includeint main(){int n,i=0;scanf("%d",&n);while(n!=0){ if((1&n)!=0) i++; n>>1;}printf("%d",i);}

No of lines....

2008-02-14T17:54:00.012+05:30

#includeint main(){int c=0,line=0; while (c!=-1) { c=getchar(); if (c=='\n') line++; }printf("no of lines = %d\n",line);}Keys : c program language, C Programming, c programming course, c programming define, c programming forum, c programming print, c programming test, programs in c, windows c programming

Days

2008-02-14T17:54:00.010+05:30

#includeint main(){int d;printf("Enter days\n");scanf("%d",&d);printf("%d years,%d months,%d days\n",d/365,(d%365)/30,(d%365)%30);} Keys : C Programming, c programming and, c programming class, c programming double, c programming extern, c programming scanf, c programming syntax, pic c programming, problem solving

Programming in C

c-pgms.blogspot.com Moved

Decimal to Binary Without using Array

path matrix by Warshall's algorithm

traversing a graph through BFS and DFS

program for topological sorting

minimum spanning tree from Prim's algorithm

path matrix by powers of adjacency matrix

Warshall's algorithm to find shoretst path matrix

insertion and deletion of nodes and edges in a graph using adjacency list

minimum spanning tree from Kruskal's algorithm

shortest path between two node in graph using Djikstra algorithm

Program for creation of adjacency matrix

addition and deletion of nodes and edges in a graph

Grade of Students

Program to accept name , class and marks of 10 students with the use of structure with array of pointer and also print them

program to use a pointer as a member of structure and print the value of members without use of arrow operator

program to use a pointer as a member of structure and print the value of members

program to pass the address of the structure variable

Program to assign the value to member of structure with the use of structure pointer

Program to understand pointer to structure

program to understand the use of realloc function

program to enter the 5 numbers and print them using malloc( )

program to understand the sizeof operator

program to print the address and string using array of pointer to string

program to print the address and character of the string with using pointer

program to print the strings of the two-dimensional character array

program to print the character of any string and also address of each character

program for understanding array of pointers

program for understanding the concept of array of pointers

program to print the elements of 3-D array

Program to print the elements of the array

program to print the values and address of the array element

program to accept 10 numbers and sort them with use of pointer

program to accept 10 numbers and print the total with use of pointer

Use the pointer with function to print the value and address of the array element

Use pointer to print the value and address of array elements

program to print the value and address of the element

Implementation of Pointers : Part 7

program to interchange the value of variables from call by reference

program to interchange the value of two variable from call by value

program to explain call by reference

program to explain call by value

Implementation of Pointers : Part 6

Program to understand the postfix, prefix, increment, decrement in the pointer variable

Implementation of Pointers : Part 5

Implementation of Pointers : Part 4

Implementation of Pointers : Part 3

Implementation of Pointers : Part 2

Implementation of Pointers : Part 1

Kruskals Algorithm

Dijkistras Algorithm Implementation in C

BFS and DFS

Quick Sort

Priority Queue

Merge Sort

Infix Expression Evaluation

Binary Search

Heap Sort

Program Listing - Site Map

Binary Search Tree

File Operations

Jordan Elimination

Merge Sort

Various Linked List Operations

Kruskals Algorithm

Infix and Postfix Expression Evaluation using Expression Tree

Heap Sort

Inverse of a Matrix in C

Matrix Multiplication

Matrix Multiplication in C using function

Upper and Lower

Number of dates to years months and days

Swapping in C

Program to find factorial of a number

Change Case in C

String Permutation Using Recursion

String Permutation

Lexicographic sorting in c

Substring search and deletion