programming language codes

/*Gauss Elimination */ # include <stdio.h> # include <conio.h> # include <math.h> # define MAX 10 void main() { int i,j,n,k; float mat[MAX][MAX],x[MAX],temp,pivot,sum=0; clrscr(); printf("\t\t\t GAUSS ELIMINITION METHOD\n"); printf("-------------------------------------------------------------------\n"); printf("Enter No of Equtions : "); scanf("%d",&n); printf("Enter Coefficients of Eqution \n"); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%f",&mat[i][j]); printf("Enter Constant value\n"); for(i=1;i<=n;i++) { scanf("%f",&mat[i][n+1]); x[i]=mat[i][n+1]; } for(i=2;i<=n;i++) { for(j=i;j<=n;j++) { pivot=mat[j][i-1]/mat[i-1][i-1]; for(k=i-1;k<=n+1;k++) mat[j][k]=mat[j][k]-pivot*mat[i-1][k]; } } printf("Eliminated matrix as :- \n"); for(i=1;i<=n;i++) { for(j=1;j<=n+1;j++) printf("\t%.2f",mat[i][j]); p...

click here  to see the facebook page of this blog. click on LIKE................. :)

/*Trapezoidal rule */ # include <stdio.h> # include <conio.h> # define MAX 20 void main() { int i,j,n; float x[MAX],y[MAX],sum=0,h,res; clrscr(); printf("Solution using Trapezoidal rule \n"); printf("Enter Number of data points : "); scanf("%d",&n); printf("Enter value of table value set by set\n"); for(i=1;i<=n;i++) { printf("Enter value of x[%d] and y[%d] ",i,i); scanf("%f%f",&x[i],&y[i]); } h=x[2]-x[1]; printf("\nInterval :=%f\n",h); sum=y[1]+y[n]; for(i=2;i<n;i++) sum=sum+y[i]*2; res=sum*(h/2); printf ("Integral from %3.2f to %3.2f is : = %f",x[1],x[n],res); getch(); } OUTPUT :- Solution using Trapezoidal rule Enter Number of data points : 6 Enter value of table value set by set Enter value of x[1] and y[1] 7.47 1.93 Enter value of x[2] and y[2] 7.48 1.95 Enter value of x[3] and y[3] 7.49 1.98 Enter value of x[4] and y[4] 7.50 2.01 Ente...

/*Simpson 1/3 Rule */ # include <stdio.h> # include <conio.h> # define MAX 20 void main() { int i,j,n; float x[MAX],y[MAX],sum=0,h,res; clrscr(); printf("Solution of 1/(1+x)dx using Simpson's 1/3 rule \n"); printf("Enter Number of data points : "); scanf("%d",&n); printf("Enter value of table value set by set\n"); for(i=1;i<=n;i++) { scanf("%f",&x[i]); y[i]=1/(x[i]+1); } printf("X \t\t Y\n"); for(i=1;i<=n;i++) printf("%f\t%f\n",x[i],y[i]); h=x[2]-x[1]; printf("\nSegment Interval `h':=0.25\n"); sum=sum+y[1]+y[n]; for(i=2;i<n;i++) { if(i%2==0) sum=sum+y[i]*4; else sum=sum+y[i]*2; } res=sum*(0.25/3); printf ("Integral from %3.2f to %3.2f is : = %f",x[1],x[n],res); getch(); } OUTPUT Solution of 1/(1+x)dx using Simpson's 1/3 rule Enter Number of data points : 5 Enter value of table value for x column 0 .25 .50 .75 1 X Y ...

/*Simpson 3/8 rule */ # include <stdio.h> # include <conio.h> # define MAX 20 void main() { int j,n=0; float x[MAX],y[MAX],sum=0,h,res,lb,ub,i; clrscr(); printf("Solution of 1/(1+x)dx using Simpson's 3/8 rule \n"); printf ("Enter initial value : "); scanf("%f",&lb); printf("Enter final value : "); scanf("%f",&ub); printf("Enter no. of Subinterval : "); scanf("%f",&h); h=(ub-lb)/h; for(i=lb;i<=ub;i=i+h) { x[n]=i; y[n]=1/(1+x[n]); n++; } printf("No.\t X\t\tY=1/(1+x)\n"); printf("---------------------------------------\n"); sum=y[0]+y[n-1]; for(j=0;j<n;j++) printf("%d\t%f\t%f\n",j,x[j],y[j]); printf("---------------------------------------\n"); for(j=1;j<n-1;j++) { if(j%3==0) sum=sum+y[j]*2; else sum=sum+y[j]*3; } res=((3*h)/8)*sum; printf("\nIntegral from %f to %f when h = %f is = %f",x[0],x[n-1...

