Saurabh's Blog

Multiplication Of Two Numbers With Help Of Linked List

2013-01-12T04:48:00.002-08:00

Multiplication Of Two Numbers With Help Of Linked List

It's A Multiplication Program Using Linked List That Means It Can Multiply Numbers That Are Bigger Than Range Of int , long int etc.. .............

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct ll
{
int digit;
struct ll *next;
}number;
void add(number **hd,int i);
void traverse(number *hd);
void reverse(number **hd);
void adds(char a[],number **hd);
void addhead(number *hd1,number *hd);
void mul(number *hd1,number **hd2);
void multiply(number *hd1,int attempt,int x);
void copy(number *hd);
void freeh(number **hd);
number *oh=NULL,*head3=NULL,*head4=NULL;
void main()
{
number *head1=NULL,*head2=NULL;
char a[500],b[500];
clrscr();
gets(a);
gets(b);
adds(a,&head1);
adds(b,&head2);
printf("___________");
printf("\nAnswer Is :|");
printf("\n-----------");
mul(head1,&head2);
freeh(&head1);
freeh(&head2);
freeh(&oh);
freeh(&head4);
traverse(head3);
freeh(&head3);
getch();
}
void copy(number *hd)
{
if(hd==NULL)
return;
while(hd!=NULL)
{
add(&head3,hd->digit);
hd=hd->next;
}
reverse(&head3);
}
///////////////////////////////////////////////////
void mul(number *hd1,number **hd2)
{
int attempt=0,x;number *temp;
while(*hd2!=NULL)
{
temp=*hd2;
x=(*hd2)->digit;
multiply(hd1,attempt,x);
attempt++;
*hd2=(*hd2)->next;
free(temp);
}
}
void multiply(number *hd1,int attempt,int x)
{
int a,sum=0,carry=0;
while(hd1!=NULL)
{
a=hd1->digit*x+carry;
sum=a%10;
carry=a/10;
add(&oh,sum);
hd1=hd1->next;
}
if(carry>0)
add(&oh,carry); //till here no change
if(attempt==0)
{
copy(oh);
freeh(&oh);
return;

}
//reverse should be of head4
reverse(&oh);
while(attempt)
{
add(&oh,0);
attempt--;
}
reverse(&head3);
addhead(oh,head3); //addition of head4 and oh should be done
freeh(&head3);
copy(head4);
freeh(&head4);
freeh(&oh);
}

void freeh(number **hd)
{
number *temp;
while(*hd!=NULL)
{
temp=*hd;
*hd=(*hd)->next;
free(temp);
}
*hd=NULL;
}
void add(number **hd,int i)
{
number *t;
t=(number*)malloc(sizeof(number));
t->next=NULL;
t->digit=i;
if(*hd==NULL)
{
*hd=t;
return;
}
t->next=*hd;
*hd=t;
}
///////////////////////////////////////////////////
void traverse(number *hd)
{
printf("\n");
while(hd!=NULL)
{
printf("%d",hd->digit);
hd=hd->next;
}
}
//////////////////////////////////////////////////
void reverse(number **hd)
{
number *p,*q,*r;
if(*hd==NULL)
return;
p=*hd;
if(p->next==NULL)
return;
q=p->next;
if(q->next==NULL)
{
q->next=p;
p->next=NULL;
*hd=q;
return;
}
r=q->next;
while(r->next!=NULL)
{
q->next=p;
p=q;
q=r;
r=r->next;
}
q->next=p;
r->next=q;
(*hd)->next=NULL;
*hd=r;

}
void addhead(number *hd1,number *hd2)
{
int x,carry=0,sum=0;
while(hd1!=NULL&&hd2!=NULL)
{
x=(hd1)->digit+(hd2)->digit + carry;
sum=x % 10;
carry=x / 10;
add(&head4,sum);
hd1=(hd1)->next;
hd2=(hd2)->next;
}
if(hd1==NULL&&hd2!=NULL)
{
while(hd2!=NULL)
{
x=(hd2)->digit + carry;
sum=x % 10;
carry=x / 10;
add(&head4,sum);
hd2=(hd2)->next;
}
}
else if(hd1!=NULL&&hd2==NULL)
{
while(hd1!=NULL)
{
x=(hd1)->digit + carry;
sum=x % 10;
carry=x / 10;
add(&head4,sum);
hd1=(hd1)->next;
}
}
if(carry>0)
add(&head4,carry);
//reverse(hd3);
}
void adds(char a[],number **hd)
{
int i=0;
while(a[i]!= '\0')
{
add(hd,a[i]- '0');
i++;
}
}

___________________________________________________________________________________

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!

!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr

LINKED LIST IMPLEMENTATION FOR GAME BATTLESHIP THROUGH C

2012-11-12T08:35:00.001-08:00

LINKED LIST IMPLEMENTATION FOR GAME BATTLESHIP THROUGH C

The game is played on four grids, two for each player. The grids are typically square – usually 10×10 – and the individual squares in the grid are identified by letter and number. On one grid the player arranges ships and records the shots by the opponent. On the other grid the player records his/her own shots.

Before play begins, each player secretly arranges their ships on their primary grid. Each ship occupies a number of consecutive squares on the grid, arranged either horizontally or vertically. The number of squares for each ship is determined by the type of the ship. The ships cannot overlap (i.e., only one ship can occupy any given square in the grid). The types and numbers of ships allowed are the same for each player. These may vary depending on the rules.

REF:- http://en.wikipedia.org/wiki/Battleship_(game)

I have used Linked List For It's Implementation One Can Use Array too.....

_____________________________________________________________________________________________

#include"stdio.h"

#include"stdlib.h"

#define n 7

#define s 4

#define ssz 3

typedef struct ll

{

int pos;

int ship_id;

struct ll next;

}mynode;

void creatematrix(mynode hd,int pos);

int check(mynode hd,int posn);

void destructprint(mynode hd);

void printmatrix(mynode *hd);

void placeship(mynode **hd,int posn);

//////////////////////////////////////////////////////////////////////////////

void main()

{

mynode head=NULL;

int tried=0,pos,i,j,attempt,st,kill=0;

clrscr();

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

creatematrix(&head,(i10)+j);

printmatrix(head);

printf("\nPLEASE WAIT PLACING SHIPS !!");

for(i=1;i<=s;i++)

placeship(&head,i);

printf("\nREADY...\n");

//printmatrix(head);

//destructprint(head);

printf("\nIT'S A 7X7 MATRIX , ENTER NO. OF ATTEMPT YOU WOULD LIKE TO TRY !! OR ENTER 0 FOR DEFAULT NO. OF ATTEMPT=8 ");

scanf("%d",&attempt);

if(attempt==0||attempt>35)

attempt=8;

printf("\nOK YOU HAVE BEEN GRANTED %d ATTEMPTS",attempt);

while(attempt)

{

printf("\nENTER ROW NUMBER ");

scanf("%d",&i);

printf("\nENTER COLUMN NUMBER ");

scanf("%d",&j);

st=check(&head,i*10+j);

if(st==0||i<0||i>7||j<0||j>7)

{

printf("\nINVALID CHOICE !! RE-ENTER");

//destructprint(head);

continue;

}

else if(st==1)

{

printf("\nOMG ! IT'S A KILL , WHOA !!!");

kill++;

//destructprint(head);

}

else if(st==2)

{

printf("\nOOOPPPSSS IT'S A MISS");

//destructprint(head);

}

else if(st==3)

{

printf("\nOK! IT'S HIT");

//destructprint(head);

}

tried++;

if(kill==s)

{

printf("\nWHOA ALL SHIPS HAS BEEN SHONKEN , CONGRATS, YOUR SCORE=%d\n",tried);

//destructprint(head);

break;

}

attempt--;

}

if(kill<s)

printf("\nSORRY U HAVE LOST TRY BETTER LUCK NEXT TIME U ATTEMPTED %d TIMES!!\n",tried);

//////////////////////////////////////////////////////////////////////////////

destructprint(head);

getch();

}

//////////////////////////////////////////////////////////////////////////////

void creatematrix(mynode **hd,int posn)

{

//PLAYING FOR 7X7 MATRIX EDIT N AND S FOR MORE

mynode t,q;

t=(mynode)malloc(sizeof(mynode));

t->pos=posn;

t->ship_id=0;

t->next=NULL;

if(hd==NULL)

{

hd=t;

return;

}

q=hd;

while(q->next!=NULL)

q=q->next;

q->next=t;

}

