CYCLE2

7/18/2019 CYCLE2

http://slidepdf.com/reader/full/cycle2-569194744c93d 1/32

Program Code :-

//Program No.8 Stack Implementation using Array

#include<stdio.h>

#include<conio.h>

#include<stdlib.h>

#deine si!e "

struct stack

int s$si!e%&

int top&

' st&

int stull()

i (st.top >* si!e + ,) return ,& #include<stdio.h>

#include<conio.h>

#include<stdlib.h>

#deine si!e "

struct stack

int s$si!e%&

int top&

' st&

int stull() i (st.top >* si!e + ,)

return ,&

else

return -&

'

oid push(int item)

st.top&

st.s$st.top% * item&

'

int stempty()

i (st.top ** +,)

return ,&

else

return -&

'

7/18/2019 CYCLE2


int pop()

int item&

item * st.s$st.top%&

st.top++&

return (item)&

'

oid display()

int i&

i (stempty())

print(01nStack Is 2mpty30)&

else

or (i * st.top& i >* -& i++) print(01n4d05 st.s$i%)&

'

'

oid main()

int item5 choice&

char ans&

st.top * +,&

print(01n1tImplementation 6 Stack0)&

do print(01n7ain 7enu0)&

print(01n,.Push 1n.Pop 1n9.:isplay 1n;.eit0)&

print(01n2nter =our hoice0)&

scan(04d05 ?choice)&

s@itch (choice)

case ,

print(01n2nter Bhe item to be pushed0)&

scan(04d05 ?item)&

i (stull())

print(01nStack is Cull30)&

else push(item)&

break&

case

i (stempty())

print(01n2mpty stack3Dnderlo@ 330)&

else

item * pop()&

7/18/2019 CYCLE2


print(01nBhe popped element is 4d05 item)&

'

break&

case 9

display()&

break&

case ;

eit(-)&

'

'@hile(choice3*;)&

'

Sample Input Output :-

Implementation 6 Stack

7ain 7enu

,.Push

.Pop

9.:isplay

;.eit

2nter =our hoice1

2nter Bhe item to be pushed78

7ain 7enu

,.Push

.Pop

9.:isplay

;.eit

2nter =our hoice1

2nter Bhe item to be pushed90

7ain 7enu

,.Push

.Pop

9.:isplay

;.eit

2nter =our hoice1

2nter Bhe item to be pushed-45

7/18/2019 CYCLE2


7ain 7enu

,.Push

.Pop

9.:isplay

;.eit

2nter =our hoice3

-45

90

78

7ain 7enu

,.Push.Pop

9.:isplay

;.eit

2nter =our hoice2

Bhe popped element is -45

7ain 7enu

,.Push

.Pop

9.:isplay

;.eit2nter =our hoice4

7/18/2019 CYCLE2


Program Code :-

//Program No.E Ini to Posti 2pression

#deine SIF2 "-

#include <ctype.h>

#include<stdio.h>

char s$SIF2%&

int top*+,&

push(char elem)

s$top%*elem&

'

char pop()

return(s$top++%)&

'

int pr(char elem)

s@itch(elem)

case G#G return -&