/* Runge-kutta method of 4th order to solve 10*dy/dx=(x*x)+(y*y)*/ # include <stdio.h> # include <conio.h> void main() { int c=0; float x,y0,xp,h,i,y1,m1,m2,m3,m4; float f(float,float); clrscr(); printf("Solution by Runge kutta 2nd order Method\n"); printf("Enter initial Boundry condition x,y : "); scanf("%f%f",&x,&y0); printf("Enter Value of X at which Y is required : "); scanf("%f",&xp); printf("Enter Interval ,h : "); scanf("%f",&h); printf(" No. X\t m1 \t m2\t m3 \t m4 \t Y\n"); printf("-------------------------------------------------------------------\n"); for(i=x;i<=xp;i=i+h) { c++; m1=h*f(i,y0); m2=h*f(i+(h/2),y0+(m1/2)); m3=h*f(i+(h/2),y0+(m2/2)); m4=h*f(i+h,y0+m3); y1=y0+((m1+2*m2+2*m3+m4)/6); printf("%2d %5.6f %5.6f %5.6f %5.6f %5.6f %5.6f\n",c,i,m1,m2,m3,m4,y1); y0=y1; } getch(); } ...

#include<stdio.h> #include<conio.h> #include<alloc.h> #define null 0 void main() { struct dnode { struct dnode *prev; int data; struct dnode *next; } *temp,*start,*end,*n; int i; char c; clrscr(); start=end=null; for(i=0;i<=1;i++) { if(start==null) { printf("enter data for the node:"); scanf("%d",&temp->data); temp->next=null; temp->prev=null; start=temp; end=temp; } else { while(1) { printf("are you want to add another node(y/Y):"); fflush(stdin); scanf("%c",&c); if(c=='y'||c=='Y') { n=(struct dnode*)malloc(sizeof(struct dnode)); printf("enter data for the node:"); scanf("%d",&n->data); n->next=null; ...

#include<stdio.h> #include<conio.h> #include<alloc.h> #define null 0 void main() { struct dnode { struct dnode *prev; int data; struct dnode *next; } *temp,*start,*end,*n; int i; char c; clrscr(); start=end=null; for(i=0;i<=1;i++) { if(start==null) { printf("enter data for the node:"); scanf("%d",&temp->data); temp->next=null; temp->prev=null; start=temp; end=temp; } else { while(1) { printf("are you want to add another node(y/Y):"); fflush(stdin); scanf("%c",&c); if(c=='y'||c=='Y') { n=(struct dnode*)malloc(sizeof(struct dnode)); printf("enter data for the node:"); scanf("%d",&n->data); n->next=null; ...

#include<stdio.h> #include<conio.h> #include<stdlib.h> #define NULL 0 void main() { struct poly { int coff; int expo; struct poly *link; }*temp1,*start1,*temp2,*start2,*start3,*temp3; int n,i,z=1,num; char c; clrscr(); start1=NULL; printf("\tPOLYNOMIAL CREATION IN LINK LIST AND SUBTRACTION\n\n"); while(1) { if(start1==NULL) { temp1=(struct poly*)malloc(sizeof(struct poly)); printf("Enter Coefficient and Exponent for Node %d\n",z); scanf("%d %d",&temp1->coff,&temp1->expo); start1=temp1; temp1->link=NULL; } else { temp1->link=(struct poly*)malloc(sizeof(struct poly)); temp1=temp1->link; printf("Enter Coefficient and exponent for Node %d\n",z); scanf("%d %d",&temp1->coff,&temp1->expo); } z++; printf("Do you want to create another node\n"); fflush(stdin); scanf("%c",&c); if(c!='y') { temp1->link=NULL; break; } } ...

#include<stdio.h> #include<conio.h> #include<stdlib.h> #define NULL 0 void main() { struct poly { int coff; int expo; struct poly *link; }*temp1,*start1,*temp2,*start2,*start3,*temp3; int n,i,z=1,num; char c; clrscr(); start1=NULL; printf("\tPOLYNOMIAL CREATION IN LINK LIST AND ADDITION\n\n"); while(1) { if(start1==NULL) { temp1=(struct poly*)malloc(sizeof(struct poly)); printf("Enter Coefficient and Exponent for Node %d\n",z); scanf("%d %d",&temp1->coff,&temp1->expo); start1=temp1; temp1->link=NULL; } else { temp1->link=(struct poly*)malloc(sizeof(struct poly)); temp1=temp1->link; printf("Enter Coefficient and exponent for Node %d\n",z); scanf("%d %d",&temp1->coff,&temp1->expo); } z++; printf("Do you want to create another node\n...