//////////////////////////////////////////////////////////////////////////////

void printmatrix(mynode *hd)

{

int i,j;

for(i=1;i<=n;i++)

{

for(j=1;j<=n;j++)

{

if(hd->ship_id!=0)

printf("%d ",hd->ship_id);

else

printf("%d ",hd->pos);

hd=hd->next;

}

printf("\n");

}

}

//////////////////////////////////////////////////////////////////////////////

void placeship(mynode **hd , int s_id)

{

int i,r_id,c_id,s_size;

mynode p=hd;

randomize();

while(1)

{

s_size=random(ssz-1)+1;

c_id=random(n)+1;

r_id=random(n)+1;

if(n<c_id+s_size-1)

c_id=c_id-s_size;

//printf("\nshipid=%d size=%d r_id=%d c_id=%d\n",s_id,s_size,r_id,c_id);

while(p->pos!=((r_id)10+c_id))

{

p=p->next;

}

if(p->ship_id!=0)

{

p=hd;

continue;

}

else break;

}

while(s_size)

{

p->ship_id=s_id;

p=p->next;

s_size--;

}

}

//////////////////////////////////////////////////////////////////////////////

void destructprint(mynode hd)

{

int i,j;

mynode p=hd;

printf("\nSHIPS WITH THEIR ID'S , * DENOTES FOR DESTROYED PARTS/SHIPS\n");

for(i=1;i<=n;i++)

{

for(j=1;j<=n;j++)

{

if(i10+j!=p->pos)

{

printf(" ");

continue;

}

printf("%d ",p->ship_id);

p=p->next;

}//2 for

printf("\n");

}//1 for

}

int check(mynode **hd,int posn)

{ int k,sid;

mynode p=hd,prev=hd;

mynode next=p->next;

//printf("\nposn=%d",posn);

if(posn<11||posn>n10+n||posn%10==0)

return 0;

if((hd)->pos==posn&&(hd)->ship_id!=0)

{

k=(hd)->pos;

free(hd);

*hd=next;

if(next->ship_id==0&&next->ship_id!=k)

return 1;

return 3;

}

while(p->next!=NULL)

{

p=p->next;

next=p->next;

if(p->pos==posn&&p->ship_id!=0)

{

sid=p->ship_id;

prev->next=p->next;

free(p);

if(prev->ship_id!=sid&&next->ship_id!=sid)

return 1;

return 3;

}

else

prev=prev->next;

}

return 2;

}

---------------------------------------------------------------------------------

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!

!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr

TIC-TAC-TOE THROUGH C

2012-11-12T08:13:00.006-08:00

IMPLEMENTATION OF TIC-TAC-TOE THROUGH C :-

From Wikipedia, the free encyclopedia.

Tic-tac-toe, originally called noughts and crosses (and still known as this in Britain and Australia), Xs and Os (in Ireland) and X and 0 (in India) is a pencil-and-paper game for two players, X and O, who take turns marking the spaces in a 3×3 grid. The player who succeeds in placing three respective marks in a horizontal, vertical, or diagonal row wins the game.

The following example game is won by the first player, X:

