Вы находитесь на странице: 1из 51

# LAB MANUAL

FOR

Data Structures and algorithms

Data Structures and algorithms

CSE-205E Class work : 50
Exam : 50

Syllabus for lab work

1 Write a program to search an element in a two dimensional array
2 Using iteration and recursion concepts write programs for finding the element in
the array using the Binary search method.
3 Write a program to perform following operations on tables using functions only -
4 Write a program using iteration and recursion concepts for quick sort.
5 Write a program to implement various operations on strings.
6 Write a program for swapping two numbers using call by value and call by
reference strategies.
7 Write a program to implement Binary search tree.
8 Write a program to create a Linked List and perform operations such as insert,
delete, update and reverse.
9 Write a program to simulate various sorting and searching algorithms.
10 Write a program to simulate various Graph traversing techniques.
11 Write a program to simulate various tree traversal techniques.
Hardware and Software requirement

Software Requirements:

Language: C

Hardware Requirement:

Processor : 386 and above
RAM : 16 MB
HDD Space : 8 MB

Rational for data structure lab

Serves as a visual guide to the material presented during your lectures. The aim of this
course is to provide an introduction to computer algorithms and data structures, with an
emphasis on foundational material
Objectives
At the end of the course students should
have a good understanding of how several fundamental algorithms work,
particularly those concerned with sorting and searching
have a good understanding of the fundamental data structures used in computer
science
be able to analyze the space and time efficiency of most algorithms
be able to design new algorithms or modify existing ones for new applications
and reason about the efficiency of the result

ASSIGNMENT NO 1

ALGORITHM TO SEARCH AN ELEMENT USING
LINEAR SEARCH

1. Set k :=1 & loc : =0
2. Repeat step 3 & 4 while loc : =0 &k <=n
3. If (item =data[k])
loc : =k
Else
K =k +1
4. If loc : =0 ,then
Else
Print loc is the location of item
5. Exit

linear search
#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
voi d mai n( )
{
i nt a[ 100] , n, i , i t em, l oc=- 1;
cl r scr ( ) ;
pr i nt f ( " \ nEnt er t he number of el ement : " ) ;
scanf ( " %d" , &n) ;
pr i nt f ( " Ent er t he number : \ n" ) ;
f or ( i =0; i <=n- 1; i ++)
{
scanf ( " %d" , &a[ i ] ) ;
}
pr i nt f ( " Ent er t he no. t o be sear ch\ n" ) ;
scanf ( " %d" , &i t em) ;
f or ( i =0; i <=n- 1; i ++)
{
i f ( i t em==a[ i ] )
{
l oc=i ;
br eak;
}
}
i f ( l oc>=0)

pr i nt f ( " \ n%di s f ound i n posi t i on%d" , i t em, l oc+1) ;
el se
pr i nt f ( " \ nI t emdoes not exi t s" ) ;
get ch( ) ;
}

ASSIGNMENT NO 2

ALGORITHM TO SEARCH AN ELEMENT USING
BINARY SEARCH

1. low =1,high =n
2. Repeat step 3 to 5 while low <=high
3. mid =(low +high)
4. If a[mid] =x
Print found at mid
Return
5. If (a[mid] <x)
low =mid +1
Else
High =mid 1
7. Exit

//binary search
#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
voi d mai n( )
{
i nt a[ 100] , i , l oc, mi d, beg, end, n, f l ag=0, i t em;
cl r scr ( ) ;
pr i nt f ( " How many el ement s" ) ;
scanf ( " %d" , &n) ;
pr i nt f ( " Ent er t he el ement of t he ar r ay\ n" ) ;
f or ( i =0; i <=n- 1; i ++)
{
scanf ( " %d" , &a[ i ] ) ;
}
pr i nt f ( " Ent er t he el ement t o be sear chi ng\ n" ) ;
scanf ( " %d" , &i t em) ;
l oc=0;
beg=0;
end=n- 1;
whi l e( ( beg<=end) &&( i t em! =a[ mi d] ) )
{
mi d=( ( beg+end) / 2) ;
i f ( i t em==a[ mi d] )
{
pr i nt f ( " sear ch i s successf ul l \ n" ) ;
l oc=mi d;
pr i nt f ( " posi t i on of t he i t em%d\ n" , l oc+1) ;
f l ag=f l ag+1;
}
i f ( i t em<a[ mi d] )
end=mi d- 1;
el se
beg=mi d+1;
}
i f ( f l ag==0)
{
pr i nt f ( " sear ch i s not successf ul l \ n" ) ;
}
get ch( ) ;
}

ASSIGNMENT NO 3

Algorithm

Matmul(a,b,m,n,p)
1 for(i=1 to m)
2 for(j =1 to p)
3 c[i][j] =0;
4 for(k=1to n)
5 c[i][j] =c[i][j]+a[i][j]*b[i][j]
6 exit

matrix multiplication

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
voi d mai n( )
{
i nt a[ 2] [ 2] , b[ 2] [ 2] , s[ 2] [ 2] ;
i nt i , j , k;
cl r scr ( ) ;
pr i nt f ( " Ent er f i r st mat r i x: \ n" ) ;
f or ( i =1; i <=2; i ++)
{
f or ( j =1; j <=2; j ++)
{
pr i nt f ( " Ent er %d%d\ n" , i , j ) ;
scanf ( " %d" , &a[ i ] [ j ] ) ;
}
}
pr i nt f ( " Ent er second mat r i x: \ n" ) ;
f or ( i =1; i <=2; i ++)
{
f or ( j =1; j <=2; j ++)
{
pr i nt f ( " Ent er %d%d\ n" , i , j ) ;
scanf ( " %d" , &b[ i ] [ j ] ) ;
}
}

f or ( i =1; i <=2; i ++)
{
f or ( j =1; j <=2; j ++)
{
s[ i ] [ j ] =0;
f or ( k=1; k<=2; k++)
{
s[ i ] [ j ] =s[ i ] [ j ] +a[ i ] [ k] *b[ k] [ j ] ;
}
}
}

pr i nt f ( " Mat r i x Mul t i pl i cat i on I s: \ n" ) ;
f or ( i =1; i <=2; i ++)
{
f or ( j =1; j <=2; j ++)
{
pr i nt f ( " %d\ n" , s[ i ] [ j ] ) ;
}
}
get ch( ) ;
}

Algorithm