#include<stdio.h> #include<conio.h> #include<stdlib.h> #define NULL 0 void main()  {   struct poly    {     int coff;     int expo;     struct poly *link;    }*temp,*start,*n1,*prev;   int n,i,z=1,num;   char c;   clrscr();   start=NULL;   n1=NULL;   printf("\tPOLYNOMIAL CREATION IN LINK LIST AND TRAVERSAL\n\n");   while(1)    {     if(start==NULL)      {                 temp=(struct poly*)malloc(sizeof(struct poly));                 printf("Enter Coefficient and exponent for Node %d\n",z);                 scanf("%d %d",&temp->coff,&...

dial 54444 from ur idea mobile to get 1 month free caller tune................ njoy..............................

 Now u can get all the information's to get just dial 180041999999(toll free) and say your needs then you will receive an sms relevant to your needs. Eg: if you want meaning for a particular word just call and say the word the relevant meaning will be sent through sms

Sim locked? need to unlock it? just type your mobile number and sent to 785 immediately your will receive your PUK code and PIN code directly into your inbox., Enjoy.,!!

Friends here is the new trick for airtel miss call alert... Just Type OFFER and send it to 54321 You will receive a message from Airtel Thank you for subscribing to MCA service. Your activation request is under process You will receive a confirmation SMS shortly. After some time you will get a activation message .

Below are the steps how to change the XP password using command -Start-> Run -Open Cmd -Type "net user " -ENTER -Ask for New Password -Give Password Which you Want -Twice ENTER  Thats it Your password gets changed Try and post your comments here........................

//Program for Circular Queue implementation through Array #include <stdio.h> #include<conio.h> #define MAXSIZE 5 int cq[MAXSIZE]={0}; int front,rear; void main() { void add(int); void del(); void display(); int ch,i,num; front = -1; rear = -1; clrscr(); printf("\nProgram for Circular Queue demonstration through array"); while(1) { printf("\n\nMAIN MENU\n1.INSERTION\n2.DELETION\n3.DISPLAY\n4.EXIT"); printf("\n\nENTER YOUR CHOICE : "); scanf("%d",&ch); switch(ch) { case 1: printf("\n\nENTER THE QUEUE ELEMENT : "); scanf("%d",&num); add(num); break; case 2: del(); break; case 3:    display();     break; case 4:     exit(0); default: printf("\n\nInvalid Choice . "); } } } void add(int item) { if(front ==(rear+1)%MAXSIZE) { printf("\n\nCIRCULAR QUEUE IS OVERFLOW"); } else { ...

/*   Program to implement NEWTON'S BACKWARD METHOD OF INTEROLATION.       ---------------------------------------- */ #include<stdio.h> #include<conio.h> #include<math.h> #include<process.h> #include<conio.h> void main() { int n;                          // no. of terms. int i,j,k;                      // Loop variables float mx[10];                   // 'X' array limit 9 float my[10];                   // 'Y' array limit 9 float x;                        // User Query for what value of X float x0=0;                     // float y0;                   ...

/*   Program to implement NEWTON'S FORWARD METHOD OF INTEROLATION.       -------------------------------------- */ #include<stdio.h> #include<conio.h> #include<math.h> #include<process.h> #include<conio.h> void main() { int n;                          // no. of terms. int i,j;                        // Loop variables float ax[10];                   // 'X' array limit 9 float ay[10];                   // 'Y' array limit 9 float x;                        // User Query for what value of X float y=0;                      // Calculated value for coressponding X. float h;       ...

/*   Program to Implement REGULAR FALSI (FALSE POSITION) METHOD.   EQN -> 3*x + sin(x) - exp(x) = 0. */ #include<stdio.h> #include<conio.h> #include<math.h> #include<string.h> #include<process.h> // Formulae Declaration #define EPS 0.00005 #define f(x)  3*x + sin(x) - exp(x) int n; void FAL_POS(); void main() { clrscr(); printf("\n Solution by ITERATION METHOD "); printf("\n\n Equation is -> x*x*x - 2*x + 1 = 0\n"); printf("\n Enter the no. of iterations "); scanf("%d",&n); FAL_POS(); getch(); } void FAL_POS()  {  long float x1,x2,x0;  float f1,f2,f0;  int itr=n,i;  for(x1=0.0;;)     {     f1=f(x1);     if(f1>0)       break;     else       x1=x1+0.1;     }  x0=x1-0.1;  f0=f(x0);  printf("\n\t\t----------------------------------------------------");  printf("\n ...