case G(G return ,&

case GG case G+G return &

case GHG

case G/G return 9&

'

'

main()

char in$"-%5po$"-%5ch5elem&

int i*-5k*-&

print(01nIni to Posti 2pression0)& print(01nH++++++++++++++++++++++++++H0)&

print(01n1nead the Ini 2pression J 0)&

scan(04s05in)&

push(G#G)&

@hile( (ch*in$i%) 3* G1-G)

i( ch ** G(G) push(ch)&

7/18/2019 CYCLE2


else

i(isalnum(ch)) po$k%*ch&

else

i( ch ** G)G)

@hile( s$top% 3* G(G)

po$k%*pop()&

elem*pop()&

'

else

@hile( pr(s$top%) >* pr(ch) )

po$k%*pop()& push(ch)&

'

'

@hile( s$top% 3* G#G)

po$k%*pop()&

po$k%*G1-G&

print(01nKien Ini 2pn 4s 1nPosti 2pn 4s1n05in5po)&

'


Ini to Posti 2pression

H++++++++++++++++++++++++++H

ead the Ini 2pression J ab/c

Kien Ini 2pn ab/c

Posti 2pn abc/

7/18/2019 CYCLE2


Program Code :-

//Program No.,- Lueue Implementation using Array

#include<stdio.h>

#include<conio.h>

#include<malloc.h>

#deine 7AM ,-

int ueue$7AM%5ront*+,5rear*+,&

oid insertOelement()&

oid deleteOelement()&

oid displayOueue()&

oid main()

int option&

print(01n Lueue Implementation0)&

print(01nH++++++++++++++H0)&

do

print(01n1n ,.Insert0)&

print(01n .:elete0)&

print(01n 9.:isplay0)&

print(01n ;.2it0)&

print(01n 2nter your choice 0)& scan(04d05?option)&

s@itch(option)

case , insertOelement()&

break&

case deleteOelement()&

break&

case 9 displayOueue()&

break&

case ; eit(-)&

'

'@hile(option3*;)&

'

oid insertOelement()

int num&

print(01n 2nter the number to be inserted 0)&

7/18/2019 CYCLE2


scan(04d05?num)&

i(ront**- ?? rear**7AM+,)

print(01n Lueue 6erClo@ 6ccured0)&

else i(ront**+,??rear**+,)

ront*rear*-&

ueue$rear%*num&

'

else i(rear**7AM+, ?? ront3*-)

rear*-&

ueue$rear%*num& '

else

rear&

ueue$rear%*num&

'

'

oid deleteOelement()

int element&

i(ront**+,)

print(01n Dnderlo@0)&

'

element*ueue$ront%&

i(ront**rear)

ront*rear*+,&

else

i(ront**7AM+,)

ront*-&

else ront&

print(01n Bhe deleted element is 4d05element)&

'

'

oid displayOueue()

7/18/2019 CYCLE2


int i&

i(ront**+,)

print(01n No elements to display0)&

else

print(01n Bhe ueue elements are1n 0)&

or(i*ront&i<*rear&i)

print(01t 4d05ueue$i%)&

'

'

'


Lueue Implementation

H++++++++++++++++++++++++++H

,.Insert

.:elete

9.:isplay

;.2it

2nter your choice 1

2nter the number to be inserted 56

,.Insert

.:elete

9.:isplay

;.2it

2nter your choice: 1

2nter the number to be inserted 34

,.Insert .:elete

9.:isplay

;.2it


2nter the number to be inserted

-6

7/18/2019 CYCLE2


,.Insert

.:elete

9.:isplay

;.2it


Bhe ueue elements are

56 34 -6

,.Insert

.:elete

9.:isplay ;.2it

2nter your choice 2

Bhe deleted element is 56

,.Insert

.:elete

9.:isplay

;.2it

2nter your choice 4

7/18/2019 CYCLE2


Program Code :-

//Program No.,, Singly inked ist

#include<stdio.h>

#include<conio.h>

#include<malloc.h>

struct sll

int data&

struct sllHlink&

'&

typede struct sll node&

nodeHhead*ND5Htemp5Hp5Hpre5si!e&

oid insert()&oid delte()&

oid display()&

oid main()

print(01nSingly inked ist0)&

print(01nH+++++++++++++++++H0)&

@hile(,)

int ch&

print(01n72ND0)&

print(01n,.insert1n.delete1n9.display1n;.eit0)& print(01n enter your choice0)&

scan(04d05?ch)&

s@itch(ch)

case ,

insert()&

break&

case

delte()&

break&

case 9 display()&

break&

case ;

eit(-)&

'

'

'

7/18/2019 CYCLE2


oid insert()

temp*(nodeH)malloc(si!eo(node))&

print(01n enter the data0)&

scan(04d05?temp+>data)&

i(head**ND)

head*temp&

temp+>link*ND&

'

else

or(p*head5pre*head&p3*ND&pre*p5p5p*p+>link)

i(p+>data>temp+>data)

i(p**head)

temp+>link*head&

head*temp&

break&

'

else

temp+>link*pre+>link&

pre+>link*temp&

break&

'

'

'

i(p**ND)

pre+>link*temp& temp+>link*ND&

'

print(01n the gien item is added0)&

'

'

oid delte()

7/18/2019 CYCLE2


int 5*-&

print(01n enter the data to be deleted0)&

scan(04d05?)&

i(head+>data**)

head*head+>link&

*,&

'

else

or(p*head&p3*ND&pre*p5p*p+>link)

i(p+>data**)

pre+>link*p+>link&

*,&

break&

'

i(**,)

print(01n item is deleted0)&

else

print(01n item is not ound0)&

'

oid display()

print(01n1n the list is 0)&

or(p*head&p3*ND&p*p+>link)

print(04d05p+>data)&

i(p+>link3*ND)

print(0+>0)&

'

'

7/18/2019 CYCLE2



Singly inked istH++++++++++++++++++H

72ND

,.insert

.delete

9.display

;.eit

enter your choice,

enter the dataQ8

72ND,.insert

.delete

9.display

;.eit

enter your choice,

enter the dataRQ

the gien item is added

72ND

,.insert

.delete

9.display

;.eit

enter your choice,

enter the data+E-

the gien item is added

72ND

,.insert.delete

9.display

;.eit

enter your choice9

the list is +E-+>RQ+>Q8

72ND

7/18/2019 CYCLE2


,.insert

.delete

9.display

;.eit

enter your choice

enter the data to be deletedRQ

item is deleted

72ND

,.insert

.delete

9.display;.eit

enter your choice9

the list is +E-+>Q8

72ND

,.insert

.delete

9.display

;.eit

enter your choice;

7/18/2019 CYCLE2


Program Code

//Program No., :oubly inked ist

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

typede struct Node

int data&

struct Node Hnet&

struct Node Hpre&

'node&

oid insert(node Hpointer5 int data)

@hile(pointer+>net3*ND)

pointer * pointer +> net&

'

pointer+>net * (node H)malloc(si!eo(node))&

(pointer+>net)+>pre * pointer&

pointer * pointer+>net&

pointer+>data * data&

pointer+>net * ND&

'

oid delete(node Hpointer5 int data)

@hile(pointer+>net3*ND ?? (pointer+>net)+>data 3* data)

pointer * pointer +> net&

'

i(pointer+>net**ND)

print(02lement 4d is not present in the list1n05data)&

return&

'

node Htemp& temp * pointer +> net&

pointer+>net * temp+>net&

temp+>pre * pointer&

ree(temp)&

'

7/18/2019 CYCLE2


oid printmylist(node Hpointer)

i(pointer**ND)

return&

'

print(0+>4d05pointer+>data)&

printmylist(pointer+>net)&

'

oid main()

int data&

node Hstart5Htemp& start * (node H)malloc(si!eo(node))&

temp * start&

temp +> net * ND&

temp +> pre * ND&

print(01n:6D= INT2: ISB0)&

print(01n++++++++++++++++++0)&

print(01n,. Insert0)&

print(01n. :elete0)&

print(01n9. Print0)&

print(01n;. 2it0)&

@hile(,)

int ch&

print(01n2nter ur hoice0)&

scan(04d05?ch)&

s@itch(ch)

case ,

print(01n2nter the element to insert0)&

scan(04d05?data)&

insert(start5data)&

break& case

print(01n2nter the element to delete 0)&

scan(04d05?data)&

delete(start5data)&

break&

case 9

print(0Bhe list is 0)&

7/18/2019 CYCLE2


printmylist(start+>net)&

print(01n0)&

break&

case ;

eit(-)&

break&

'

'

'


:6D= INT2: ISB++++++++++++++++++

,. Insert

. :elete

9. Print

;. 2it

2nter ur hoice1

2nter the element to insert23

2nter ur hoice1


2nter ur hoice1


2nter ur hoice3

Bhe list is ->23->90->67

2nter ur hoice2

2nter the element to delete RQ

2nter ur hoice9

Bhe list is ->23->90

2nter ur hoice4

7/18/2019 CYCLE2


Program Code :-

//Program No.,9 inary Bree Braersal using ecursion

#include<stdio.h>

#include<stdlib.h>

#include<conio.h>

typede struct tree

int ino&

struct tree Hlet&

struct tree Hright&

'tree&

tree Hroot&

int &oid uildtree(treeH5int)&

oid tralnorder(treeH)&

oid trapreorder(treeH)&

oid trapostorder(treeH)&

oid main()

print(01nINA= B22 BAU2SA DSINK 2DSI6N0)&

print(01nH++++++++++++++++++++++++++++++++H0)&

print(01n2nter the root alues0)&

scan(04d05?)&

root*(treeH)malloc(si!eo(tree))& root+>ino*&

root+>let*ND&

root+>right*ND&

print(02nter the aluesV!to terminate0)&

@hile(scan(04d05?)3*26C)

uildtree(root5)&

print(01n0)&

print(01ninorder0)&

tralnorder(root)&

print(01npreorder0)&

trapreorder(root)& print(01nPostorder0)&

trapostorder(root)&

'

oid uildtree(tree Hnode5int number)

tree Hne@Onode&

i(number>node+>ino)

7/18/2019 CYCLE2


i(node+>right**ND)

ne@Onode*(treeH)malloc(si!eo(tree))&

ne@Onode+>ino*number&

ne@Onode+>let*ND&

ne@Onode+>right*ND&

node+>right*ne@Onode&

'

else

uildtree(node+>right5number)&

'

else

i(number<node+>ino)

i(node+>let**ND)

ne@Onode*(treeH)malloc(si!eo(tree))&

ne@Onode+>ino*number&

ne@Onode+>let*ND&

ne@Onode+>right*ND&

node+>let*ne@Onode&

'

elseuildtree(node+>let5number)&

else

print(01nduplicate number*4d05number)&

'

'

oid tralnorder(treeHnode)

i(node3*ND)

tralnorder(node+>let)&

print(0 4d05node+>ino)&tralnorder(node+>right)&

'

'

oid trapreorder(tree Hnode)

i(node3*ND)

7/18/2019 CYCLE2


print(0 4d05node+>ino)&

trapreorder(node+>let)&

trapreorder(node+>right)&

'

'

oid trapostorder(treeHnode)

i(node3*ND)

trapostorder(node+>let)&

trapostorder(node+>right)&

print(0 4d05node+>ino)&

''


INA= B22 BAU2SA DSINK 2DSI6N

H++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++H

2nter the root aluesRR

2nter the aluesV!to terminate""

88

;;

R-

QQ

EE

,,

99

VF

inorder ,, 99 ;; "" R- RR QQ 88 EE

preorder RR "" ;; ,, 99 R- 88 QQ EE

Postorder ,, 99 ;; R- "" QQ EE 88 RR

7/18/2019 CYCLE2


Program ode

//Program No. ,; Kraph Braersal (CS ? :CS)#include<stdio.h>

int $-%5top*+,5ront*+,5rear*+,5a$-%$-%5is$-%5stack$-%&

int delete()&

oid add(int item)&

oid bs(ints5int n)&

oid ds(ints5int n)&

oid push(int item)&

int pop()&

main()

intn5i5s5ch5W&

char c5dummy&

print(X1n1t1t:CS?CSY)&

print(X1t1tZZZZZZZZZY)&

print(02nter the number ertices0)&

scan(04d05?n)&

or(i*,&i<*n&i)

or(W*,&W<*n&W)

print(02nter , i 4d has a node @ith 4d else -05i5W)&

scan(04d05?a$i%$W%)&

'

'

print(0the adWacency matri is1n0)&

or(i*,&i<*n&i)

or(W*,&W<*n&W)

print(04d05a$i%$W%)& '

print(01n0)&

'

do

or(i*,&i<*n&i)

is$i%*-&

7/18/2019 CYCLE2


print(01n menu0)&

print(01n .C.S0)&

print(01n :.C.S0)&

print(01n 2nter your choice0)&

scan(04d05?ch)&

print(02nter the source erte0)&

scan(04d05?s)&

s@itch(ch)

case ,

bs(s5n)&

break&

case

ds(s5n)&

break&

'

print(0do u @ant continue(y/n)J0)&

scan(04c05?dummy)&

scan(04c05?c)&

'

@hile((c**GyG)[[(c**GyG))&

'oid bs(ints5int n)

intp5i&

add(s)&

is$s%*,&

p*delete()&

i(p3*-)

print(04d05p)&

@hile(p3*-)

or(i*,&i<*n&i)

i((a$p%$i%3*-)??(is$i%**-))

add(i)&

is$i%*,&

'

7/18/2019 CYCLE2


p*delete()&

i(p3*-)

print(04d05p)&

'

or(i*,&i<*n&i)

i(is$i%**-)

bs(i5n)&

'

oid add(int item)

i(rear**,E)

print(0ueue ull0)&

else

i(rear**+,)

$rear%*item&

ront&

'

else

$rear%*item&

'

'

int delete()

int k&

i((ront>rear)[[(ront**+,))

return(-)&

else

k*$ront%& return(k)&

'

'

oid ds(ints5int n)

inti5k&

7/18/2019 CYCLE2


push(s)&

is$s%*,&

k*pop()&

i(k3*-)

print(04d05k)&

@hile(k3*-)

or(i*,&i<*n&i)

i((a$k%$i%3*-)??(is$i%**-))

push(i)&

is$i%*,&

'

k*pop()&

i(k3*-)

print(04d05k)&

'

or(i*,&i<*n&i)

i(is$i%**-)

ds(i5n)&

'

oid push(int item)

i(top**,E)

print(0stack o@rlo@0)&

else stack$top%*item&

'

int pop()

int k&

i(top**+,)

return(-)&

else

k*stack$top++%&

return(k)&

''

7/18/2019 CYCLE2



:CS?CSZZZZZZZZ

2nter the number ertices

2nter , i , has a node @ith , else - ,

2nter , i , has a node @ith else - -

2nter , i has a node @ith , else - ,

2nter , i has a node @ith else - -

Bhe adWacency matri is

, -, -

menu

,. .C.S

.:.C.S

2nter your choice ,

2nter the source erte

,

do u @ant continue(y/n)Jn

7/18/2019 CYCLE2


Program Code://Program No.," 7inimum Spanning Bree(Prim\s Algorithm)

#include<stdio.h>

#include<conio.h>

intn5cost$,-%$,-%&

oid prim()

inti5W5k5l55nr$,-%5temp5minOcost*-5tree$,-%$9%&

temp*cost$-%$-%&

or(i*-&i<n&i)

or(W*-&W<n&W)

i(temp>cost$i%$W%)

temp*cost$i%$W%&

k*i&

l*W&

'

' '

tree$-%$-%*k&

tree$-%$,%*l&

tree$-%$%*temp&

minOcost*temp&

or(i*-&i<n&i)

i(cost$i%$k%<cost$i%$l%)

nr$i%*k&

else

nr$i%*l&

'

nr$k%*,--&

nr$l%*,--&

temp*EE&

or(i*,&i<n+,&i)

7/18/2019 CYCLE2


or(W*-&W<n&W)

i(nr$W%3*,-- ?? cost$W% $nr$W%%<temp)

temp*cost$W%$nr$W%%&

*W&

'

'

tree$i%$-%*&

tree$i%$,%*nr$%&

tree$i%$%*cost$%$nr$%%&

minOcost*minOcostcost$%$nr$%%&

nr$%*,--&

or(W*-&W<n&W)

i(nr$W%3*,-- ?? cost$W%$nr$W%%>cost$W%$%)

nr$W%*&

'

temp*EE&

' print(01n the min spanning tree is+0)&

or(i*-&i<n+,&i)

or(W*-&W<9&W)

print(04d05tree$i%$W%)&

print(01n0)&

'

print(01n min cost+4d05minOcost)&

'

main()

inti5W&

print(X1n1t1t1t Prim\s Algorithm1tY)&

print(X1t1tZZZZZZZZZZZZZZZZZZZ1t1tY)&

print(01n 2nter the no. o ertices0)&

scan(04d05?n)&

7/18/2019 CYCLE2


print(01n 2nter the costs o edges in matri orm+0)&

or(i*-&i<n&i) or(W*-&W<n&W)

scan(04d05?cost$i%$W%)&

print(01n Bhe matri is+0)&

or(i*-&i<n&i)

or(W*-&W<n&W)

print(04d1t05cost$i%$W%)&

print(01n0)

'

prim()&

'

Sample Input Output:

Prm!" #lgort$m

ZZZZZZZZZZZZZZZZZZZ

2nter the no. o ertices 9

2nter the costs o edges in matri orm+

EE

9

EE

"

9

"

EE

Bhe matri is

EE 9

EE "

9 " EE

Bhe min spanning tree is+

- ,

- 9

7in cost+ "

7/18/2019 CYCLE2


Program Code :-

//Program No.,R Shortest Path Algorithm(:iWsktraGs Algorithm)#deine INCINIB= EEEE

#include <stdio.h>

#include <conio.h>

#deine 7AM ,-

oid diWkstra(int K$7AM%$7AM%5int n5 int startnode)&

oid main()

int K$7AM%$7AM%5i5W5n5nooedges5u55@&

print(01n1t:iWsktraGs Algorithm0)&

print(01n1tH++++++++++++++++++H0)&

print(01n2nter no. o ertices 0)&

scan(04d05?n)&

print(01nNo. o edges 0)&

scan(04d05?nooedges)&

print(01n2nter edges (u55@eight) 0)&

or(i*-&i<nooedges&i)

scan(04d4d4d05?u5?5?@)&

K$u%$%*K$%$u%*@& '

print(01n2nter the starting node 0)&

scan(04d05?u)&

diWkstra(K5n5u)&

'

oid diWkstra(int K$7AM%$7AM%5int n5 int startnode)

int cost$7AM%$7AM%5distance$7AM%5pred$7AM%&

int isited$7AM%5count5mindistance5netnode5i5W&

or(i*-&i<n&i)

or(W*-&W<n&W)

i(K$i%$W%**-)

cost$i%$W%*INCINIB=&

else

cost$i%$W%*K$i%$W%&

or(i*-&i<n&i)

7/18/2019 CYCLE2


distance$i%*cost$startnode%$i%& pred$i%*startnode&isited$i%*-&

'

distance$startnode%*-&isited$startnode%*,&

count*,&

@hile(count<n+,)

mindistance*INCINIB= &

or(i*-&i<n&i)

i(distance$i% < mindistance ?? 3isited$i%)

mindistance*distance$i%&

netnode*i&

'

isited$netnode%*,&

or(i*-&i<n&i)

i(3isited$i%)

i(mindistancecost$netnode%$i%<distance$i%)

distance$i%*mindistancecost$netnode%$i%& pred$i%*netnode&

'

count&

'

or(i*-&i<n&i)

i(i3*startnode)

print(01n :istance o 4d * 4d 05i5distance$i%)&

print(01nPath * 4d 05i)&

W*i&

do

W*pred$W%&

print(0<+ 4d 05W)&

'@hile(W3*startnode)&

7/18/2019 CYCLE2


'

'

Sample Input Output:-

:iWsktraGs Algorithm

H++++++++++++++++++H

2nter no. o ertices ;

No. o edges "

2nter edges (u55@eight) - ,

, ,

9

9 - "

- 9

2nter the starting node ,

:istance o - *

Path * - <+ ,

:istance o * ,Path * <+ ,

:istance o 9 * 9

Path * 9 <+ <+ ,

Documents

CYCLE2