DOWNLOAD 'C' LANGUAGE PROGRAMS AND E-BOOKS

http://rapidshare.com/users/I4PJUB
http://rapidshare.com/users/3XDUOH?byfilename=1
http://rapidshare.com/users/2L249T
http://rapidshare.com/users/F83VON
http://rapidshare.com/users/MQUWKO

Stack using one dimensional array

#include
#include
#include

void push(int a[],int *t)
{
if (*t >= 4)
printf ("Stack is full\n ");
else
{
*t = *t + 1;
printf ("Enter number ");
scanf ("%d",&a[*t]);
}

}

int pop (int a[],int *top)
{
int t = 0;
if (*top == 0)
printf ("Stack is empty \n");
else
{
t=a[*top];
*top= *top -1 ;
}
return t;
}

void prn(int a[],int top)
{
int i;
for (i=4;i>=0;i--)
if (i>top)
cout<<"0"<<<> << top="-1;" ch="0;" class="smller">Circular Queue

#include
#include
#include

// Declaration

int a[5];
int front=0,rear=-1;
int x;

void get ()
{
int x;

if ((rear + 1)%5 == front && rear > -1 )
{
cout << "que is full"; getch(); } else { cout << "Enter element to be added "; cin >> x;

rear = (rear + 1)%5;
// cout << t="0;" rear ="="" t =" a[front];" front ="="" front =" 0;" rear =" -1;" front =" (front" t =" front;" rear ="="" t =" (t" i="0;i<="4;i++)">;


}
// front = t;
}

void main()
{

int ch=1;
clrscr();
while (ch!=4)
{
clrscr();

cout <<>> ch;

switch(ch)
{
case 1: get();
// cout << front =" 1;" rear =" 0;" class="smller">Bubble sort

#include
#include
#include

void main()
{
int a[50];
int i=0,t;

clrscr();

cout << "Enter data element "; cin >> t;

while(t != 666)
{
clrscr();

a = t;

cout << "Enter data element "; cin >> t;

i++;
}

i--;
t=i;



for (i=0;i<=t;i++) for (int j=i+1;j<=t;j++) if (a[j])
{
a = a[j]*a;
a[j] = a/a[j];
a = a/a[j];
}


for (i=0;i<=t;i++) cout <<> << " " ; getch(); }

BFS


#include
#include
int g[20][20],visited [20],v,e ;
struct queue
{
int a[20],front,rear;
}q;
void creategraph()
{
int i,j,a,b;
printf ("enter number of vertices");
scanf("%d",&v);
printf("enter number of edges");
scanf("%d",& e);
for(i=1;i<=v;i++) for(j=1;j<=v;j++); g[j]=0;
for(i=1;i<=e;i++) { printf("enter edge information (a,b) "); scanf("%d %d ",& a,&b); g[a]=g[a]=1;
}
}
void insert(int k,struct queue *q)
{
q->rear++;
q->a[q->rear]=k;
if(q->front == -1)
q->front=0;
}
int delqueue(struct queue *q)
{
int x;
x=q->a[q->front];
if (q->front == q->rear)
q->front =q->rear=-1;
else
q->front ++;
return x;
}
int found(int k,struct queue *q)
{
int i;
for(i=0;i<=q->rear;i++)
if(q->a==k)
return 1;
return 0;
}

int empty(struct queue *q)
{
return(q->front == -1);
}
void bfs(int k)
{
int i;
insert(k,&q);
while(!empty(&q))
{
k=delqueue(&q);
printf("%d",k);
visited[k]=1;
for(i=1;i<=v;i++) { if(g[k]== 1 && visited != 1 && !found(i,&q))
{
insert (i,&q);
}
}
}
}
void main()
{


q.front = q.rear = -1;
creategraph();
bfs(1);


}

for more programs checkout
http://www.cs.auckland.ac.nz/software/AlgAnim/ds_ToC.html