/*   Program to Implement NEWTON RAPHSON METHOD to solve eqn.   EQN -> 3*x - cos(x) - 1 = 0. */ #include<stdio.h> #include<conio.h> #include<math.h> #include<string.h> #include<process.h> // Formulae Declaration #define f(x)   3*x - cos(x) - 1 #define df(x)  3+sin(x) int n; void NEW_RAP(); void main() { clrscr(); printf("\n Solution by NEWTON RAPHSON METHOD "); printf("\n\n Equation is -> 3*x - cos(x) - 1 = 0\n"); printf("\n Enter the no. of iterations "); scanf("%d",&n); NEW_RAP(); getch(); } void NEW_RAP()  {  float x1,x0;  float f1,f0;  float df0;  int i=1,itr;  float EPS,error;  /* finding an approximate Root of a given equation, having +ve value*/  for(x1=0.0;;x1+=0.01)     {     f1=f(x1);     if(f1>0)       break;     }  itr=n;  x0=x1-0.01;  f0=f(x0);  print...

/*   Program to implement LANGRANGE'S INTERPOLATION FORMULA in C.       ---------------------------------------------- */ #include<stdio.h> #include<conio.h> #include<math.h> #include<process.h> #include<conio.h> void main() { int n;                          // no. of terms. int i,j;                        // Loop variables float ax[100];                   // 'X' array limit 9 float ay[100];                   // 'Y' array limit 9 float x=0;                        // User Query for what value of X float y=0;                      // Calculated value for coressponding X. flo...

/*   Program to Implement ITERATION METHOD.   EQN -> x*x*x - 2*x + 1 = 0. */ #include<stdio.h> #include<conio.h> #include<math.h> #define EPS 0.00005 #define F(x) (x*x*x + 1)/2 #define f(x)  x*x*x - 2*x + 1 int n; void iter(); void main() { clrscr(); printf("\n Solution by ITERATION METHOD "); printf("\n\n Equation is -> x*x*x - 2*x + 1 = 0\n"); printf("\n Enter the no. of iterations "); scanf("%d",&n); iter(); getch(); } void iter()  {  int i=0;  float x1,x2,x0;  float f1,f2,f0,error;  for(x1=1; ;x1++)     {     f1=f(x1);     if(f1>0)       break;     }  for(x0=x1-1; ;x0--)     {     f0=f(x0);     if(f0<0)       break;     }  x2=(x0+x1)/2;  printf("\n\n\t\t The 1 approximatrion to the root is : %f",x2);  for(;i<n-1;i++)    ...

/*   Program to implement GAUSS' FORWARD INTERPOLATION FORMULA.       --------------------------------- */ #include<stdio.h> #include<conio.h> #include<math.h> #include<process.h> #include<conio.h> void main() { int n;                          // no. of terms. int i,j;                        // Loop variables float ax[10];                   // 'X' array limit 9 float ay[10];                   // 'Y' array limit 9 float x;                        // User Query for what value of X float nr,dr; float y=0;                      // Calculated value for coressponding X. float h;     ...

/*   Program to implement GAUSS' BACKWARD INTERPOLATION FORMULA */ #include<stdio.h> #include<conio.h> #include<math.h> #include<process.h> #include<conio.h> void main() { int n;                          // no. of terms. int i,j;                        // Loop variables float ax[10];                   // 'X' array limit 9 float ay[10];                   // 'Y' array limit 9 float x;                        // User Query for what value of X float y=0;                      // Calculated value for coressponding X. float h;                        // Calc....

/*   Program to Implement BISECTION METHOD.   EQN -> x*log10(x) - 1.2 */ #include<stdio.h> #include<conio.h> #include<math.h> #define F(x)  (x)*log10(x)-1.2 int n; float root=1; void bisect(); void main() { clrscr(); printf("\n Solution by BISECTION METHOD "); printf("\n Equation is -> x*log(x) - 1.2 = 0\n"); printf("\n Enter the no. of iterations "); scanf("%d",&n); bisect(); getch(); } void bisect()  {  int count;  float x1,x2,x0;  float f1,f2,f0;  // Finding x2  for(x2=1; ;x2++)     {     f2=F(x2);     if(f2>0)       {       break;       }     }  printf("\n x2 = %d ",x2);  // Finding x1  for(x1=x2-1; ;x1--)     {     f1=F(x1);     if(f1<0)       {       break;       }     } ...