1 for (i=1 to m
2 for(j=1 to n)
3c[i][j] =a[i][j]+b[i][j]
4 exit

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
voi d mai n ( )
{
i nt a[ 2] [ 2] , b[ 2] [ 2] , s[ 2] [ 2] , i , j ;
cl r scr ( ) ;
pr i nt f ( " ent er f i r st mat r i x: \ n" ) ;
f or ( i =1; i <=2; i ++)
{
f or ( j =1; j <=2; j ++)
{
pr i nt f ( " Ent er %d%d" , i , j , " el ement : " ) ;
scanf ( " %d" , &a[ i ] [ j ] ) ;
}
}
pr i nt f ( " ent er second mat r i x: \ n" ) ;
f or ( i =1; i <=2; i ++)
{
f or ( j =1; j <=2; j ++)
{
pr i nt f ( " ent er %d%d" , i + 1 , j + 1 , " el ement : " ) ;
scanf ( " %d" , &b[ i ] [ j ] ) ;
}
}
f or ( i =1; i <=2; i ++)
{
f or ( j =1; j <=2; j ++)
{
s[ i ] [ j ] = a[ i ] [ j ] +b[ i ] [ j ] ;
}
}
pr i nt f ( " The addi t i on mat r i x i s: \ n" ) ;
f or ( i =1; i <=2; i ++)
{
f or ( j =1; j <=2; j ++)
{
pr i nt f ( " %d\ n" , s[ i ] [ j ] ) ;
}
}
get ch ( ) ;
}

Algorithm

Tr anspose( a, m, n)
1 f or ( i = 1 t o m)
f or ( j = 1 t o n)
b[ i ] [ j ] = a[ j ] [ i ]
2 f or ( i =1t o m)
f or ( j = 1t o n)
a[ i ] [ j ] = b[ i ] [ j ]
exi t

transpose of a matrix
#i ncl ude<st di o. h>
# i ncl ude<coni o. h>
voi d mai n( )
{
i nt a[ 10] [ 10] , b[ 10] [ 10] , i , j , m, n;
cl r scr ( ) ;
pr i nt f ( " Ent er t he or der of t he mat r i x\ n" ) ;
pr i nt f ( " No. of r ows : \ n" ) ;
scanf ( " %d" , &n) ;
pr i nt f ( " No. of col umns : \ n " ) ;
scanf ( " %d" , &m) ;
pr i nt f ( " Ent er t he mat r i x el ement s\ n" ) ;
f or ( i =0; i <=n- 1; i ++)
{
f or ( j =0; j <=m- 1; j ++)
{
scanf ( " %d\ n" , &a[ i ] [ j ] ) ;
b[ j ] [ i ] = a[ i ] [ j ] ;
}
}
pr i nt f ( " Mat r i x A was\ n " ) ;
f or ( i =0; i <=n- 1; i ++)
{
f or ( j =0; j <=m- 1; j ++)
{
pr i nt f ( " %d\ n" , a[ i ] [ j ] ) ;
}
}
pr i nt f ( " Tr anspose of mat r i x A i s \ n" ) ;
f or ( i =0; i <=m- 1; i ++)
{
f or ( j =0; j <=n- 1; j ++)
{
pr i nt f ( " %d\ n" , b[ i ] [ j ] ) ;
}
}
get ch( ) ;
}
ASSIGNMENT NO 4

ALGORITHM TO SORT ARRAY USING QUICK SORT

1. low =l, high =h, key a[(l+h)/2]
2. Repeat through step 7 while (low <=high)
3. Repeat step 4 while (a[low] <key)
4. low =low +1
5. Repeat step 6 while (a[high] >key)
6. high =high 1
7. If (low <=high)
a) temp =a[low]
b) a[low] =a[high]
c) a[high] =temp
d) low =low +1
e) high =high +1
8. If (l <high) quicksort (a,l,high)
9. If (h>low) quicksort (a,low,h)
10. Exit

quick sort

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
#def i ne max 100
i nt a[ max] , n, i , l , h;
voi d mai n( )
{
voi d i nput ( voi d) ;
i nput ( ) ;
get ch( ) ;
}

voi d i nput ( voi d)
{
voi d out put ( i nt a[ ] , i nt n) ;
voi d qui ck_sor t ( i nt a[ ] , i nt l , i nt h) ;
pr i nt f ( " How many el ement s i n t he ar r ay : " ) ;
scanf ( " %d" , &n) ;
pr i nt f ( " \ n" ) ;
pr i nt f ( " Ent er t he el emennt s : \ n" ) ;
f or ( i =0; i <=n- 1; i ++)
{
scanf ( " %d" , &a[ i ] ) ;
}
l =0;
h=n- 1;
qui ck_sor t ( a, l , h) ;
pr i nt f ( " Sor t ed Ar r ay : \ n " ) ;
out put ( a, n) ;
}

voi d qui ck_sor t ( i nt a[ ] , i nt l , i nt h)
{
i nt t emp, key, l ow, hi gh;
l ow=l ;
hi gh=h;
key=a[ ( l ow+hi gh) / 2] ;
do
{
whi l e( key>a[ l ow] )
{
l ow++;
}
whi l e( key<a[ hi gh] )
{
hi gh- - ;
}
i f ( l ow<=hi gh)
{
t emp=a[ l ow] ;
a[ l ow++] =a[ hi gh] ;
a[ hi gh- - ] =t emp;
}
} whi l e( l ow<=hi gh) ;
i f ( l <hi gh)
qui ck_sor t ( a, l , hi gh) ;
i f ( l ow<h)
qui ck_sor t ( a, l ow, h) ;
}
voi d out put ( i nt a[ ] , i nt n)
{
f or ( i =0; i <=n- 1; i ++)
{
pr i nt f ( " %d\ n" , a[ i ] ) ;
}
}
ASSIGNMENT NO 5
ALGORITHM TO IMPLEMENT BINARY SEARCH
TREE

INSERTION
1. t =newnode
2. t info =n
3. t left =t right =NULL
4. If (root =NULL)
root =t
return
5. ptr =root
6. Repeat step 7 until ptr =NULL
7. If (ptr info >n)
If (ptr left =NULL)
Ptr left =t
Return
Else
Ptr =ptr left
Else
If (ptr right =NULL)
Ptr right =t
Return
Else
Ptr =ptr right

DELETION
1. If (root =NULL)
Print Empty tree
Return
2. ptr =root, par =NULL
3. Repeat step 4 & 5 until (ptr info =n or ptr =NULL)
4. par =ptr
5. If (ptr info >n)
ptr =ptr left

Else
Ptr =ptr right
6. If ptr =NULL
print no. not present