Players soon discover that best play from both parties leads to a draw (often referred to as cat or cat's game). Hence, tic-tac-toe is most often played by young children.

The friendliness of tic-tac-toe games makes them ideal as a pedagogical tool for teaching the concepts of good sportsmanship and the branch of artificial intelligence that deals with the searching of game trees. It is straightforward to write a computer program to play tic-tac-toe perfectly, to enumerate the 765 essentially different positions (the state space complexity), or the 26,830 possible games up to rotations and reflections (the game tree complexity) on this space.

http://en.wikipedia.org/wiki/Tic-tac-toe

---------------------------------------------------------------------------------

#include<stdio.h>

#include<string.h>

int check(int i,int j);

int winner(void);

void printmatrix(void);

int a[3][3];

void main()

{

int win,choice,i,posi,posj;

char pl1[30],pl2[30],str[30];

while(1)

{

clrscr();

printf("\nEnter 0 to Exit");

printf("\nEnter Any Other Number to Play \n");

scanf("%d",&choice);

if(!choice)

break;

win=100;

for(posi=0;posi<=2;posi++)

for(posj=0;posj<=2;posj++)

a[posi][posj]=win++;

printmatrix();

printf("\nWELCOME TO TIC-TAC-TOE");

printf("\nENTER PLAYER 1 NAME WHO WILL PLAY X AND STARTS GAME ");

fflush(stdin);

gets(pl1);

printf("\nENTER PLAYER 2 NAME WHO WILL PLAY O ");

gets(pl2);

for(i=1;i<=9;i++)

{

if(i%2!=0)

strcpy(str,pl1);

else

strcpy(str,pl2);

printf("\n%s ENTER ROW NUMBER ",str);

scanf("%d",&posi);

printf("\n%s ENTER COLUMN NUMBER ",str);

scanf("%d",&posj);

if(check((posi-1),(posj-1)))

{

while(check(posi-1,posj-1))

{

printf("\nINVALID CHOICE , RE-ENTER");

printf("\nENTER ROW NUMBER ");

scanf("%d",&posi);

printf("\nENTER COLUMN NUMBER ");

scanf("%d",&posj);

}//while

}//if

if(i%2!=0)

a[posi-1][posj-1]=1;

else

a[posi-1][posj-1]=0;

clrscr();

printmatrix();

win=winner();

if(win==1)

{

printf("\nPLAYER 1 WINS ");

break;

}

else if(win==2)

{

printf("\nPLAYER 2 WINS ");

break;

}

}//for

clrscr();

printf("\n\n\tHERE IS THE RESULT\n");

for(i=1;i<=80;i++)

printf("-");

printmatrix();

for(i=1;i<=80;i++)

printf("-");

win=winner();

if(win==0)

printf("\nOOPS IT'S A DRAW");

else if(win==1)

printf("\n%s IS WINNER",pl1);

else

printf("\n%s IS WINNER",pl2);

delay(5000);

}

}//main

int check(int i ,int j)

{

if(a[i][j]==0||a[i][j]==1||i<0||i>2||j<0||j>2)

return 1;

return 0;

}

void printmatrix(void)

{

int i,j;

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

{

for(j=0;j<=2;j++)

{

if(a[i][j]==0)

printf("\t\tO\t|");

else if(a[i][j]==1)

printf("\t\tX\t|");

else

printf("\t\t \t|");

}

printf("\t\t\n");

}

int winner()

{

int i;

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

{

if((a[i][0]==a[i][1]&&a[i][0]==a[i][2])&&(a[i][0]!=0||a[i][0]!=1))

{

if(a[i][0]==1)

return 1;

return 2;

}//if

if((a[0][i]==a[1][i]&&a[0][i]==a[2][i])&&(a[i][0]!=0||a[i][0]!=1))

{

if(a[0][i]==1)

return 1;

return 2;

}//if

}//for

//CHECK FOR DIAGONAL ELEMENT'S

if((a[1][1]==a[2][2]&&a[2][2]==a[0][0])&&(a[1][1]!=0||a[1][1]!=1))

{

if(a[1][1]==1)

return 1;

return 2;

}

if((a[0][2]==a[1][1]&&a[1][1]==a[2][0])&&(a[2][0]!=0||a[2][0]!=1))

{

if(a[1][3]==1)

return 1;

return 2;

}//if

return 0;

}

---------------------------------------------------------------------------------

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!

!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr

DATA STRUCTURES INTERVIEW QUESTIONS

2012-10-28T02:06:00.001-07:00

LINKED LIST INTERVIEW QUESTIONS

Here Is One Of Most Asked Interview Question On Linked List !

We Have Given A List With Following Data :-
1->2->3->4->5->6->7->8->9->10 and k=3

Then Output Should Be :-

4->3->2->1->5->6->7->8->9->10
------------------------------------------------------------------------------------------------------------------
Here Is A Solution To This Problem:-
------------------------------------------------------------------------------------------------------------------
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct ll
{
int data;
struct ll *next;
}mynode;
mynode *start;
void placestart(mynode **hd,int c);
int numofnodes(mynode *hd);
void addnode(mynode **hd,int data);
void revinstyle(mynode **hd,int nonr);
void printall(mynode *hd);
void main()
{
int ch,data,nonr,count;
mynode *head=NULL;
clrscr();
do
{
printf("\n1.Add Data");
printf("\n2.Enough! Continue To Reversing ");
printf("\n3.Traverse");
printf("\n4.Exit");
printf("\nEnter Choice ");
scanf("%d",&ch);
switch(ch)
{
case 1:
clrscr();
printf("\n Enter Data ");
scanf("%d",&data);
addnode(&head,data);
break;
case 3:
printall(head);
break;
case 4:
exit(0);
break;
}//switch
} while(ch!=2);

/////////////////////////////////////////////////////////////////////////////
clrscr();
printf("\nEnter Number Of Nodes Of To Be Reversed ");
scanf("%d",&nonr);
count=numofnodes(head);
printf("NUM OF NODES = %d And Number Of Nodes To Be Reversed=%d",count,nonr);
if(count<=nonr||count==1||count==0)
{
printf("\nOperation Can't Be Applied , Insufficient Data");
getch();
exit(0);
}
printf("\n\n");
printf("\nBefore Operation \n");
printall(head);
placestart(&head,nonr);
//printf("\nDATA FROM START=%d\n",start->data);
printf("\n\n");
revinstyle(&head,nonr);
printf("\nDATA FROM REVERSED LIST\n");
printall(head);

printf("\n\n");
printf("\nDATA FROM REMAINING OF LIST \n");
printall(start);

getch();
}
void placestart(mynode **hd,int c)
{
start=*hd;
while(c)
{
start=start->next;
c--;
}
start=start->next;
}
void revinstyle(mynode **hd,int nonr)
{
mynode *p,*q,*r;
if(*hd==NULL)
{
printf("\nNothing In List");
return;
}
p=*hd;
if((*hd)->next==NULL)
{
printf("Single Data Only");
return;
}
q=(*hd)->next;
//printf("nonor=%d",nonr);
if(q->next==NULL&&nonr==1)
{
//printf("\nhead=%d",(*hd)->next);
q->next=*hd;
(*hd)->next=NULL;
//printf("\nafter head=%d",(*hd)->next);
*hd=q;
return;
}//
r=q->next;
while(nonr)
{
q->next=p;
p=q;
q=r;
r=r->next;
nonr--;
}//while
(*hd)->next=NULL;
*hd=p;
}
int numofnodes(mynode *hd)
{
int c=0;
if(hd==NULL)
return 0;
while(hd!=NULL)
{
c++;
hd=hd->next;
}
return c;

}

void printall(mynode *hd)
{
printf("\n\n");
if(hd==NULL)
{
printf("\nNOTHING !");
return;
}
while(hd!=NULL)
{
printf("%d,",hd->data);
hd=hd->next;
}
}

void addnode(mynode **hd,int data)
{
mynode *p,*q;
p=(mynode*)malloc(sizeof(mynode));
p->data=data;
p->next=NULL;
if(*hd==NULL)
{
(*hd)=p;
return;
}
q=*hd;
while(q->next!=NULL)
q=q->next;
q->next=p;
}

----------------------------------------------------------------------------------------------------------------

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!
!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr
----------------------------------------------------------------------------------------------------------------

QUEUE IMPLEMENTATION USING LINKED LIST

2012-09-01T12:16:00.002-07:00

IMPLEMENTATION OF QUEUE BY LINKED LIST

In computer science, a queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear and removal of entities from the front. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once an element is added, all elements that were added before have to be removed before the new element can be invoked. A queue is an example of a linear data structure.

Queues provide services in computer science, transport, and operations research where various entities such as data, objects, persons, or events are stored and held to be processed later. In these contexts, the queue performs the function of a buffer.

Queues are common in computer programs, where they are implemented as data structures coupled with access routines, as an abstract data structure or in object-oriented languages as classes. Common implementations are circular buffers and linked lists.

[Courtsey: Wikipedia.org

#include<stdlib.h>

typedef struct ll
{
int digit;
struct ll next;
}mynode;

void addnode(mynode hd,int data);
void delnode(mynode hd);
void traverse(mynode hd);
void findnode(mynode hd,int data);

mynode head,front,rear,prev,new1;

void main()
{
int data,i,choice;
clrscr();

head=(mynode*)malloc(sizeof(mynode));
head->next=NULL;

while(1)
   { printf("\n\n\n\n\n\n");
     for(i=0;i<80;i++)
     printf("_");

     printf("\n\t\t\t1.ADD NODE");
     printf("\n\t\t\t2.DELETE NODE");
     printf("\n\t\t\t3.TRAVERSE LIST");
     printf("\n\t\t\t4.SEARCH NODE");
     printf("\n\t\t\t5.EXIT");
     printf("\n\n");

     for(i=0;i<80;i++)
     printf("_");

     printf("\n\t\t\tENTER CHOICE: ");
     scanf("%d",&choice);

     switch(choice)
      {
    case 1: printf("\n\t\t\tEnter Data To Add: ");
        scanf("%d",&data);

        addnode(&head,data);
        break;

    case 2: delnode(&head);
        break;

    case 3: traverse(head);
        break;

    case 4: printf("\n\t\t\tEnter Data To Search: ");
        scanf("%d",&data);

        findnode(head,data);
        break;

    case 5: printf("\n\t\t\tTHANKS FOR SPENDING TIME WITH ME \1 !!!\n ");
        printf("\t\t\tGOOD DAY!!");
        getch();

     exit(0);
     break;

       default: clrscr();
            printf("\n\t\t\tINVALID CHOICE BUDDY!! PLEASE RE-ENTER!! ");
            break;
     }//switch
   }//while
}

void addnode(mynode **hd,int data)
{
clrscr();

new1=(mynode)malloc(sizeof(mynode));
new1->next=NULL;
new1->digit=data;

    if((hd)->next==NULL)

     {
       rear=*hd;
       rear->next=new1;

       printf("\n\t\t\tFIRST DATA %d HAS BEEN ENTERED",data);
       rear=rear->next;//new
       return;
     }

   rear->next=new1;
   rear=new1;

   printf("\n\t\t\tDATA %d HAS BEEN ADDED",data);

}

void delnode(mynode **hd)
{ int i;
clrscr();

front=prev=hd;

if((hd)->next==NULL)
   {
     printf("\n\t\t\tTHE LIST IS EMPTY!") ;
     return;
   }

if((hd)->next->next==NULL)
    {
      prev=prev->next;
      free(prev);
      front->next=NULL;
      printf("\n\t\t\t");
      for(i=0;i<35;i++)
      printf("_");
      printf("\n\t\t\tWARNING: FIRST NODE %d IS DELETED!!",prev->digit);
      printf("\n\t\t\t");
      for(i=0;i<35;i++)
      printf("_");
      return;
    }

    prev = (hd)->next;
    front = prev->next;

    printf("\n\t\t\tDATA %d IS TERMINATED!!",prev->digit);

    free(prev);
    (hd)->next = front;

}

void findnode(mynode hd,int data)
{
clrscr();

rear=hd;

    if(rear->next==NULL)
     { printf("\n\t\t\tNO DATA IS PRESENT IN THE LIST.");
       return;
     }

    while(rear->next!=NULL)
     {
       rear=rear->next;

       if(rear->digit==data)
    { printf("\n\t\t\tDATA %d HAS BEEN FOUND!",data);
    return;
    }

     }

   printf("\n\t\t\tDATA %d IS ABSENT!",data);

}

void traverse(mynode *hd)
{
clrscr();

rear=hd;

    if(rear->next==NULL)
     {
    printf("\n\t\t\tLIST IS EMPTY.");
    return;
     }

     printf("\n\t\t\tFOLLOWING DATA HAS BEEN FOUND: ");
     while(rear->next!=NULL)
      { rear=rear->next;

      printf("%d ",rear->digit);

      }
}
Edited By Sarvesh Prajapati

STACK IMPLEMENTATION USING LINKED LIST

2012-08-25T13:25:00.001-07:00

DYNAMIC IMPLEMENTATION OF STACK

In computer science, a stack is a last in, first out (LIFO) abstract data type and linear data structure. A stack can have any abstract data type as an element, but is characterized by two fundamental operations, called push and pop (or pull). The push operation adds a new item to the top of the stack, or initializes the stack if it is empty. If the stack is full and does not contain enough space to accept the given item, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack. A pop either reveals previously concealed items, or esults in an empty stack, but if the stack is empty then it goes into underflow state (It means no items are present in stack to be removed). A stack pointer is the register which holds the value of the stack. The stack pointer always points to the top value of the stack.

A stack is a restricted data structure, because only a small number of operations are performed on it. The nature of the pop and push operations also means that stack elements have a natural order. Elements are removed from the stack in the reverse order to the order of their addition: therefore, the lower elements are those that have been on the stack the longest.

[Ref: wikipedia.org]

#include<stdio.h>

#include<stdlib.h>

typedef struct ll

{

int digit ;

struct ll *next ;

}mynode ;

mynode *head,*new1,*prev ;

void addnode(mynode **hd,int data) ;

void deletenode(mynode **hd) ;

void traverse(mynode *hd) ;

void searchnode(mynode *hd,int data) ;

void main()

{

int data,choice ;

clrscr() ;

head = (mynode*)malloc(sizeof(mynode)) ;

head->next = NULL ;

while(1)

{

printf("\n1.ADD NODE") ;

printf("\n2.DELETE NODE") ;

printf("\n3.TRAVERSE LIST") ;

printf("\n4.SEARCH NODE") ;

printf("\n5.EXIT") ;

printf("\nENTER CHOICE : ") ;

scanf("%d",&choice) ;

switch(choice)

{

case 1: printf("\nEnter The Number : ") ;

scanf("%d",&data) ;

addnode(&head,data) ;

break ;

case 2: deletenode(&head) ;

break ;

case 3: traverse(head) ;

break ;

case 4: printf("\nEnter Data To Be Searched : ") ;

scanf("%d",&data) ;

searchnode(head,data) ;

break ;

case 5: printf("Thank's For Using Me !! Good Bye %c !!",1) ;

getch() ;

exit(0) ;

default: printf("\nInvalid Choice Re-Enter : ") ;

break ;
}//switch

} //while

}

void addnode(mynode **hd , int data)

{

clrscr() ;

new1 = (mynode*)malloc(sizeof(mynode)) ;

new1->digit = data ;

if((*hd)->next==NULL)

{

new1->next=*hd ;

printf("\nFirst Node With Data %d Is Added",data) ;

(*hd)=new1 ;

return ;

}//if

new1->next = *hd ;

printf("\nNode With Value %d Is Added ",data) ;

(*hd) = new1 ;

}

void deletenode(mynode **hd)

{

clrscr() ;

prev = *hd ;

if((*hd)->next == NULL)

{

printf("\nNothing Is In List Enter Some Data First") ;

return ;

}//if

*hd = (*hd)->next ;

printf("Node With Data %d Is Deleted",prev->digit) ;

free(prev) ;

}

void traverse(mynode *hd)

{

clrscr() ;

if(hd->next==NULL)

{

printf("\nNothing Found Enter Some Data First ") ;

return ;

}//if

printf("\nFollowing Data Are Found\n") ;

while(hd->next != NULL)

{

printf("%d,",hd->digit) ;

hd = hd->next ;

}//while

}

void searchnode(mynode *hd,int data)

{

clrscr() ;

if((hd)->next==NULL)

{

printf("\nNothing Found List Is Empty") ;

return ;

}//if

while((hd)->next!=NULL)

{

if((hd)->digit==data)

{

printf("\nData %d Is Found",data) ;

return ;

}//if

hd=hd->next ;

}//while

printf("\nData %d Is Not Found ",data) ;

}

Circular Linked List

2012-08-14T10:06:00.000-07:00

SINGLY CIRCULAR LINKED LIST

In This Post I'm Going To Demonstrate you Simple Operations On Singly Circular Linked List i.e.

(1) Addition Of Nodes

(2) Deletion Of Nodes

(3) Traversing The List

(4) Search A Data from List

THE CODE IS AS FOLLOWING :-

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct ll
{
int digit;
struct ll *next;
}mynode;
mynode *head,*start,*new1,*prev;
void addnode(mynode **hd,int data)
{
clrscr();
start=*hd;
new1=(mynode*)malloc(sizeof(mynode));
new1->digit=data;
if((*hd)->next==head)
{
start->next=new1;
new1->next=head;
printf("\nFirst Data %d Is Addeded !!",data);
return;
}//if
while(start->next!=head)
start=start->next;
start->next=new1;
new1->next=head;
start=new1;
printf("\nData %d Is Added " ,data);
}
void delnode(mynode **hd,int data)
{
clrscr();
start=prev=*hd;
if(start->next==head)
{
printf("\nList Is Empty Buddy Nothing To Delete");
return;
}//if ends
if(start->next->next==head)
{
if(start->next->digit!=data)
{
printf("\n%d Data Is Not Found On Single Node",data);
return;
}
start=start->next;
prev->next=start->next;
free(start);
printf("\nWarning : Single Data %d Is Deleted",data);
return;
}//if ends
while(start->next!=head)
{
start=start->next;
if(start->digit==data)
{
prev->next=start->next;
free(start);
printf("\n%d Data Is deleted ",data);
return;
}
else
prev=prev->next;
}//while ends here
printf("\n%d Data Is Not Found",data);
}
void searchnode(mynode *hd , int data)
{
clrscr();
start=hd;
if(start->next==head)
{
printf("\nList Is Empty Nothing Found Enter Some Data First ");
return;
}//if
while(start->next!=head)
{
start=start->next;
if(start->digit==data)
{
printf("\nData %d Is Found",data);
return;
}
}//while
printf("\nData %d Is Not Found",data);
}
void traverse(mynode *hd)
{
clrscr();
start=hd;
if(start->next==head)
{
printf("\nNOTHING FOUND ! LIST IS EMPTY ");
return;
}
printf("\nFollwing Data Are Found : \n");
while(start->next!=head)
{
start=start->next;
printf("%d,",start->digit);
}
}
void main()
{
int choice,data;
clrscr();
head=(mynode*)malloc(sizeof(mynode));
head->next=head;
while(1)
{
printf("\n1.ADD NODE");
printf("\n2.DELETE NODE");
printf("\n3.SEARCH NODE");
printf("\n4.TRAVERSE THE LIST");
printf("\n5.EXIT");
printf("\nENTER CHOICE : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("\nEnter Data To Be Inserted : ");
scanf("%d",&data);
addnode(&head,data);
break;
case 2:
printf("\nEnter Data To Be Deleted : ");
scanf("%d",&data);
delnode(&head,data);
break;
case 3:
printf("\nEnter Data To Search : ");
scanf("%d",&data);
searchnode(head,data);
break;
case 4:
traverse(head);
break;
case 5:
printf("THANK'S FOR USING ME GOODBYE %c !!",1);
getch();
exit(0);
break;
default :
clrscr();
printf("\nInvalid Choice Re-Enter : ");
break;
}//switch
}//while(1)ends

}

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!

!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr

SIMPLE AND BASIC OPERATIONS ON DOUBLY LINKED LIST

2012-08-14T01:14:00.001-07:00

DOUBLY LINKED LIST

In This Post I'm Going To Demonstrate you Simple Operations On Doubly Linked List i.e.

(1) Addition Of Nodes

(2) Deletion Of Nodes

(3) Traversing The List In LIFO and FIFO Fashion

(4) Search A Data from List

THE CODE IS AS FOLLOWING :-

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct ll
{
struct ll *prev;
int digit;
struct ll *next;
}mynode;
mynode *start,*head,*new1,*prev;
void addnode(mynode **hd , int data);
void delnode(mynode **hd , int data);
void traverseLIFO(mynode *hd);
void traverseFIFO(mynode *hd);
void searchnode(mynode *hd,int data);
void main()
{
int choice,data;
head=(mynode*)malloc(sizeof(mynode));
head->next=head->prev=NULL;
clrscr();
while(1)
{
printf("\n1.ADD NODE");
printf("\n2.DELETE NODE");
printf("\n3.TRAVERSE FIFO");
printf("\n4.TRAVERSE LIFO");
printf("\n5.SEARCH NODE");
printf("\n6.EXIT");
printf("\nENTER CHOICE : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("\nENTER DATA : ");
scanf("%d",&data);
addnode(&head,data);
break;
case 2:
printf("\nENTER DATA TO DELETE : ");
scanf("%d",&data);
delnode(&head,data);
break;
case 3:
traverseFIFO(head);
break;
case 4:
traverseLIFO(head);
break;
case 5:
printf("\nENTER DATA TO BE SEARCHED : ");
scanf("%d",&data);
searchnode(head,data);
break;
case 6:
printf("\nTHANKS FOR USING ME , GOOD BYE %c !!",1);
getch();
exit(0);
break;
default:
printf("\nINVALID CHOICE RE-ENTER : ");
break;
}//switch
}//while
}
void addnode(mynode **hd,int data)
{
clrscr();
start=*hd;
new1=(mynode*)malloc(sizeof(mynode));
new1->next=new1->prev=NULL;
new1->digit=data;
if(start->next==NULL)
{
start->next=new1;
new1->prev=start;
printf("\nFIRST DATA %d IS ADDED",data);
return;
}
while(start->next!=NULL)
start=start->next;
start->next=new1;
new1->prev=start;
printf("\n%d IS ADDED",data);
}
void delnode(mynode **hd,int data)
{
clrscr();
prev=start=*hd;
if(start->next==NULL)
{
printf("\nNOTHING TO DELETE");
return;
}
if(start->next->next==NULL)
{
if(start->next->digit==data)
{
start=start->next;
free(start);
prev->next=NULL;
printf("\nWARNING : FIRST NODE %d IS DELETED",data);
return;
}
else
{
printf("\nDATA %d IS NOT FOUND ON SINGLE NODE",data);
return;
}
}
while(start->next!=NULL)
{
start=start->next;
if(start->digit==data)
{
prev->next=start->next;
start->next->prev=prev;
free(start);
printf("\n%d IS DELETED !!",data);
return;
}
else
prev=prev->next;
}
printf("\n%d DATA IS NOT FOUND",data);
}
void traverseLIFO(mynode *hd)
{
clrscr();
start=hd;
if(start->next==NULL)
{
printf("\nNOTHING FOUND LIST IS EMPTY");
return;
}
printf("\nFOLLOWING DATA ARE FOUND : ");
while(start->next!=NULL)
start=start->next;
while(start->prev!=NULL)
{
printf("%d,",start->digit);
start=start->prev;
}
}
void traverseFIFO(mynode *hd)
{
clrscr();
start=hd;
if(start->next==NULL)
{
printf("\nNOTHING FOUND LIST IS EMPTY");
return;
}
printf("\nFOLLOWING DATA ARE FOUND : ");
while(start->next!=NULL)
{
start=start->next;
printf("%d,",start->digit);
}
}
void searchnode(mynode *hd,int data)
{
start=hd;
clrscr();
while(start->next!=NULL)
{
start=start->next;
if(start->digit==data)
{
printf("\nDATA %d IS FOUND",data);
return;
}
}
printf("\nDATA %d IS NOT FOUND",data);

}

SIMPLE AND BASIC LINKED LIST OPERATIONS

2012-08-13T10:08:00.000-07:00

SIMPLE AND BASIC LINKED LIST OPERATIONS

In This Post I'm Going To Demonstrate you Simple Operations On Linked List i.e.

(1) Addition Of Nodes

(2) Deletion Of Nodes

(3) Traversing The List and

(4) Search A Data from List

THE CODE IS AS FOLLOWING :-

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct ll
{
struct ll *next;
int digit;
}mynode;
mynode *head,*start,*new1;
void addnode(mynode **hd,int data);
void delnode(mynode **hd,int data);
void traverse(mynode *hd);
void search(mynode *hd,int data);
void main()
{
int choice,data;
head=(mynode*)malloc(sizeof(mynode));
head->next=NULL;
clrscr();
do
{
printf("\nEnter Choice : ");
printf("\n1.ADD NODE");
printf("\n2.DELETE NODE");
printf("\n3.TRAVERSE OR READ LIST");
printf("\n4.SEARCH NODE");
printf("\n5.EXIT");
printf("\nEnter Choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("\nEnter A Number ");
scanf("%d",&data);
addnode(&head,data);
break;
case 2:
printf("\nEnter Data To Delete : ");
scanf("%d",&data);
delnode(&head,data);
break;
case 3:
traverse(head);
break;
case 4:
printf("\nEnter Data To Search : ");
scanf("%d",&data);
search(head,data);
break;
case 5:
printf("\nTHANKS FOR USING ME !! HAVE A NICE DAY , BYE BYE %c!! ",1);
getch();
exit(0);
break;
default:
printf("\nINVALID CHOICE RE-ENTER\n");
break;
}//switch
}while(choice!=5);
}
void addnode(mynode **hd,int data)
{
mynode *new1,*head;
head=*hd;
new1=(mynode*)malloc(sizeof(mynode));
new1->next=NULL;
new1->digit=data;
if(head->next==NULL)
{
head->next=new1;
printf("\nFIRST NODE ADDED");
return;
}
while(head->next!=NULL)
head=head->next;
head->next=new1;
printf("\n%d IS ADDED ! ",data);
}
void delnode(mynode **hd,int data)
{
mynode *temp,*prev;
temp=*hd;
clrscr();
if(temp->next==NULL)
{
printf("\nNOTHING TO DELETE");
return;
}
if(temp->next->next==NULL)
{
if(temp->next->digit!=data)
{
printf("\nDATA NOT FOUND IN SINGLE NODE");
return;
}
temp=temp->next;
printf("\nWARNING : SINGLE DATA DELETED ");
prev=*hd;
prev->next=NULL;
free(temp);
printf("\n%d IS DELETED !!",data);
return;
}
prev=*hd;
while(temp->next!=NULL)
{
temp=temp->next;
if(temp->digit==data)
{
prev->next=temp->next;
free(temp);
printf("\n%d IS DELETED",data);
return;
}//if
else
prev=prev->next;
}//while
printf("\nDATA NOT FOUND");
}
void traverse(mynode *hd)
{
mynode *temp=hd;
clrscr();
printf("\nData Available Are: \n");
if(temp->next==NULL)
{
printf("\nNOTHING");
return;
}
while(hd->next!=NULL)
{
hd=hd->next;
printf("%d,",hd->digit);
}
}
void search(mynode *hd,int data)
{
mynode *temp;
temp=hd;
clrscr();
while(temp->next!=NULL)
{
temp=temp->next;
if(temp->digit==data)
{
printf("\nData Found");
return;
}
}
printf("\nNOT FOUND");
}

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!

!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr

COUNTING SORT

2012-08-13T01:38:00.002-07:00

COUNTING SORT

#include<stdio.h>
#include<conio.h>
#define n 1000
void main()
{
int i,j,max=0,size;
int a[n],b[n],c[n];
clrscr();
printf("\nEnter Size \n");
scanf("%d",&size);
for(i=0;i<size;i++)
scanf("%d",&a[i]);
for(i=0;i<size;i++)
{
if(a[i]>max)
max=a[i];
}
//printf("\nMax=%d\n",max);
for(i=0;i<n;i++)
b[i]=c[i]=0;
for(i=0;i<size;i++)
b[a[i]]++;
/*printf("\nFrequency:");
for(i=0;i<=max;i++)
printf("%d,",b[i]); */
for(i=1;i<=max;i++)
b[i]=b[i]+b[i-1];
/*printf("\nCumulative Frequency :\n");
for(i=0;i<=max;i++)
printf("%d",b[i]); */
for(i=size-1;i>=0;i--)
{
c[b[a[i]]]=a[i];
b[a[i]]--;
}
printf("\nAfter Sorting\n");
for(i=1;i<=size;i++)
printf("%d,",c[i]);
getch();
}
FOR MORE UNCOMMENT THE COMMENTED LINES OR GOTO http://en.wikipedia.org/wiki/Counting_sort

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!

!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr

Program To Calculate Factorial Of Large Numbers

2012-08-11T08:32:00.000-07:00

Program To Calculate Factorial Of Very Large Numbers :-
-------------------------------------------------------------------------------------------------------------------------------------------------------

#include"stdio.h"
#define MAX 10000
#include<conio.h>
void factorialof(int);
void multiply(int);
int length = 0;
int fact[MAX];

void main(){
int num;
int i;
clrscr();
printf("Enter any integer number : ");
scanf("%d",&num);

fact[0]=1;

factorialof(num);

printf("Factorial is : ");
for(i=length;i>=0;i--){
printf("%d",fact[i]);
}

getch();
}
void factorialof(int num){
int i;
for(i=2;i<=num;i++){
multiply(i);
}
}
void multiply(int num){
long i,r=0;
int arr[MAX];
for(i=0;i<=length;i++){
arr[i]=fact[i];
}

for(i=0;i<=length;i++){
fact[i] = (arr[i]*num + r)%10;
r = (arr[i]*num + r)/10;
//printf("%d ",r);
}
if(r!=0){
while(r!=0){
fact[i]=r%10;
r= r/10;
i++;
}
}
length = i-1;
}

This Program is Based On Concept Of Arbitrary Precision Arithmetic .

check out http://en.wikipedia.org/wiki/Arbitrary-precision_arithmetic for more details .

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!
!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr

Program To Evaluate Square Root Of A Number

2012-08-10T10:04:00.001-07:00

Program To Evaluate Square Root Of A Number :-

#include<stdio.h>
#include<conio.h>
void main()
{
float a,q,b,i;
clrscr();
printf("Enter Any Number : ");
scanf("%f",&q);
a=b=q/2;
for(i=0;i<50;i++)
{
b=((a+(q/b))/2);
a=b;
}
printf("The Square Root Of %f Is -> %f",q,b);
getch();
}

THIS EVALUATION IS BASED ON BABYLONIAN METHOD

Square roots by Divide-and-Average
This method dating back to the Babylonians (1700 B.C.) is known as the Babylonian Algorithm.
If A > 0 is a guess of the square root of the positive number Q, then a better approximation to √Q is given by
B = (A + Q/A)/2.
Now you use B as an approximation and compute C = (B + Q/B)/2, and so on to get as close as you want to the value of √Q. We have shown elsewhere why the Babylonian Algorithm works.

Example:
Let us find the square root of 5. Let A = 2.
Then B = (2 + 5/2)/2 = 2.25
C = (B + Q/B)/2 = (2.25 + 5/2.25)/2 = (2.25 + 2.22)/2 = 2.235
Notice that this value is getting closer with each iteration to the actual value 2.2360679...

You might wonder how one might even think of Q/A in connection with finding the square root of Q. Well, if A were indeed the square root of Q, then A² = Q and so A = Q/A. And even if A is not the square root of Q so that A ¹ Q/A, it turns out that √Q lies strictly between A and Q/A, and their average B produces a shorter interval from B to Q/B within which √Q still lies and the average of B and Q/B produces an even shorter interval containing √Q, and so on.

FOR MORE GOTO http://en.wikipedia.org/wiki/Methods_of_computing_square_roots

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!
!!!!!HAPPY PROGRAMMING !!!!!

U Can catch me at http://www.facebook.com/salokr

A Simple Database Using Linked List

2012-08-10T09:29:00.003-07:00

A Simple Database Using Linked List :-
___________________________________________________________________________________________________________________
#include<stdio.h>
#include<conio.h>
#include<string.h>
struct table
{
char name[50];
char add[50];
int age;
int salary;
struct table *next;
};
struct table *head;
void insert();
void sort();
void create();
void dis();
void search();
void del();
void main()
{
int i,choice;
clrscr();
head=NULL;
printf("\n\n\n\n\n\n\n\n\n\n\n\n\n");
for(i=0;i<80;i++)
   {
     printf("-");
   }
printf("\n\n\n\n\t\t           WELCOME TO YOUR DATABASE\n\n\n\n");
for(i=0;i<80;i++)
   {
     printf("-");
   }
printf("\n\n\t\t\tEnter any key to continue......\n");
getch();
clrscr();
printf("\n\n\n\n");
while(1)
   {
    clrscr();
   for(i=0;i<80;i++)
   {
    printf("-");
   }
printf("\n\n\n\n\n\t\t\t1-for create list\n\n");
printf("\t\t\t2-for sort list\n\n");
printf("\t\t\t3-search data item\n\n");
printf("\t\t\t4-insert item\n\n");
printf("\t\t\t5-delete item\n\n");
printf("\t\t\t6-display list\n\n");
printf("\t\t\t7-exit program\n\n\n\n\n");
for(i=0;i<80;i++)
   {
    printf("-");
   }

printf("\n\n\n\n\t\t\tenter your choice\n\t\t\t");
scanf("%d",&choice);
switch(choice)
   {
    case 1:
     clrscr();
     create();
     dis();
     break;
    case 2:
     //create();
     printf("before sorting\n\n\n");
     fflush(stdin);
     dis();
     fflush(stdin);
     sort();
     printf("\nafter sorting\n\n\n");
     fflush(stdin);
     dis();
     break;
    case 3:
     //create();
     dis();
     search();
     break;
    case 4:
     insert();
     //sort();
     dis();
     break;
    case 5:
     del();
     dis();
     break;
    case 6:
     dis();
     break;
    case 7:
     exit();
   default:
    printf("\n\n\t\t\twrong choice\n");
    getch();
    exit();
   }
getch();
}
}
void sort()
{
int choice,i,j,temp1,temp2,c=0;
char s[50],q[50];
struct table *p;
p=head;
while(p!=NULL)
   {
    c++;
    p=p->next;
   }
// printf("c=%d",c);
getch();
clrscr();
// do
//{
for(i=0;i<80;i++)
   printf("-");
printf("\n\n\n\t\t\tpress 1-sort by age\n");
printf("\t\t\tpress 2-sort by name\n");
printf("\t\t\tpress 3-sort by add\n");
printf("\t\t\tpress 4-sort by salary\n\n\n");

for(i=0;i<80;i++)
   printf("-");

printf("\n\n\n\t\t\tenter choice\n\t\t\t");
fflush(stdin);
scanf("%d",&choice);
fflush(stdin);
switch(choice)
   {

   case 1:
     for(i=1;i<=c;i++)
      {
       p=head;
       for(j=1;j<=c-i;j++)
    {
    if(p->next->age<p->age)
    {
    strcpy(s,p->next->name);
    strcpy(q,p->next->add);
    temp1=p->next->age;
    temp2=p->next->salary;
    strcpy(p->next->name,p->name);
    strcpy(p->next->add,p->add);
    p->next->age=p->age;
    p->next->salary=p->salary;
    strcpy(p->name,s);
    strcpy(p->add,q);
    p->age=temp1;
    p->salary=temp2;
    }
    p=p->next;
       }
    }
   break;
case 2:
      //c=1;
      for(i=1;i<c;i++)
      {
       p=head;
       for(j=1;j<=c-i;j++)
    {
    if((strcmp(p->next->name,p->name))<=0)
    {
    strcpy(s,p->next->name);
    strcpy(q,p->next->add);
    temp1=p->next->age;
    temp2=p->next->salary;
    strcpy(p->next->name,p->name);
    strcpy(p->next->add,p->add);
    p->next->age=p->age;
    p->next->salary=p->salary;
    strcpy(p->name,s);
    strcpy(p->add,q);
    p->age=temp1;
    p->salary=temp2;
    }
    p=p->next;
       }
     }
      break;
case 3:
     for(i=1;i<c;i++)
      {
       p=head;
       for(j=1;j<=c-i;j++)
    {
    if((strcmp(p->next->add,p->add))<0)
    {
    strcpy(s,p->next->name);
    strcpy(q,p->next->add);
    temp1=p->next->age;
    temp2=p->next->salary;
    strcpy(p->next->name,p->name);
    strcpy(p->next->add,p->add);
    p->next->age=p->age;
    p->next->salary=p->salary;
    strcpy(p->name,s);
    strcpy(p->add,q);
    p->age=temp1;
    p->salary=temp2;
    }
       p=p->next;
      }
    }
    break;
case 4:
     {
      for(i=1;i<c;i++)
      {
       p=head;
       for(j=1;j<=c-i;j++)
    {
    if(p->next->salary<p->salary)
    {
    strcpy(s,p->next->name);
    strcpy(q,p->next->add);
    temp1=p->next->age;
    temp2=p->next->salary;
    strcpy(p->next->name,p->name);
    strcpy(p->next->add,p->add);
    p->next->age=p->age;
    p->next->salary=p->salary;
    strcpy(p->name,s);
    strcpy(p->add,q);
    p->age=temp1;
    p->salary=temp2;
    }
    p=p->next;
       }
      }
    }
    break;
    }
}
void create()
{
FILE *j;
struct table *k,*l;
char ch;
char p[50],q[50];
int a,b,i;
    getch();
    clrscr();
    k=(struct table *)malloc(sizeof(struct table));
    head=k;
    for(i=0;i<80;i++)
    {
     printf("-");
    }
    printf("\n\n\t\t\tenter name\n\t\t\t");
    fflush(stdin);
    gets(p);
    printf("\n\t\t\tenter address\n\t\t\t");
    fflush(stdin);
    gets(q);
    printf("\n\t\t\tenter age\n\t\t\t");
    scanf("%d",&a);
    printf("\n\t\t\tenter salary\n\t\t\t");
    scanf("%d",&b);
    strcpy(k->name,p);
    strcpy(k->add,q);
    k->age=a;
    k->salary=b;
    k->next=NULL;

do
   {
    clrscr();
    for(i=0;i<80;i++)
     {
      printf("-");
     }
    l= (struct table *)malloc(sizeof(struct table));
    k->next=l;
    k=l;
    printf("\n\t\t\tenter name\n\t\t\t");
    fflush(stdin);
    gets(p);
    printf("\n\t\t\tenter address\n\t\t\t");
    fflush(stdin);
    gets(q);
    printf("\n\t\t\tenter age\n\t\t\t");
    scanf("%d",&a);
    printf("\n\t\t\tenter salary\n\t\t\t");
    scanf("%d",&b);
    strcpy(l->name,p);
    strcpy(l->add,q);
    l->age=a;
    l->salary=b;
    l->next=NULL;
    printf("\n\n\t\t\tenter choice (y/n)\n\t\t\t");
    fflush(stdin);
    scanf("%c",&ch);
    }while (ch!='n');
}
void search()
   {
    char na[10];
    int i,c=0,ag,j,choice;
    struct table *l,*p,*q;
    getch();
    clrscr();
    p=head;
    while(p!=NULL)
     {
      c++;
      p=p->next;
     }
    l=(struct table *)malloc(sizeof(struct table));
    l->next=NULL;
    p->next=l;

    for(i=0;i<80;i++)
    {
     printf("-");
    }
    printf("\n\n\t\t\t1-search by name\n");
    printf("\t\t\t2-search by address\n");
    printf("\t\t\t3-search by age\n");
    printf("\t\t\t4-search by salary\n\n");
    for(i=0;i<80;i++)
     {
      printf("-");
     }
    printf("\n\n\tenter your choice\n\n\t");
    fflush(stdin);
    scanf("%d",&choice);
    switch(choice)
     {
      case 1:
      printf("\n\n\n\n");
      for(i=0;i<80;i++)
       {
    printf("-");
       }
      printf("\n\n\tenter the name u want to serach\n\n\n\t");
      fflush(stdin);
      gets(na);
      p=head;
      printf("\tsearch complete data found \n\n\n");
      while(p->next!=NULL)
       {
    if((strcmp(p->name,na))==0)
    {

       printf("\t%s\t%s\t%d\t%d\n\n",p->name,p->add,p->age,p->salary);
    }
    p=p->next;
    j++;
       }
    if(p==NULL)
    {
    getch();
    clrscr();
    printf("serach complete data not found\n");
    }
    break;
   case 2:
      printf("\n\n\n\n");
      for(i=0;i<80;i++)
       {
    printf("-");
       }
      printf("\n\n\tenter the address u want to serach\n\n\n\t");
      fflush(stdin);
      gets(na);
      p=head;

      printf("\tsearch complete data found \n\n\n");
      while(p->next!=NULL)
       {
    if((strcmp(p->add,na))==0)
    {

       printf("\t%s\t%s\t%d\t%d\n\n",p->name,p->add,p->age,p->salary);
       }
    p=p->next;
       }
    if(p==NULL)
    {
    getch();
    clrscr();
    printf("\n\n\n\n\t\tserach complete data not found\n");
    }
    break;
    case 3:
     printf("\n\n\n\n");
      for(i=0;i<80;i++)
       {
    printf("-");
       }
      printf("\n\n\tenter the age u want to serach\n\n\n\t");
      fflush(stdin);
      scanf("%d",&ag);
      p=head;
      printf("\tsearch complete data found \n\n\n");
      while(p->next!=NULL)
       {
    if(p->age==ag)
    {

       printf("\t%s\t%s\t%d\t%d\n\n",p->name,p->add,p->age,p->salary);
    }
    p=p->next;
       }
    if(p==NULL)
    {
    getch();
    clrscr();
    printf("serach complete data not found\n");
    }
    break;
   case 4:
    printf("\n\n\n\n");
      for(i=0;i<80;i++)
       {
    printf("-");
       }
      printf("\n\n\tenter the salary u want to serach\n\n\n\t");
      fflush(stdin);
      scanf("%d",&ag);
      p=head;
      while(p->next!=NULL)
       {
    if(p->salary==ag)
    {
       printf("\t\n\nsearch complete data found \n\n\n");
       printf("\t%s\t%s\t%d\t%d\n\n\n",p->name,p->add,p->age,p->salary);
       break;
    }
    p=p->next;
       }
      if(p==NULL)
    {
    getch();
    clrscr();
    printf("serach complete data not found\n");
    }
        break;
   }
p=head;
while(p!=NULL)
     {
      q=p;
      p=p->next;
     }
   q->next=NULL;
   free(p);
}
void dis()
   {
    struct table *q;
    int i;
    clrscr();
    printf("\t\t\tNAME\tADDRESS\tAGE\tSALRY\n\n");
    printf("\n\n");
    for(i=0;i<80;i++)
     {
      printf("-");
     }
    q=head;
    while(q!=NULL)
     {
      printf("\n\n\t\t\t%s\t%s\t%d\t%d\n",q->name,q->add,q->age,q->salary);
      q=q->next;
     }
    printf("\n\n");
    for(i=0;i<80;i++)
     {
      printf("-");
     }
     getch();
    }
void insert()
   {
    int c=0,i,l,j,temp1,temp2;
    char s[50],p[50],q[50];
    struct table *ph,*m,*t;
    clrscr();
    for(i=0;i<80;i++)
     {
      printf("-");
     }
    printf("\n\n\n\n\t\t\tenter name\n\t\t\t");
    fflush(stdin);
    gets(p);
    printf("\n\n\n\n\t\t\tenter add\n\t\t\t");
    fflush(stdin);
    gets(q);
    printf("\n\n\n\n\t\t\tenter age\n\t\t\t");
    fflush(stdin);
    scanf("%d",&l);
    printf("\n\n\n\n\t\t\tenter salary\n\t\t\t");
    fflush(stdin);
    scanf("%d",&j);
    m=(struct table *)malloc (sizeof(struct table));
    m->next=NULL;
    strcpy(m->name,p);
    strcpy(m->add,q);
    m->age=l;
    m->salary=j;

    t=head;
    while(t->next!=NULL)
     {
      t=t->next;
     }
    t->next=m;
t=head;
while(t!=NULL)
   {
    c++;
    t=t->next;
   }
   for(i=1;i<c;i++)
      {
       ph=head;
       for(j=1;j<=c-i;j++)
    {
    if((strcmp(ph->next->name,ph->name))<=0)
    {
    strcpy(s,ph->next->name);
    strcpy(q,ph->next->add);
    temp1=ph->next->age;
    temp2=ph->next->salary;
    strcpy(ph->next->name,ph->name);
    strcpy(ph->next->add,ph->add);
    ph->next->age=ph->age;
    ph->next->salary=ph->salary;
    strcpy(ph->name,s);
    strcpy(ph->add,q);
    ph->age=temp1;
    ph->salary=temp2;
    }
    ph=ph->next;
       }
     }
}
void del()
   {
      int i,choice,gh;
      char n[50];
      struct table *p,*q;
      clrscr();
      for(i=0;i<80;i++)
       printf("-");
      printf("\n\n\n\t\t\t1-del by name\n");
      printf("\n\t\t\t2-del by add\n");
      printf("\n\t\t\t3-del by age\n");
      printf("\n\t\t\t4-del by salary\n\n\n");
      for(i=0;i<80;i++)
       printf("-");
      printf("\n\t\t\tEnter your choice\n\t\t\t");
      fflush(stdin);
      scanf("%d",&choice);
      switch(choice)
       {
    case 1:
    for(i=0;i<80;i++)
    printf("-");
    printf("\n\n\n\t\t\tenter name to delete\n\t\t\t");
    fflush(stdin);
    gets(n);
    p=head;
    if((p==head)&&(strcmp(p->name,n)==0))
    {
       head=p->next;
       free(p);
    }
    else
    {
    while(p!=NULL)
    {
       if(strcmp(p->name,n)==0)
        {
          break;
        }
        q=p;
        p=p->next;
    }
    q->next=p->next;
    free(p);
    }
    if(p==NULL)
    {
       q->next=NULL;
       free(p);
    }
    break;
    case 2:
    for(i=0;i<80;i++)
    printf("-");
    printf("\n\n\n\t\t\tenter add to delete\n\t\t\t");
    fflush(stdin);
    gets(n);
    p=head;
    if((p==head)&&(strcmp(p->add,n)==0))
    {
       head=p->next;
       free(p);
    }
    else
    {
    while(p!=NULL)
    {
       if(strcmp(p->add,n)==0)
        {
          break;
        }
        q=p;
        p=p->next;
    }
    q->next=p->next;
    free(p);
    }
    if(p==NULL)
    {
       q->next=NULL;
       free(p);
    }

    break;
       case 3:
    for(i=0;i<80;i++)
    printf("-");
    printf("\n\n\n\t\t\tenter age to delete\n\t\t\t");
    fflush(stdin);
    scanf("%d",&gh);
    p=head;
    if((p==head)&&(p->age==gh))
    {
       head=p->next;
       free(p);
    }
    else
    {
    while(p!=NULL)
    {
       if((p->age==gh))
        {
          break;
        }
        q=p;
        p=p->next;
    }
    q->next=p->next;
    free(p);
    }
    if(p==NULL)
    {
       q->next=NULL;
       free(p);
    }

    break;
       case 4:
    for(i=0;i<80;i++)
    printf("-");
    printf("\n\n\n\t\t\tenter salary to delete\n\t\t\t");
    fflush(stdin);
    scanf("%d",&gh);
    p=head;
    if((p==head)&&((p->salary==gh)))
    {
       head=p->next;
       free(p);
    }
    else
    {
    while(p!=NULL)
    {
       if((p->salary==gh))
        {
          break;

        }
        q=p;
        p=p->next;
    }
    q->next=p->next;
    free(p);
    }
    if(p==NULL)
    {
       q->next=NULL;
       free(p);
    }
    break;
       }
      }
_____________________________________________________________________________________
JUST USE IT BY COPY PASTING THE CODE AND SAVE THE FILE AS anyname.c THEN COMPILE IT AND USE , ANY DOUBT CAN BE ASKED...
U CAN CATCHME AT http://www.facebook.com/salokr.

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!
!!!!!HAPPY PROGRAMMING !!!!!

Gauss-Siedel Implementation Through C

2012-08-10T04:07:00.004-07:00

Gauss-Siedel Implementation Through C :-
------------------------------

------------------------------

------------------------------

---------
#include<stdio.h>
#include<conio.h>
void main()
{
float x1,x2,x3,it1,it2,it3,a,b,c,d1,

i,j,k,d2,p,q,r,d3;
int m;
clrscr();
printf("Enter Coefficients For First Equation");

scanf("\n%f %f %f %f",&a,&b,&c,&d1);
printf("\nEnter Coefficient For second Equation");
scanf("\n%f %f %f %f",&p,&q,&r,&d2);
printf("Enter Coefficient For Thirs Equation");
scanf("\n%f %f %f %f",&i,&j,&k,&d3);
x1=0;
x2=0;
x3=0;
for(m=1;m<=5;m++)
{
it1=(d1-b*x2-c*x3)/a;
x1=it1;
it2=(d2-p*x1-r*x3)/q;
x2=it2;
it3=(d3-x1*i-x2*j)/k;
x3=it3;
printf("\nThe Three Coefficients Are X1= %f X2=%f and X3=%f",x1,x2,x3);
}
printf("\nThe Three Coefficients Are X1= %f X2=%f and X3=%f",x1,x2,x3);
getch();
}

!!! THANKS FOR READING !!!
!!!!!HAPPY PROGRAMMING !!!!!

NEWTON'S FORWARD DIFFERNECE TABLE

2012-08-10T03:54:00.000-07:00

NOW I'M GOING TO DEMONSTRATE YOU A PROGRAM ON NEWTON'S FORWARD DIFFERNECE TABLE WHICH IS USED IN NUMERICAL TECHNIQUES :-
#include<stdio.h>
#include<conio.h>
void main()
{
float x[50],y[50],table[50][50];
int i,j,n;
clrscr();
printf("\nEnter Table Size ");

scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("\nEnter Value for X[%d]",i+1);
scanf("%f",&x[i]);
printf("\nEnter Value For Y[%d]",i+1);
scanf("%f",&y[i]);
}
printf("\nThe Tabulated Value Is ");
printf("\n");
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
{
if(i==0)
table[i][j]=y[j+1]-y[j];
else
table[i][j]=(table[i-1][j+1])-(table[i-1][j]);
}
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
printf("\t%f",table[i][j]);
printf("\n");
}
getch();
}

!!! HOPE U LIKE IT !!!

!!! THANKS FOR READING !!!
!!!!!HAPPY PROGRAMMING !!!!!

LINKED LIST ADDITION OF TWO NUMBERS

2012-08-10T03:38:00.000-07:00

THIS IS THE SIMPLEST LINKED LIST ADDITION PROGRAM

_____________________________________________________________________________________

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct ll
{
int digit;
struct ll *next;
}number;
void add(number **hd,int i);
void traverse(number *hd);
void reverse(number **hd);
void adds(char a[],number **hd);
void addhead(number *hd1,number *hd);
void freeh(number **hd);
number *head3;
void main()
{
number *head1=NULL,*head2=NULL;
char a[500],b[500],c[500];
char i;
clrscr();
printf("\nEnter First Number \n");
gets(a);
printf("\nEnter Second Number \n");
gets(b);
adds(a,&head1);
adds(b,&head2);
addhead(head1,head2);
printf("\nAnswer Is \n");
traverse(head3);
freeh(&head1);
freeh(&head2);
*////////////////////////////////////
getch();
}
///////////////////////////////////////////////////
void freeh(number **hd)
{
number *temp;
while(*hd!=NULL)
{
temp=*hd;
*hd=(*hd)->next;
free(temp);
}
*hd=NULL;
}
void add(number **hd,int i)
{
number *t;
t=(number*)malloc(sizeof(number));
t->next=NULL;
t->digit=i;
if(*hd==NULL)
{
*hd=t;
return;
}
t->next=*hd;
*hd=t;
}
///////////////////////////////////////////////////
void traverse(number *hd)
{
printf("\n");
while(hd!=NULL)
{
printf("%d",hd->digit);
hd=hd->next;
}
}
//////////////////////////////////////////////////
void reverse(number **hd)
{
number *p,*q,*r;
if(*hd==NULL)
return;
p=*hd;
if(p->next==NULL)
return;
q=p->next;
if(q->next==NULL)
{
q->next=p;
p->next=NULL;
*hd=q;
return;
}
r=q->next;
while(r->next!=NULL)
{
q->next=p;
p=q;
q=r;
r=r->next;
}
q->next=p;
r->next=q;
(*hd)->next=NULL;
*hd=r;

}
void addhead(number *hd1,number *hd2)
{
int x,carry=0,sum=0;
reverse(&hd1);
reverse(&hd2);
while(hd1!=NULL&&hd2!=NULL)
{
x=(hd1)->digit+(hd2)->digit + carry;
sum=x % 10;
carry=x / 10;
add(&head3,sum);
hd1=(hd1)->next;
hd2=(hd2)->next;
}
if(hd1==NULL&&hd2!=NULL)
{
while(hd2!=NULL)
{
x=(hd2)->digit + carry;
sum=x % 10;
carry=x / 10;
add(&head3,sum);
hd2=(hd2)->next;
}
}
else if(hd1!=NULL&&hd2==NULL)
{
while(hd1!=NULL)
{
x=(hd1)->digit + carry;
sum=x % 10;
carry=x / 10;
add(&head3,sum);
hd1=(hd1)->next;
}
}
if(carry>0)
add(&head3,carry);
reverse(&hd1);
reverse(&hd2);
//reverse(hd3);
}
void adds(char a[],number **hd)
{
int i=0;
while(a[i]!= '\0')
{
add(hd,a[i]- '0');
i++;
}
reverse(hd);
}
_____________________________________________________________________________________

_____________________________________________________________________________________

!!! THANKS FOR READING !!!
!!!!!HAPPY PROGRAMMING !!!!!