Tips nd tricks section added soon. Pls give ur comment nd suggestion to improve this blog.

#include<stdio.h> #include<conio.h> #include<math.h> #include<process.h> #include<conio.h> void main() { int n;                          // no. of terms. int i,j;                        // Loop variables float ax[10];                   // 'X' array limit 9 float ay[10];                   // 'Y' array limit 9 float x;                        // User Query for what value of X float nr,dr; float y=0;                      // Calculated value for coressponding X. float h;                        // Calc. Section float p,q;           ...

# include <stdio.h> # include <conio.h> # include <math.h> # define MAXIT 50 # define EPS .000001 void main() { float a[10][10],b[10],x[10],sum,x0[10]; int i,j,n,count=0; clrscr(); printf("Enter Number of equation : "); scanf("%d",&n); printf("Enter Coefficients row by row \n"); printf("One row in each line\n"); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%f",&a[i][j]); printf("Enter vector elements\n"); for(i=1;i<=n;i++) { x0[i]=x[i]=0; scanf("%f",&b[i]); } printf("N\t"); for(i=1;i<=n;i++) printf("X%d \t",i); printf("\n"); printf("-------------------------------------------------------------------\n"); s: printf("%d\t",count+1); for(i=1;i<=n;i++) { sum=0; for(j=1;j<=n;j++) { if(i==j) continue; else sum=sum+(a[i][j]*x[j]); } x[i]=(b[i]-sum)/a[i][i]; printf("%f \t",x[i])...

# include <stdio.h> # include <conio.h> # define MAX 20 void main() { int i,j,n; float x[MAX],fx[MAX][MAX],xp,u,sum=0; printf("Newton Divided Difference formula \n"); printf("Enter No. of data points : "); scanf("%d",&n); printf("Enter values of X and f(x) set by set each at once \n"); for(i=1;i<=n;i++) scanf("%f%f",&x[i],&fx[i][1]); printf("Enter value of X at which interpolation is required : "); scanf("%f",&xp); for(i=2;i<=n;i++) for(j=1;j<=n-i+1;j++) fx[j][i]=(fx[j+1][i-1]-fx[j][i-1])/(x[j+i-1]-x[j]); printf("-------------------------------------------------------------------\n"); printf("X F(x) "); for(i=1;i<n;i++) printf("y%d ",i); printf("\n-----------------------------------------------------------------\n"); for(i=1;i<=n;i++) { printf("%4.2f\t ",x[i]); for(j=1;j<=n-i+1;j++) printf(...

This blog is for all computer learners. my goal to make this blog for c beginners and data structure students. i will try my best to update this on daily basis, so plz visit this . and say that you like this or not. and how can i make this better. thanx.

/*   Program to implement BESSELS INTERPOLATION FORMULA in C.       ------------------------------------ */ #include<stdio.h> #include<conio.h> #include<math.h> #include<process.h> #include<conio.h> void main() { int n;                          // no. of terms. int i,j;                        // Loop variables float ax[10];                   // 'X' array limit 9 float ay[10];                   // 'Y' array limit 9 float x;                        // User Query for what value of X float y;                      // Calculated value for coressponding X. float h;         ...

program to create two way linked list. #include<stdio.h> #include<conio.h> #include<alloc.h> #define NULL 0 void main() { struct dnode { struct dnode *prev; int data; struct dnode *next; }*start,*temp,*k,*p,*pre; int i,c; char ch; clrscr(); start=NULL; for(i=0;i<=1;i++) { if(start==NULL) { temp=(struct dnode*)malloc(sizeof(struct dnode)); printf("\nEnter the value for node: -"); scanf("%d",&temp->data); start= temp; temp->prev=NULL; temp->next=NULL; } else { while(1) { printf("\nDo you want to create one more node(Y/N):- "); fflush(stdin); scanf("%c",&ch); if(ch=='y' || ch=='Y') { temp->next=(struct dnode*)malloc(sizeof(struct dnode)); printf("\nEnter the value of  node: -"); k=temp->next; scanf("%d",&k->data); k->prev=temp; k->next=NULL; temp=k; } else { te...