//BST
#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
st r uct r ec
{
l ong num;
st r uct r ec *l ef t ;
st r uct r ec *r i ght ;
};
st r uct r ec *t r ee, *second, *head;
st r uct r ec *i nser t ( st r uct r ec *t r ee, l ong num) ;
st r uct r ec *copy( st r uct r ec *t r ee) ;
voi d i nor der ( st r uct r ec *t r ee) ;
mai n( )
{
i nt choi ce;
l ong di gi t ;
do
{
choi ce=sel ect ( ) ;
swi t ch( choi ce)
{
case 1: put s( " Ent er i nt eger s: To qui t ent er 0" ) ;
scanf ( " %l d" , &di gi t ) ;
whi l e( di gi t ! =0)
{
t r ee=i nser t ( t r ee, di gi t ) ;
scanf ( " %l d" , &di gi t ) ;
}cont i nue;
case 2: copy( t r ee) ; cont i nue;
case 3: put s( " I nor der t r aver si ng TREE" ) ;
i nor der ( t r ee) ; cont i nue;
case 4: put s( " END" ) ; exi t ( 0) ;
}
}whi l e( choi ce! =4) ;
}
i nt sel ect ( )
{
i nt sel ect i on;
do
{
put s( " Ent er 1: I nser t a node i n t he BST" ) ;
put s( " Ent er 2: Copy a t r ee t o anot her BST" ) ;
put s( " Ent er 3: Di spl ay( i nor der ) t he BST" ) ;
put s( " Ent er 4: END" ) ;
put s( " Ent er your choi ce" ) ;
scanf ( " %d" , &sel ect i on) ;
i f ( ( sel ect i on<1) | | ( sel ect i on>4) )
{put s( " Wr ong choi ce: Tr y agai n" ) ;
get char ( ) ;
}
}whi l e( ( sel ect i on<1) | | ( sel ect i on>4) ) ;
r et ur n sel ect i on;
}
st r uct r ec *i nser t ( st r uct r ec *t r ee, l ong di gi t )
{
i f ( t r ee==NULL)
{
t r ee=( st r uct r ec *) mal l oc( si zeof ( st r uct r ec) ) ;
t r ee- >l ef t =t r ee- >r i ght =NULL;
t r ee- >num=di gi t ;
}
el se
i f ( di gi t <t r ee- >num)
t r ee- >l ef t =i nser t ( t r ee- >l ef t , di gi t ) ;
el se i f ( di gi t >t r ee- >num)
t r ee- >r i ght =i nser t ( t r ee- >r i ght , di gi t ) ;
el se i f ( di gi t ==t r ee- >num)
{put s( " Dupl i cat e nodes: pr ogr amexi t ed" ) ; exi t ( 0) ;
}
r et ur n( t r ee) ;
}
st r uct r ec *copy( st r uct r ec *t r ee)
{
second=( st r uct r ec *) mal l oc( si zeof ( st r uct r ec) ) ;
i f ( t r ee! =NULL)
{
second- >num=t r ee- >num;
i f ( t r ee- >l ef t ! =NULL)
{
second- >l ef t - >num=t r ee- >l ef t - >num;
copy( t r ee- >r i ght ) ;
}
i f ( t r ee- >r i ght ! =NULL)
{
second- >r i ght - >num=t r ee- >num;
copy( t r ee- >l ef t ) ;
}
}
r et ur n( head) ;
}
voi d i nor der ( st r uct r ec *t r ee)
{
i f ( t r ee! =NULL)
{
i nor der ( t r ee- >l ef t ) ;
pr i nt f ( " %12l d\ n" , t r ee- >num) ;
i nor der ( t r ee- >r i ght ) ;
}
}
ASSIGNMENT NO 6

1. t =newmode( )
2. Enter info to be inserted
4. t info =n
5. t next =start
6. Start =t

INSERTION
BEGIN
1. t next =start
2. start =t
Return
MIDDLE
1. Enter info of the node after which new node to be inserted
3. p =start
4. Repeat step 5 until p info <>x
5. p =p next
6. t next =p next
7. p next =t
8. Return

LAST
1. p =start
2. Repeat step 3 until p next NULL
3. p =p next
4. t next =NULL
5. p next =t
6. Return

DELETION
BEGIN
1. x =start
2. start =start next
3. delnode(x)

MIDDLE
1. Enter the info of node to be deleted
3. p =start
4. c =start
5. while (c info <>NULL)
p =c
c =c next
6. p next =c next
7. delnode ( c )
8. Return

LAST
1. p =start
c =start
2. while (cnext <>NULL)
p =c
c =cnext
3. p next =c next
4. delnode ( c)
5. Return

TRAVERSAL
1. p =start
2. while (p <>NULL)
Print p info
P =p next
3. Return

/ / l i nked l i st / /

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
#i ncl ude<mal l oc. h>
st r uct node
{
i nt i nf o;
st r uct node *next ;
};
t ypedef st r uct node NODE;
NODE *st ar t ;
voi d cr eat empt yl i st ( NODE **st ar t )
{
*st ar t =( NODE *) NULL;
}
voi d t r aver si nor der ( NODE *st ar t )
{
whi l e( st ar t ! = ( NODE *) NULL)
{
pr i nt f ( " %d\ n" , st ar t - >i nf o) ;
st ar t =st ar t - >next ;
}
}
voi d i nser t at begi n( i nt i t em)
{
NODE *pt r ;
pt r =( NODE *) mal l oc( si zeof ( NODE) ) ;
pt r - >i nf o=i t em;
i f ( st ar t ==( NODE *) NULL)
pt r - >next =( NODE *) NULL;
el se
pt r - >next =st ar t ;
st ar t =pt r ;
}
voi d i nser t _at _end( i nt i t em)
{
NODE *pt r , *l oc;
pt r =( NODE *) mal l oc( si zeof ( NODE) ) ;
pt r - >i nf o=i t em;
pt r - >next =( NODE *) NULL;
i f ( st ar t ==( NODE*) NULL)
st ar t =pt r ;
el se
{
l oc=st ar t ;
whi l e( l oc- >next ! =( NODE *) NULL)
l oc=l oc- >next ;
l oc- >next =pt r ;
}
}
voi d i nser t _spe( NODE *st ar t , i nt i t em)
{
NODE *pt r , *l oc;
i nt t emp, k;
f or ( k=0, l oc=st ar t ; k<t emp; k++)
{
l oc=l oc- >next ;
i f ( l oc==NULL)
{
pr i nt f ( " node i n t he l i st at l ess t han one\ n" ) ;
r et ur n;
}
}
pt r =( NODE *) mal l oc( si zeof ( NODE) ) ;
pt r - >i nf o=i t em;
pt r - >next =l oc- >next ; ;
l oc- >next =pt r ;
}
voi d mai n( )
{
i nt choi ce, i t em, af t er ;
char ch;
cl r scr ( ) ;
cr eat empt yl i st ( st ar t ) ;
do
{
pr i nt f ( " 1. I nser t el ement at begi n \ n" ) ;
pr i nt f ( " 2. i nser t el ement at end posi t on\ n" ) ;
pr i nt f ( " 3. i nser t speci f i c t he posi t i on\ n" ) ;
pr i nt f ( " 4. t r aver s t he l i st i n or der \ n" ) ;
pr i nt f ( " 5. exi t \ n" ) ;
pr i nt f ( " ent er your choi ce\ n" ) ;
scanf ( " %d" , &choi ce) ;
swi t ch( choi ce)
{
case 1: pr i nt f ( " Ent er t he i t em\ n" ) ;
scanf ( " %d" , &i t em) ;
i nser t at begi n( i t em) ;
br eak;
case 2: pr i nt f ( " Ent er t he i t em\ n" ) ;
scanf ( " %d" , &i t em) ;
i nser t _at _end( i t em) ;
br eak;
case 3: pr i nt f ( " Ent er t he i t em\ n" ) ;
scanf ( " %d" , &i t em) ;
i nser t _spe( st ar t , i t em) ;
br eak;
case 4: pr i nt f ( " \ nt r aver s t he l i st \ n" ) ;
t r aver si nor der ( st ar t ) ;
br eak;
case 5: r et ur n;
}
f f l ush( st di n) ;
pr i nt f ( " do your want cont i nous\ n" ) ;
scanf ( " %c" , &ch) ;
}whi l e( ( ch=' y' ) | | ( ch=' y' ) ) ;
get ch( ) ;
}

ASSIGNMENT NO 7
LIST

1. t =new node
2. Enter the info to be inserted
4. t info =n
5. t next =NULL
6. t prev NULL

INSERTION
BEGIN
1. If start =NULL
start =t
2. else
t next =NULL
t next prev =t
start =t
Return

MIDDLE
1. Print enter info of the node after which you want to insert
3. p =start
4. Repeat while p<>NULL
If (p info =n)
tnext =p next
pnext =t
t prev =p
p next prev =t
Return
Else
P =p next

tnext =NULL
pnext =t

DELETION
BEGIN
1. p =start
2. pnextprev =NULL
3. start =pnext
4. start =pnext
5. delnode(p)
6. Return

MIDDLE
1. Enter info of the node to be deleted
3. p =start
4. Repeat until p<>NULL
If(pinfo =x)
pprevnext =pnext
p next prev =pprev
delnode(p)
Return
Else
P =p next

LAST
1. P =start
2. Repeat while p<>NULL
If(pnext =NULL)
Delnode(p)
3. Return

DISPLAY
1. p =start
2. Repeat while p <>NULL
Print pinfo
P =p next

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
i nt sel ect ( ) ;
st r uct r ec
{
char name[ 80] ;
st r uct r ec *next ;
};
st r uct r ec *r ear ;
st r uct r ec *cr eat e( st r uct r ec *l i st ) ;
st r uct r ec *i nser t 1( st r uct r ec *node) ;
st r uct r ec *i nser t 2( st r uct r ec *node) ;
st r uct r ec *i nser t 3( st r uct r ec *node) ;
st r uct r ec *i nser t 4( st r uct r ec *node) ;
st r uct r ec *del et e( st r uct r ec *node) ;
voi d *di spl ay( st r uct r ec *l i st ) ;
i nt nodes;
mai n( )
{
st r uct r ec *f i r st =NULL;
i nt choi ce;
cl r scr ( ) ;
do
{
choi ce=sel ect ( ) ;
swi t ch( choi ce)
{
case 1: f i r st =cr eat e( f i r st ) ; cont i nue;
case 2: f i r st =i nser t 1( f i r st ) ; cont i nue;
case 3: f i r st =i nser t 2( f i r st ) ; cont i nue;
case 4: f i r st =i nser t 3( f i r st ) ; cont i nue;
case 5: f i r st =i nser t 4( f i r st ) ; cont i nue;
case 6: f i r st =del et e( f i r st ) ; cont i nue;
case 7: di spl ay( f i r st ) ; cont i nue;
case 8: put s( " END" ) ; exi t ( 0) ;
}
}whi l e( choi ce! =8) ;
}
i nt sel ect ( )
{
i nt sel ect i on;
do
{
put s( " Ent er 1: cr eat e t he l i st " ) ;
put s( " Ent er 2: i nser t i n t he begi nni g of t he l i st " ) ;
put s( " Ent er 3: i nser t af t er a node i n t he l i st " ) ;
put s( " Ent er 4: i nser t bef or e a node i n t he l i st " ) ;
put s( " Ent er 5: i nser t i n t he end of t he l i st " ) ;
put s( " Ent er 6: del et e t he l i st " ) ;
put s( " Ent er 7: di spl ay t he l i st " ) ;
put s( " Ent er 8: END" ) ;
put s( " Ent er your choi ce" ) ;
scanf ( " %d" , &sel ect i on) ;
}whi l e( sel ect i on<1| | sel ect i on>8) ;
r et ur n sel ect i on;
}
st r uct r ec *cr eat e( st r uct r ec *f i r st )
{
st r uct r ec *el ement ;
f i r st =( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
put s( " Ent er / name/ wor d/ t ext : To qui t ent er *" ) ;
scanf ( " %[ ^\ n] " , f i r st - >name) ;
f i r st - >next =f i r st ;
r ear =f i r st ;
r ear - >next =f i r st ; f or ( ; ; )
{
el ement =( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
scanf ( " %[ ^\ n] " , el ement - >name) ;
i f ( st r cmp( el ement - >name, " *" ) ==0) br eak;
el ement - >next =f i r st ;
r ear - >next =el ement ;
r ear = el ement ;
}
r et ur n( f i r st ) ;
}
st r uct r ec *i nser t 1( st r uct r ec *f i r st )
{
st r uct r ec *node;
node=( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
put s( " Ent er node/ name t o be i nser t ed" ) ;
scanf ( " %[ ^\ n] " , node- >name) ;
i f ( f i r st ==NULL)
{
node- >next =f i r st ;
r ear =f i r st ;
}
el se
{
node- >next =f i r st ;
f i r st =node;
r ear - >next =f i r st ;
}
r et ur n( f i r st ) ;
}
st r uct r ec *i nser t 2( st r uct r ec *f i r st )
{
st r uct r ec *cur r ent , *pr i or , *x;
st r uct r ec *node; cur r ent =f i r st ;
node=( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
put s( " Ent er node/ name af t er whi ch new node t o be i nser t ed" ) ;
scanf ( " %[ ^\ n] \ n" , node- >name) ;
x=( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
put s( " Ent er node/ name t o be i nser t ed" ) ;
scanf ( " %[ ^\ n] " , x- >name) ;
whi l e( cur r ent ! =r ear && cur r ent ! =NULL)
{
i f ( st r cmp( cur r ent - >name, node- >name) ==0)
{
x- >next =cur r ent - >next ;
cur r ent - >next =x;
r et ur n( f i r st ) ;
}
el se cur r ent =cur r ent - >next ;
}
i f ( st r cmp( cur r ent - >name, node- >name) ==0)
{
x- >next =f i r st ;
r ear - >next =x;
r ear =x;
r et ur n( f i r st ) ;
}
put s( " Node does not exi st i n t he l i st " ) ;
r et ur n( f i r st ) ;
}
st r uct r ec *i nser t 3( st r uct r ec *f i r st )
{
st r uct r ec *node, *cur r ent , *x, *pr i or ;
cur r ent =f i r st ;
node=( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
put s( " Ent er node/ name bef or e whi ch new node t o be i nser t ed" ) ;
scanf ( " %[ ^\ n] " , node- >name) ;
x=( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
put s( " Ent er node/ name t o be i nser t ed" ) ;
scanf ( " %[ ^\ n] " , x- >name) ;
i f ( st r cmp( cur r ent - >name, node- >name) ==0)
{
x- >next =f i r st ;
f i r st =x;
r et ur n( f i r st ) ;
}
whi l e( cur r ent ! =NULL)
{
pr i or =cur r ent ;
cur r ent =cur r ent - >next ;
i f ( st r cmp( cur r ent - >name, node- >name) ==0)
{
x- >next =cur r ent ;
pr i or - >next =x;
r et ur n( f i r st ) ;
}
}
put s( " Node does not exi st i n t he l i st " ) ;
r et ur n( f i r st ) ;
}
st r uct r ec *i nser t 4( st r uct r ec *f i r st )
{
st r uct r ec *el ement ;
el ement =( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
put s( " Ent er node/ name t o be i nser t ed at t he end of l i st " ) ;
scanf ( " %[ ^\ n] " , el ement - >name) ;
el ement - >next =f i r st ;
r ear - >next =el ement ;
r ear =el ement ;
r et ur n( f i r st ) ;
}
st r uct r ec *del et e( st r uct r ec *f i r st )
{
st r uct r ec *cur r ent , *pr i or , *node;
cur r ent =f i r st ;
node=( st r uct r ec*) mal l oc( si zeof ( st r uct r ec) ) ;
put s( " Ent er node/ name t o be del et e" ) ;
scanf ( " %[ ^\ n] " , node- >name) ;
i f ( st r cmp( cur r ent - >name, node- >name) ==0)
{
f i r st =cur r ent - >next ;
r ear - >next =f i r st ;
f r ee( cur r ent ) ;
r et ur n( f i r st ) ;
}
whi l e( cur r ent ! =r ear && cur r ent ! =NULL)
{
pr i or =cur r ent ;
cur r ent =cur r ent - >next ;
i f ( st r cmp( cur r ent - >name, node- >name) ==0)
{
pr i or - >next =cur r ent - >next ;
f r ee( cur r ent ) ;
r et ur n( f i r st ) ;
}
}
i f ( st r cmp( cur r ent - >name, node- >name) ==0)
{
pr i or - >next =cur r ent - >next ;
pr i or - >next =f i r st ;
r ear =pr i or ;
f r ee( cur r ent ) ;
r et ur n( f i r st ) ;
}
put s( " Node does not exi st i n t he l i st " ) ;
r et ur n( f i r st ) ;
}
voi d *di spl ay( st r uct r ec *f i r st )
{
i nt node=0;
do
{
node++;
pr i nt f ( " %s\ n" , f i r st - >name) ;
f i r st =f i r st - >next ;
}
whi l e( ( f i r st ! =r ear - >next ) &&( f i r st ! =NULL) ) ;
pr i nt f ( " Nuber of nodes= %d\ n" , node) ;
}

ASSIGNMENT NO 8
ALGORITHM TO IMPLEMENT QUEUE AS LINKED
LIST

CREATE
1. t =new node
2. Enter info to be inserted
4. t info =n
5. t next =front
6. front =t

INSERTION
1. r next =t
2. t next =NULL
3. Return

DELETION
1. x =front
2. front =front next
3. delnode(x)
4. Return

DISPLAY
1. If (front =NULL)
Print empty queue
Return
Else
P =start
Repeat until (p<>NULL)
Print p info
P =p next
Return

Program

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
st r uct queue
{
i nt no;
st r uct queue *next ;
}
*st ar t =NULL;
i nt del ( ) ;
voi d t r aver se( ) ;
voi d mai n( )
{
i nt ch;
char choi ce;
do
{
cl r scr ( ) ;
pr i nt f ( " - - - - 1. add\ n" ) ;
pr i nt f ( " - - - - 2. del et e\ n" ) ;
pr i nt f ( " - - - - 3. t r aver se\ n" ) ;
pr i nt f ( " - - - - 4. exi t \ n" ) ;
pr i nt f ( " Ent er your choi ce\ n" ) ;
scanf ( " %d" , &ch) ;
swi t ch( ch)
{
br eak;
case 2: pr i nt f ( " t he del et e el ement i s\ n%d" , del ( ) ) ;
br eak;
case 3: t r aver se( ) ;
br eak;
case 4: r et ur n;
def aul t : pr i nt f ( " wr ong choi ce\ n" ) ;
};
f f l ush( st di n) ;
scanf ( " %c" , &choi ce) ;
}
whi l e( choi ce! =4) ;
}
{
st r uct queue *p, *t emp;
t emp=st ar t ;
p=( st r uct queue*) mal l oc( si zeof ( st r uct queue) ) ;
pr i nt f ( " Ent er t he dat a" ) ;
scanf ( " %d" , &p- >no) ;
p- >next =NULL;
i f ( st ar t ==NULL)
{
st ar t =p;
}
el se
{
whi l e( t emp- >next ! =NULL)
{
t emp=t emp- >next ;
}
t emp- >next =p;
}
}
i nt del ( )
{
st r uct queue *t emp;
i nt val ue;
i f ( st ar t ==NULL)
{
pr i nt f ( " queue i s empt y" ) ;
get ch( ) ;
r et ur n( 0) ;
}
el se
{
t emp=st ar t ;
val ue=t emp- >no;
st ar t =st ar t - >next ;
f r ee( t emp) ;
}
r et ur n( val ue) ;
}
voi d t r aver se( )
{
st r uct queue *t emp;
t emp=st ar t ;
whi l e( t emp- >next ! =NULL)
{
pr i nt f ( " no=%d" , t emp- >no) ;
t emp=t emp- >next ;
}
pr i nt f ( " no=%d" , t emp- >no) ;
get ch( ) ;
}

ASSIGNMENT NO 9

ALGORITHM TO IMPLEMENT STACK USING
ARRAY

INSERTION
PUSH(item)
1. If (item =max of stack)
Print overflow
Return
2. top =top +1
3. stack[top] =item
4. Return

DELETION
POP(item)
1. If (top =- 1)
Print underflow
Return
2. Item =stack[top]
3. top =top 1
4. Return

DISPLAY
1. If top =- 1
Print underflow
2. repeat step 3 for i =top to i >=0
3. Print stack[i]
4. Return

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
#def i ne MAXSI ZE 10
voi d push( ) ;
i nt pop( ) ;
voi d t r aver se( ) ;
i nt st ack[ MAXSI ZE] ;
i nt Top=- 1;
voi d mai n( )
{
i nt choi ce;
char ch;
do
{
cl r scr ( ) ;
pr i nt f ( " \ n1. PUSH " ) ;
pr i nt f ( " \ n2. POP " ) ;
pr i nt f ( " \ n3. TRAVERSE " ) ;
pr i nt f ( " \ nEnt er your choi ce" ) ;
scanf ( " %d" , &choi ce) ;
swi t ch( choi ce)
{
case 1: push( ) ;
br eak;
case 2: pr i nt f ( " \ nThe del et ed el ement i s %d" , pop( ) ) ;
br eak;
case 3: t r aver se( ) ;
br eak;
def aul t : pr i nt f ( " \ nYou Ent er ed Wr ong Choi ce" ) ;
}
pr i nt f ( " \ nDo You Wi sh To Cont i nue ( Y/ N) " ) ;
f f l ush( st di n) ;
scanf ( " %c" , &ch) ;
}
whi l e( ch==' Y' | | ch==' y' ) ;
}

voi d push( )
{
i nt i t em;
i f ( Top == MAXSI ZE - 1)
{
pr i nt f ( " \ nThe St ack I s Ful l " ) ;
get ch( ) ;
exi t ( 0) ;
}
el se
{
pr i nt f ( " Ent er t he el ement t o be i nser t ed" ) ;
scanf ( " %d" , &i t em) ;
Top= Top+1;
st ack[ Top] = i t em;
}
}

i nt pop( )
{
i nt i t em;
i f ( Top == - 1)
{
pr i nt f ( " The st ack i s Empt y" ) ;
get ch( ) ;
exi t ( 0) ;
}
el se
{
i t em= st ack[ Top] ;
Top = Top- 1;
}
r et ur n( i t em) ;
}

voi d t r aver se( )
{
i nt i ;
i f ( Top == - 1)
{
pr i nt f ( " The St ack i s Empt y" ) ;
get ch( ) ;
exi t ( 0) ;
}
el se
{
f or ( i =Top; i >=0; i - - )
{
pr i nt f ( " Tr aver se t he el ement " ) ;
pr i nt f ( " \ n%d" , st ack[ i ] ) ;
}
}
}

ASSIGNMENT NO 10

ALGORITHM TO IMPLEMENT STACK AS LINKED
LIST

PUSH( )
1. t =newnode( )
2. Enter info to be inserted
4. tinfo =n
5. tnext =top
6. top =t
7. Return

POP( )
1. If (top =NULL)
Print underflow
Return
2. x =top
3. top =top next
4. delnode(x)
5. Return

/ / st ack usi ng l i nked l i st / /
#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
st r uct st ack
{
i nt no;
st r uct st ack *next ;
}
*st ar t =NULL;
t ypedef st r uct st ack st ;
voi d push( ) ;
i nt pop( ) ;
voi d di spl ay( ) ;
voi d mai n( )
{
char ch;
i nt choi ce, i t em;
do
{
cl r scr ( ) ;
pr i nt f ( " \ n 1: push" ) ;
pr i nt f ( " \ n 2: pop" ) ;
pr i nt f ( " \ n 3: di spl ay" ) ;
pr i nt f ( " \ n Ent er your choi ce" ) ;
scanf ( " %d" , &choi ce) ;
swi t ch ( choi ce)
{
case 1: push( ) ;
br eak;
case 2: i t em=pop( ) ;
pr i nt f ( " The del et e el ement i n %d" , i t em) ;
br eak;
case 3: di spl ay( ) ;
br eak;
def aul t : pr i nt f ( " \ n Wr ong choi ce" ) ;
};
pr i nt f ( " \ n do you want t o cont i nue( Y/ N) " ) ;
f f l ush( st di n) ;
scanf ( " %c" , &ch) ;
}
whi l e ( ch==' Y' | | ch==' y' ) ;
}
voi d push( )
{
st *node;
node=( st *) mal l oc( si zeof ( st ) ) ;
pr i nt f ( " \ n Ent er t he number t o be i nser t " ) ;
scanf ( " %d" , &node- >no) ;
node- >next =st ar t ;
st ar t =node;
}
i nt pop( )
{
st *t emp;
t emp=st ar t ;
i f ( st ar t ==NULL)
{
pr i nt f ( " st ack i s al r eady empt y" ) ;
get ch( ) ;
exi t ( ) ;
}
el se
{
st ar t =st ar t - >next ;
f r ee( t emp) ;
}
r et ur n( t emp- >no) ;
}
voi d di spl ay( )
{
st *t emp;
t emp=st ar t ;
whi l e( t emp- >next ! =NULL)
{
pr i nt f ( " \ nno=%d" , t emp- >no) ;
t emp=t emp- >next ;
}
pr i nt f ( " \ nno=%d" , t emp- >no) ;
}

ASSIGNMENT NO.11

ALGORITHM TO CONVERT AN INFIX TO
POSTFIX EXPRESSION

Q arithmetic expression
P postfix expression

1. Push ( onto stack, and add ) to the end of Q
2. Scan Q from left to right and repeat steps 3 to 6 for each element of Q
untill the stack is empty
3. If an operand is encountered , add it to P
4. If a left parenthesis is encountered, push it onto stack
5. If an operator is encountered , then:
(a) Repeatedly pop from stack and add to P each operator which has
the same precedence as or higher precedence than
6. If a right parenthesis is encountered, then:
(a) Repeatedly pop from stack and add to P each operator until a left
parenthesis is encountered
(b) Remove the left parenthesis
7. Exit

// infix to postfix conversion//
#i ncl ude<coni o. h>
#i ncl ude<st di o. h>
#i ncl ude<st r i ng. h>
char st ack[ 50] ;
i nt t op=- 1;
voi d i n_t o_post ( char i nf i x[ ] ) ;
voi d push ( char ) ;
char pop( ) ;
voi d mai n( )
{
char i nf x[ 25] ;
pr i nt f ( " Ent er t he i nf i x expr essi on" ) ;
get s( i nf x) ;
i n_t o_post ( i nf x) ;
get ch( ) ;
}
voi d push ( char symb)
{
i f ( t op>=49)
{
pr i nt f ( " st ack over f l ow" ) ;
get ch( ) ;
r et ur n;
}
el se
{
t op=t op+1;
st ack[ t op] =symb;
}
}
char pop( )
{
char i t em;
i f ( t op==- 1)
{
pr i nt f ( " st ack empt y" ) ;
get ch( ) ;
r et ur n( 0) ;
}
el se
{
i t em=st ack[ t op] ;
t op- - ;
}
r et ur n( i t em) ;
}
i nt pr eced( char ch)
{
i f ( ch==47)
{
r et ur n( 5) ;
}
el se
i f ( ch==42)
{
r et ur n( 4) ;
}
el se i f ( ch==43)
{
r et ur n( 3) ;
}
el se
r et ur n( 2) ;
}
voi d i n_t o_post ( char i nf i x[ ] )
{
i nt l engt h;
st at i c i nt i ndex=0, pos=0;
char symbol , t emp;
char post f i x[ 40] ;
l engt h=st r l en( i nf i x) ;
push( ' #' ) ;
whi l e( i ndex<l engt h)
{
symbol =i nf i x[ i ndex] ;
swi t ch( symbol )
{
case' ( ' : push( symbol ) ;
br eak;
case' ) ' : t emp=pop( ) ;
whi l e( t emp! =' ( ' )
{
post f i x[ pos] =t emp;
pos++;
t emp=pop( ) ;
}
br eak;
case ' +' :
case ' - ' :
case ' *' :
case ' / ' :
case ' ^' :
whi l e ( pr eced( st ack[ t op] ) >=pr eced( symbol ) )
{
t emp=pop( ) ;
post f i x[ pos] =t emp;
pos++;
}
push( symbol ) ;
br eak;
def aul t : post f i x[ pos++] =symbol ;
br eak;
}
i ndex++;
}
whi l e( t op>0)
{
t emp=pop( ) ;
post f i x[ pos++] =t emp;
}
post f i x[ pos++] =' \ 0' ;
put s( post f i x) ;
r et ur n;
}

ASSIGNMENT NO 12

ALGORITHM TO EVALUATE POSTFIX
EXPRESSION

P postfix expression
1. Add a right parenthesis ) at the end of P
2. Scan P from left to right and repeat steps 3 & 4 until sentinel ) is
encountered
3. If an operand is encountered, put it on stack
4. If an operator is encountered , then:
a) Remove the top two elements of stack , where A is the top element
& B is the next to top element
b) Evaluate B A
c) Place the result of (b) back on stack
5. Set value equal to the top element on stack
6. Exit

//evaluation of postfix expression//

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
f l oat st ack[ 10] ;
i nt t op=- 1;
voi d push( char ) ;
f l oat pop( ) ;
f l oat eval ( char [ ] , f l oat [ ] ) ;
voi d mai n( )
{
i nt i =0;
char suf f i x[ 20] ;
f l oat val ue[ 20] , r esul t ;
cl r scr ( ) ;
pr i nt f ( " Ent er a val i d post f i x expr essi on\ t " ) ;
get s( suf f i x) ;
whi l e ( suf f i x[ i ] ! =' \ 0' )
{
i f ( i sal pha( suf f i x[ i ] ) )
{
f f l ush( st di n) ;
pr i nt f ( " \ nEnt er t he val ue of %c" , suf f i x[ i ] ) ;
scanf ( " %f " , &val ue[ i ] ) ;
}
i ++;
}
r esul t =eval ( suf f i x, val ue) ;
pr i nt f ( " The r esul t of %s=%f " , suf f i x, r esul t ) ;
get ch( ) ;
}
f l oat eval ( char suf f i x[ ] , f l oat dat a[ ] )
{
i nt i =0;
f l oat op1, op2, r es;
char ch;
whi l e( suf f i x[ i ] ! =' \ 0' )
{
ch=suf f i x[ i ] ;
i f ( i sal pha( suf f i x[ i ] ) )
{
push( dat a[ i ] ) ;
}
el se
{
op2=pop( ) ;
op1=pop( ) ;
swi t ch( ch)
{
case ' +' : push( op1+op2) ;
br eak;
case ' - ' : push( op1- op2) ;
br eak;
case ' *' : push( op1+op2) ;
br eak;
case ' / ' : push( op1/ op2) ;
br eak;
case ' ^' : push( pow( op1, op2) ) ;
br eak;
}
}
i ++;
}
r es=pop( ) ;
r et ur n( r es) ;
}
voi d push( char num)
{
t op=t op+1;
st ack[ t op] =num;
}
f l oat pop( )
{
f l oat num;
num=st ack[ t op] ;
t op=t op- 1;
r et ur n( num) ;
}

ASSIGNMENT NO 13

ALGORITHM TO SORT ARRAY USING BUBBLE
SORT

1. Repeat steps 2 & 3 for k =1 to N-1
2. Set ptr =1
3. Repeat while ptr <=N-k
4. (a) If data[ptr] >data[ptr +1],then
Interchange data[ptr] and data[ptr +1]
(b) ptr =ptr +1
5. Exit

bubble sort

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
voi d mai n( )
{
i nt a[ 100] , n, i , j , t emp;
cl r scr ( ) ;
pr i nt f ( " How many el ement s" ) ;
scanf ( " %d" , &n) ;
pr i nt f ( " Ent er t he el ement of ar r ay" ) ;
f or ( i =0; i <=n- 1; i ++)
{
scanf ( " %d" , &a[ i ] ) ;
}
f or ( i =0; i <=n- 1; i ++)
{
f or ( j =0; j <=n- 1- i ; j ++)
{
i f ( a[ j ] >a[ j +1] )
{
t emp=a[ j ] ;
a[ j ] =a[ j +1] ;
a[ j +1] =t emp;
}
}
}
pr i nt f ( " El ement of ar r ay af t er t he sor t i ng ar e: \ n" ) ;
f or ( i =0; i <=n- 1; i ++)
{
pr i nt f ( " %d\ n" , a[ i ] ) ;
}
get ch( ) ;
}

ASSIGNMENT NO 14
ALGORITHM TO SORT ARRAY USING SELECTION
SORT

1. For (i =0; i <=n-2 ; i++)
min =a[i]
for (j =i+1 ; j <=n-1 ; j++)
If (min >a[j])
Swap (min,a[j])
2. Exit

selection sort

#i ncl ude<st di o. h>
#i ncl ude<coni o. h>
voi d mai n( )
{
i nt a[ 100] , n, i , j , t emp, l oc, mi n;
cl r scr ( ) ;
pr i nt f ( " \ How many el ement s: \ n" ) ;
scanf ( " %d" , &n) ;
pr i nt f ( " Ent er t he el ement of ar r ay\ n" ) ;
f or ( i =0; i <=n- 1; i ++)
{
scanf ( " %d" , &a[ i ] ) ;
}
mi n=a[ 0] ;
f or ( i =0; i <=n- 1; i ++)
{
mi n=a[ i ] ;
l oc=i ;
f or ( j =i +1; j <=n- 1; j ++)
{
i f ( a[ j ] <mi n)
{
mi n=a[ j ] ;
l oc=j ;
}
}
i f ( l oc! =1)
{
t emp=a[ i ] ;
a[ i ] =a[ l oc] ;
a[ l oc] =t emp;
}

}
pr i nt f ( " The number af t er sel ect i on sor t i ng ar e: \ n" ) ;
f or ( i =0; i <=n- 1; i ++)
{
pr i nt f ( " %d\ n" , a[ i ] ) ;
}
get ch( ) ;
}

ASSIGNMENT NO 15

ALGORITHM TO MERGE TWO SORTED ARRAY

ENTER (a[10],n)
1. Repeat step 2 for i =0 to (n-1)
2. Input a[i]
3. Return

DISPLAY(c[20],p)
1. Repeat step 2 for k =0 to p-1
2. Print c[k]
3. Return

MAIN( )
1. Start
2. Input no. of elements in 1
st
& 2
nd
array as n & m
3. Enter (a.n)
4. Enter (b,m)
5. i =j =k =0
6. Repeat step 7 to 12 while ((i <n)&&(j <m))
7. If (a[i] >=b[j]),goto step 9
8. c[k+1] =a[i+1]
9. If a[i] =b[j] ,goto step 11
10. c[k++] =b[j++]
goto step 7
11. c[k++] =a[i++]
12. j++
13. Repeat step 14 while (i<n)
14. c[k++] =a[i++]
15. Repeat step 16 while m >j
16. c[k++] =b[j++]
17. Display merged arrays as display(c;k)
18. Exit

#include<stdio.h>
#include<conio.h>
void main( )
{
int n,m,i,j,k,c[40],a[20],b[20];
clrscr ();
printf("Enter limit for A:");
scanf("%d",&n);
printf ("\nEnter limit for B:");
scanf("%d",&m);
printf("Enter elements for A:-\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("Enter elements for B:-\n");
for(j=0;j<m;j++)
scanf("%d",&b[j]);
i=j=k=0;
while(i<n&&j<m)
{
if(a[i]<b[j])
c[k++]=a[i++];
else
if(a[i]>b[j])
c[k++]=b[j++];
else

{
c[k++]=b[j++];
i++;

j++;
}
}

if(i<n)
{
int t;
for(t=0;t<n;t++)

c[k++]=a[i++];
}
if(j<m)
{
int t;
for(t=0;t<m;t++)
{
c[k++]=b[j++];
}
}
printf("\n");
for(k=0;k<(m+n);k++)
printf("\t \n %d ",c[k]);
getch();
}

ASSIGNMENT NO 16
Algorithm for tree traversal
Pr eor der ( r oot )
I f r oot = nul l t hen exi t
Pr ocess r oot - >i nf o
Pr eor der r oot - >l ef t ;
Pr eor der r oot - >r i ght
Exi t

I nor der ( r oot )
I f r oot = nul l t hen exi t
I nor der r oot - >l ef t
Pr ocess r oot - >i nf o
I nor der r oot - >r i ght
Exi t

Post or der ( r oot )
I f r oot = nul l t hen exi t
Post or der r oot - >l ef t
Post or der r oot - >r i ght
Post or der r oot - >i nf o
exi t

/ / t r aver si ng a t r ee

#i ncl ude<st di o. h>
st r uct r ec
{
l ong num;
st r uct r ec *l ef t ;
st r uct r ec *r i ght ;
};
st r uct r ec *t r ee=NULL;
st r uct r ec *i nser t ( st r uct r ec *t r ee, l ong num) ;
voi d pr eor der ( st r uct r ec *t r ee) ;
voi d i nor der ( st r uct r ec *t r ee) ;
voi d post or der ( st r uct r ec *t r ee) ;
i nt count =1;
mai n( )
{
i nt choi ce;
l ong di gi t ;
do
{
choi ce=sel ect ( ) ;
swi t ch( choi ce)
{
case 1: put s( " Ent er i nt eger : To qui t ent er 0" ) ;
scanf ( " %l d" , &di gi t ) ;
whi l e( di gi t ! =0)
{
t r ee=i nser t ( t r ee, di gi t ) ;
scanf ( " %l d" , &di gi t ) ;
}cont i nue;
case 2: put s( " \ npr eor der t r aver si ng TREE" ) ;
pr eor der ( t r ee) ; cont i nue;
case 3: put s( " \ ni nor der t r aver si ng TREEE" ) ;
i nor der ( t r ee) ; cont i nue;
case 4: put s( " \ npost or der t r aver si ng TREE" ) ;
post or der ( t r ee) ; cont i nue;
case 5: put s( " END" ) ; exi t ( 0) ;
}
}whi l e( choi ce! =5) ;
}
i nt sel ect ( )
{
i nt sel ect i on;
do
{
put s( " Ent er 1: I nser t a node i n t he BT" ) ;
put s( " Ent er 2: Di spl ay( pr eor der ) t he BT" ) ;
put s( " Ent er 3: Di spl ay( i nor der ) t he BT" ) ;
put s( " Ent er 4: Di spl ay( post or der ) t he BT" ) ;
put s( " Ent er 5: END" ) ;
put s( " Ent er your choi ce" ) ;
scanf ( " %d" , &sel ect i on) ;
i f ( ( sel ect i on<1) | | ( sel ect i on>5) )
{
put s( " wr ong choi ce: Tr y agai n" ) ;
get ch( ) ; }
}whi l e( ( sel ect i on<1) | | ( sel ect i on>5) ) ;
r et ur n ( sel ect i on) ;
}
st r uct r ec *i nser t ( st r uct r ec *t r ee, l ong di gi t )
{
i f ( t r ee==NULL)
{
t r ee=( st r uct r ec *) mal l oc( si zeof ( st r uct r ec) ) ;
t r ee- >l ef t =t r ee- >r i ght =NULL;
t r ee- >num=di gi t ; count ++;
}
el se
i f ( count %2==0)
t r ee- >l ef t =i nser t ( t r ee- >l ef t , di gi t ) ;
el se
t r ee- >r i ght =i nser t ( t r ee- >r i ght , di gi t ) ;
r et ur n( t r ee) ;
}
voi d pr eor der ( st r uct r ec *t r ee)
{
i f ( t r ee! =NULL)
{
pr i nt f ( " %12l d\ n" , t r ee- >num) ;
pr eor der ( t r ee- >l ef t ) ;
pr eor der ( t r ee- >r i ght ) ;
}
}
voi d i nor der ( st r uct r ec *t r ee)
{
i f ( t r ee! =NULL)
{
i nor der ( t r ee- >l ef t ) ;
pr i nt f ( " %12l d\ n" , t r ee- >num) ;
i nor der ( t r ee- >r i ght ) ;
}
}
voi d post or der ( st r uct r ec *t r ee)
{
i f ( t r ee! =NULL)
{
post or der ( t r ee- >l ef t ) ;
post or der ( t r ee- >r i ght ) ;
pr i nt f ( " %12l d\ n" , t r ee- >num) ;
}

}

i nt sel ect ( )
{
i nt sel ect i on;
do
{
put s( " Ent er 1: I nser t a node i n t he BT" ) ;
put s( " Ent er 2: Di spl ay( pr eor der ) t he BT" ) ;
put s( " Ent er 3: Di spl ay( i nor der ) t he BT" ) ;
put s( " Ent er 4: Di spl ay( post or der ) t he BT" ) ;
put s( " Ent er 5: END" ) ;
put s( " Ent er your choi ce" ) ;
scanf ( " %d" , &sel ect i on) ;
i f ( ( sel ect i on<1) | | ( sel ect i on>5) )
{
put s( " wr ong choi ce: Tr y agai n" ) ;
get ch( ) ; }
}whi l e( ( sel ect i on<1) | | ( sel ect i on>5) ) ;
r et ur n ( sel ect i on) ;
}
st r uct r ec *i nser t ( st r uct r ec *t r ee, l ong di gi t )
{
i f ( t r ee==NULL)
{
t r ee=( st r uct r ec *) mal l oc( si zeof ( st r uct r ec) ) ;
t r ee- >l ef t =t r ee- >r i ght =NULL;
t r ee- >num=di gi t ; count ++;
}
el se
i f ( count %2==0)
t r ee- >l ef t =i nser t ( t r ee- >l ef t , di gi t ) ;
el se
t r ee- >r i ght =i nser t ( t r ee- >r i ght , di gi t ) ;
r et ur n( t r ee) ;
}
voi d pr eor der ( st r uct r ec *t r ee)
{
i f ( t r ee! =NULL)
{
pr i nt f ( " %12l d\ n" , t r ee- >num) ;
pr eor der ( t r ee- >l ef t ) ;
pr eor der ( t r ee- >r i ght ) ;
}
}
voi d i nor der ( st r uct r ec *t r ee)
{
i f ( t r ee! =NULL)
{
i nor der ( t r ee- >l ef t ) ;
pr i nt f ( " %12l d\ n" , t r ee- >num) ;
i nor der ( t r ee- >r i ght ) ;
}
}
voi d post or der ( st r uct r ec *t r ee)
{
i f ( t r ee! =NULL)
{
post or der ( t r ee- >l ef t ) ;
post or der ( t r ee- >r i ght ) ;
pr i nt f ( " %12l d\ n" , t r ee- >num) ;
}

}

FAQ for data structure lab

1) what is the advantage of binary search method over linear search.
2)what are the drawbacks of binary search method.
3)Calculate the complexity of sorting methods.
4)compare various sorting methods by their performance.
5)What is the advantage of dynamic implementation over static
implementation of stack.
6)application of stack.
7)Advantage of circular queue over linear queue.
8)Drawback of static implementation of queue
9)Explain the use of stack in tree traversal.
10)What is the advantage of BST and where it is used.