tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

1






tAHF .- PAt0YA HlTFSH .#
Su .- 0ATA ST#uCTu#F.
SFH .- 3
#0
SFH.
#*t0 .- 16.
FXAH*t .- 61.

tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

2




`. lJ!. I.!
`.
I`.!!

. W8l1L A C8C8AM 1PA1 L8lC8M 1
ALL 1PL 8ASlC CL8A1lCn Cl
S1AC1lC S1ACk
. W8l1L A 8CC8AM 1PA1 L8lC8M 6
ALL 1PL 8ASlC CL8A1ln Cl S1A1lC
Cl8CuLA8 CuLuL
. W8l1L A 8CC8AM 1C CCnvL81 9
lnllx 1C L8llx
. W8l1L A 8CC8AM L8lC8M 11
CL8A1lCn Cn Cl8CuLA8 LlnkLu
LlS1
. W8l1L A 8CC8AM 1C lMLLMLn1 16
u?nAMlC CuLuL
. W8l1L A 8CC8AM 1C SC81lnC 19
1LCAnlC vALuL
SLLLC1lCn SC81
lnSL81lCn SC81
CulCk SC81
ACCC8lnC 1C uSL8 CPClCL
. C8LA1L A MLnu u8lvLn ALlCA 23
1lCn lC8 lCLLCWlnC SLA8CPlnC
1LCPlCuL
LlnLA8 SLA8CPlnC
8lnA8? SLA8CPlnC
SLA8CPlnC SPCuLu 8L L8lC8M
ACCC8ulnC 1C uSL8

tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

3

Q.: Write a program tbat perform all tbe basic operation of static Stack.
$
/* Program Ior $9ack*/

#includes9dio.h~
#includeconio.h~
#includes9dlib.h~
in9 a|100|,9op-1;
void main()

in9 ch;
void push();
void pop();
void peep();
void upda9e();
void display();
while(1)

clrscr();

prin9I("\n**********************************************");
prin9I("\n\9\9 Program Ior simple s9ack");
prin9I("\n**********************************************
*");
prin9I("\n\9\9 Choice Op9ion");
prin9I("\n\9\9********************************************
**);
prin9I("\n\9\9\9 1.\9 Push");
prin9I("\n\9\9\9 2.\9 Pop");
prin9I("\n\9\9\9 3.\9 Peep");
prin9I("\n\9\9\9 4.\9 Upda9e");
prin9I("\n\9\9\9 5.\9 Display");
prin9I("\n\9\9\9 6.\9 Exi9");
prin9I("\n\9\9 En9er your choice");
scanI("d",&ch);
swi9ch(ch)


case 1

push();
break;
case 2

pop();
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

4

break;
}
case 3

peep();
break;
}
case 4

upda9e();
break;
}
case 5

display();
break;
}
case 6

exi9(1);
}
deIaul9

prin9I("\n\n\9\9 wrong choice!Try again");
}

}
}
}
void push()


in9 num;
clrscr();
iI(9op1~10)

prin9I("\n\n\9\9 s9ack overIlow");
ge9ch();
}
else

prin9I("\n\n En9er in9eger value");
scanI("d",&num);
9op9op1;
a|9op|num;
}
}

tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

5
void pop()

in9 9mp;
clrscr();
iI(9op-1)

prin9I("\n $9ack underIlow");
ge9ch();
}
else

9mpa|9op|;
prin9I("\n\n d is dele9ed Irom s9ack",9mp);
ge9ch();
9op--;
}
}
void peep()

in9 i;
clrscr();
prin9I("\n\9\9 which elemen9 u wan9 9o display Irom 9op");
scanI("d",&i);
iI((9op-i1)-1)


prin9I("\n\9 s9ack underIlow");
ge9ch();
}
else

prin9I("\n\n\9\9 Value a9 d loca9ion Irom 9op isd",i,a|9op-
i1|);
ge9ch();
}
}
void upda9e()

in9 i;
clrscr();
prin9I("\n which elemen9 u wan9 9o change Irom 9op");
scanI("d",&i);
iI((9op-i1)-1)





prin9I("\n s9ack underIlow.............");
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

6
ge9ch();
}
else

prin9I("\n value a9 9his loca9ion isd",a|9op-i1|);
scanI("d",&a|9op-11|);
}
}
void display()

in9 i;
clrscr();
prin9I("\n s9ack con9ains");
prin9I("\n");
Ior(i0;i9op;i)

prin9I("\n d",a|i|);

}
iI(i0)
prin9I("\n\n\9\9 Emp9y s9ack............");
else

prin9I("9 -9op");
ge9ch();
}
}



I


Program Ior simple 9o s9ack
*************************************************
Choice Op9ion
*************************************************
1.Push
2.Pop
3.Peep
4.Upda9e
5.Display
6.Exi9



En9er your choice1
En9er in9eger value25
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

7
En9er your choice1
En9er in9eger value30
En9er your choice1
En9er in9eger value35
En9er your choice5

25
30
35

En9er your choice4
Which you wan9 9o change Irom 9op1

Value a9 9his loca9ion is 30 45
En9er your choice3

Which elemen9 you wan9 9o display Irom 9op 1
Value a9 1 loca9ion Iro 9op is45
En9er your choice5
$9ack con9ains

25
45
35 9 - 9op

En9er your choice2
35 is dele9e Irom s9ack
En9er your choice6




Q.: Write a program tbat perform all tbe basic operation of static
Circular queue.
ns
/* $9a9ic circular queue */

#includes9dio.h~
#includeconio.h~
#includes9dlib.h~
#deIine size 5
in9 Iron9-1;
in9 rear-1;
in9 q|size|;
void inser9();
void del();
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

8
void prin9();
void main()

in9 ch;
do

clrscr();
prin9I("\n**************************************");
prin9I("\n\9\9\9 1.inser9");
prin9I("\n\9\9\9 2.dele9e");
prin9I("\n\9\9\9 3.display");
prin9I("\n\9\9\9 4.exi9");
prin9I("\n***************************************");
prin9I("\n En9er 9he choice........");
scanI("d",&ch);
swi9ch(ch)

case 1
inser9();
prin9();
ge9ch();
break;

case 2
del();
prin9();
ge9ch();
break;



case 3
prin9();
ge9ch();
break;

case 4
exi9(0);
}
}while(ch!4);
}
void inser9()

in9 no;
iI((Iron90 && rearsize-1),,(Iron9rear1))

prin9I("\n overIlow.....");
re9urn;
}
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

9
else iI(Iron9-1)

Iron90;
rear0;
}
else iI(rearsize-1)

rear0;
}
else
rear;
prin9I("\n En9er no");
scanI("d",&no);
q|rear|no;
}
void del()

iI(Iron9-1)

prin9I("\n underIlow.....");
re9urn;
}
prin9I("\n Elemen9 dele9edd",q|Iron9|);
iI(Iron9rear)

Iron9-1;
rear-1;
}
else


iI(Iron9size-1)
Iron90;
else
Iron9;
}
}
void prin9()

in9 i;
iI(Iron9-1)

prin9I("\n queue is emp9y......");
re9urn;
}
iI(rear~Iron9)

Ior(iIron9;irear;i)
prin9I("\n d",q|i|);
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

10
}
}

I

*****************************************************
1.Inser9
2.Dele9e
3.Display
4.Exi9
*****************************************************
En9er your choice..1
En9er no15
15
En9er your choice..1
En9er no20
15
20
En9er your choice..1
En9er no25
15
20
25
En9er your choice..3
15
20

25
En9er your choice...2
Elemen9 dele9e15
20
25
En9er your choice...4

Q.: Write a program to convert infix to prefix.
$
/* conver9 in9o preIix expressio */

#includes9dio.h~
#includeconio.h~
#includema9h.h~
#includes9ring.h~
in9 9op;
char q|50|,s|50|,p|50|;
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

11
void push(char i9);
char pop();

void main()

in9 i,j0;
in9 li;
clrscr();
q|0|'(';
prin9I("\n en9er 9he inIix expression");
Ior(i1;(q|i|ge9char())!'\n';i);
s|9op|')';
Ior(il-1;i~0;i--)

swi9ch(q|i|)

case ')'
push(q|i|);
break;

case '`'
while(s|9op|'`')

p|j|pop();
}
push(q|i|);
break;


case '*'
case '/'
while(s|9op|'`' ,, s|9op|'*' ,, s|9op|'/')

p|j|pop();
}
push(q|i|);
break;

case ''
case '-'
while(s|9op|'`' ,, s|9op|'*',, s|9op|'/' ,, s|9op|''
,, s|9op|'-')

p|j|pop();
}
push(q|i|);
break;

case '('
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

12
while(s|9op|!')')

p|j|pop();
}
9op-1;
break;
deIaul9
p|j|q|i|;
break;
}
}
prin9I("\n 9he preIix expression");
s9rrev(p);
prin9I("s",p);
ge9ch();
}
void push(char i9)

9op1;
s|9op|i9;
}
char pop()

char 9s|9op|;
9op-1;
re9urn(9);
}

En9er 9he inIix expressionac*d

The preIix expressiona*cd
Q.: Write a program perform operation on circular linked list.
$
/* Program on circular link lis9 */

#includes9dio.h~
#includeconio.h~

s9ruc9 clink

in9 da9a;
s9ruc9 clink *nex9;
};
9ypedeI s9ruc9 clink cl;
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

13
void addb(in9);
void addlas9(in9);
void addpos(in9 ,in9);
void disp();
void dele(in9);
void sor9();
cl *s9ar9ULL;
void main()

in9 x,ch,ps;
clrscr();
do

prin9I("\n");
prin9I("\n\9\9\****** En9er 9yhe choice******\n");
prin9I("\n\9\9 1dd a9 begine");
prin9I("\n\9\9 2dd a9 end");
prin9I("\n\9\9 3dd a9 speciIic posi9ion");
prin9I("\n\9\9 4Dele9e 9he speciIic node");
prin9I("\n\9\9 5Display");
prin9I("\n\9\9 6$or9 lis9");
prin9I("\n\9\9 7Exi9\n");

prin9I("\n");
prin9I("\n\9\9 Choice is");
scanI("d",&ch);
swi9ch(ch)

case 1
prin9I("\n En9er 9he i9em 9o add a9 begine");
scanI("d",&x);
addb(x);
disp();
break;

case 2
prin9I("\n En9er 9he i9em 9o add a9 las9");
scanI("d",&x);
addlas9(x);
disp();
break;

case 3
prin9I("\n En9er 9he i9em 9o add a9 speciIic posi9ion");
scanI("d",&x);
prin9I("\n En9er posi9ion a9 which you wan9 9o inser");
scanI("d",&ps);
addpos(x,ps);
disp();
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

14
break;

case 4
prin9I("\n En9er 9he i9em no which you wan9 9o
dele9e");
scanI("d",&x);
dele(x);
disp();
break;

case 5
disp();
break;

case 6
sor9();
disp();
break;

case 7
break;

deIaul9

prin9I("\n choice is no9 availabel");
break;
}
ge9ch();
clrscr();
}while(ch!6);
}
void addb(in9 x)

cl *q;
iI(s9ar9ULL)

s9ar9new cl;
s9ar9-~da9ax;
s9ar9-~nex9ULL;
}
else

q new cl;
q-~da9ax;
q-~nex9s9ar9;
s9ar9q;
}
}
void addlas9(in9 x)
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

15

iI(s9ar9ULL)

s9ar9new cl;
s9ar9-~da9ax;
s9ar9-~nex9ULL;
}
else

cl *q,*9;
qs9ar9;
while(q-~nex9!s9ar9)
qq-~nex9;
9new cl;
9-~da9ax;
9-~nex9s9ar9;
q-~nex99;
}
}
void disp()

cl *q;

prin9I(" \n ");
Ior(qs9ar9;q-~nex9!s9ar9;qq-~nex9)
prin9I("\9 d",q-~da9a);
}


void addpos(in9 x,in9 pos)

cl *q,*9,pre;
qs9ar9;
iI(pos1)

addb(x);
re9urn;
}
Ior(in9 i1;ipos-1;i)

iI(qULL)

prin9I("\n circular link lis9 emp9y");
re9urn;
}
qq-~nex9;
}
9new cl;
9-~da9ax;
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

16
9-~nex9q-~nex9;
q-~nex99;
}
void dele(in9 ps)

cl *q,*9,*pre;
qs9ar9;
iI(qULL)

prin9I("\n circular link lis9 is emp9y....");
}
else

iI(ps1)

s9ar9q-~nex9;
dele9e q;
re9urn;
}
Ior(in9 i0;ips-1;i)


preq;
qq-~nex9;
}
pre-~nex9q-~nex9;
dele9e q;
}
}
void sor9()

cl *q,*9;
in9 s;
Ior(qs9ar9;q-~nex9!s9ar9;qq-~nex9)

Ior(9q-~nex9;9!ULL;99-~nex9)

iI(q-~da9a~9-~da9a)

sq-~da9a;
q-~da9a9-~da9a;
9-~da9as;
}
}
}
}

I

tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

17

Q.: Write a program to implement Dynamic Queue.
$
/* Program wi9h dynamic queue */

#includes9dio.h~
#includeconio.h~
#includealloc.h~
s9ruc9 queue

in9 da9a;
s9ruc9 queue *nex9;
}*s9ar9ULL;
9ypedeI s9ruc9 queue q;
void inser9*inIo();
void display();
void dele9e*inIo();
void main()

s9ruc9 queue *del;
in9 ch1;
clrscr();
do

prin9I("\n***********************************");
prin9I("\n $elec9 your choice-~");
prin9I("\n\9 1.inser9");
prin9I("\n\9 2.dele9e");
prin9I("\n\9 3.display");
prin9I("\n\9 4.exi9");
prin9I("\n*************************************");
prin9I("\n\n\9 En9er your ch");
scanI("d",&ch);
swi9ch(ch)

case 1
inser9*inIo();
display();
ge9ch();
clrscr();
break;
case 2
dele9e*inIo();
display();
ge9ch();
clrscr();
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

18


break;
case 3
display();
break;
case 4
ge9ch();
break;
}
}while(ch4);
prin9I("\n end oI program");
ge9ch();
}
void inser9*inIo()

in9 inIo;
q *new1,*node;
new1new q;
prin9I("\n\9 inser9 inIorma9ion");
scanI("d",&inIo);
new1-~da9ainIo;
new1-~ULL;
iI(s9ar9ULL)

s9ar9new1;
}
else

nodes9ar9;
while(node-~nex9!ULL)
nodenode-~nex9;
node-~nex9new1;
}
}
void dele9e*inIo()

q *9emp;
9emps9ar9;
s9ar9s9ar9-~nex9;
dele9e 9emp;
}
void display()

clrscr();
q *nodes9ar9;
iI(s9ar9ULL)

prin9I("\n\9 o da9a in queue");
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

19


prin9I("\n\9 Queue is emp9y");
}
else

prin9I("\n\9 Display inIorma9ion in queue");
prin9I("\n\9");
while(node!ULL)

prin9I("\9d",node-~da9a);
nodenode-~nex9;
}
}
}

I

**********************************************
$elec9 your choice-
1.Insere9
2.Dele9e
3.Display
4.Exi9
**********************************************

En9er your choice1
Inser9 inIorma9ion 25
Display inIorma9ion in queue


25
En9er your choice1
Inser9 inIorma9ion 30
Display inIorma9ion in queue

25 30
En9er your choice1
Insere9 inIorma9ion35
Display inIorma9ion in queue

25 30 35
En9er your choice1
Insere9 inIorma9ion40
Display inIorma9ion in queue


tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

20

25 30 35 40
En9er your choice3
25 30 35 40
En9er your choice2
30 35 40
En9er your choice4


Q.: Write a program to sorting tecbanique value:
Selection sort
Insertion sort
Quick sort
According to user cboice.
$

/* $or9ing oI program*/

#includes9dio.h~
#includeconio.h~
void quick*sor9(in9 array||,in9 Iirs9,in9 las9)

in9 9emp,low,high,lis9*sep;
lowIirs9;
highlas9;
lis9*separray|(Iirs9las9)/2|;
do

while(array|low|lis9*sep)
low;
while(array|high|~lis9*sep)
high--;
iI(lowhigh)

9emparray|low|;
array|low|array|high|;
array|high|9emp;
}
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

21

}
while(lowhigh);
iI(Iirs9high)
quick*sor9(array,Iirs9,high);
iI(lowlas9)
quick*sor9(array,low,las9);
}
void main()

in9 a|20|,no,i,coun90,n,j0,loc,sml,ch,values|5|;
clrscr();
prin9I("\n");
prin9I("\n\9\9 choice op9ion");
prin9I("\n\9\9 1.selec9ion sor9");
prin9I("\n\9\9 2.inser9ion sor9");
prin9I("\n\9\9 3.Quick sor9");
prin9I("\n\9\9 4.exi9");
prin9I("\n");
prin9I("\n En9er your choice");
scanI("d",&ch);
prin9I("\n How many no do you wan9");
scanI("d",&n);
swi9ch(ch)

case 1
Ior(i0;in;i)

prin9I("\n En9er no");
scanI("d",&no);
}
Ior(i0;in;i)

smla|i|;
loci;
Ior(ji1;jn;j)

iI(a|j|sml)

smla|j|;
locj;
}
iI(a|i|!sml)

a|loc|a|i|;
a|i|sml;
}
}

tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

22
}
prin9I("\n $elec9ion sor9ed da9a");
Ior(i0;in;i)

prin9I("\n d",a|i|);
}
ge9ch();
break;

case 2
while(coun9n)

prin9I("\n En9er elemen9");
scanI("d",&no);
coun9;
ij-1;
while(noa|i| && i~0)

a|i1|a|i|;
i--;
}
a|i1|no;
j;
prin9I("\n");
Ior(i0;icoun9;i)
prin9I("\9 d",a|i|);
}
ge9ch();
break;

case 3
prin9I("\n Unsor9ed lis9 is as Iollows\n");
Ior(i0;i5;i)

prin9I("\n En9er no");
scanI("d",&no);
}
quick*sor9(values,0,4);
prin9I("\n $or9ed lis9 as Iollow\n");
Ior(i0;i5;i)

prin9I("d",values|i|);
}
ge9ch();
break;
case 4
ge9ch();

break;
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

23
}
ge9ch();
}

I


choice op9ion
selec9ion sor9
Inser9ion sor9
Quick sor9
Exi9
En9er your choice1

How many no do you wan95

En9er no10
En9er no20
En9er no-11
En9er no15
En9er no6

$elec9ion sor9ed da9a
-11
6
10
15
20

En9er your choice2

How many no do you wan95

En9er elemen910
10
En9er elemen96
6 10
En9er elemen92
2 6 10
En9er elemen966
2 6 10 66
En9er elemen9-5
-5 2 6 10 6 En9er your
choice3


En9er no 12
En9er no0
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

24
En9er no2
En9er no3
En9er no7

$or9ed Lis9 as Iollow

0 2 3 7 12

Q.: Create a menu driven application for following searcbing
Tecbnique. .Linear searcbing .Binary searcbing
sbould be perform according to user.
$
/* $earching oI program*/

#includes9dio.h~
#includeconio.h~
void lina*search(in9 elemen9,in9 n,in9 lis9||);
in9 binary*search(in9 elemen9,in9 n, in9 lis9||);
void main()

in9 i,j,n,no,arr|10|,ch;
clrscr();
prin9I("\n");
prin9I("\n\9\9 1.Linear search");
prin9I("\n\9\9 2.Binary search");
prin9I("\n\9\9 3.exi9");
prin9I("\n");
prin9I("En9er number oI elemen9 you wan9 9o en9er in
array");

scanI("d",&n);
Ior(i0;in;i)

prin9I("\n En9er 9he no");
scanI("d",&arr|i|);
}
prin9I("\n En9er 9he values 9o be searched");
scanI("d",&no);
//lina*search(no,n,arr);
//binary*search(no,n,arr);
prin9I("\n En9er your choice");
scanI("d",&ch);
swi9ch(ch)

tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

25
case 1
lina*search(no,n,arr);
break;


case 2
binary*search(no,n,arr);
break;

case 3
break;
}
ge9ch();
}
void lina*search(in9 elemen9,in9 n,in9 lis9||)

in9 k,Ilag0;
Ior(k0;kn;k)

iI(lis9|k|elemen9)

prin9I("\n search is successIul");
prin9I("\n Elemen9 Iound a9 d

loca9iond",k1,elemen9);
Ilag1;
re9urn;
}
}
iI(Ilag0)
prin9I("\n search is unsuccessIul");
}
in9 binary*search(in9 elemen9,in9 n,in9 lis9||)


in9 high,low,mid,Ilag0;
highn-1;
low0;
mid(lowhigh)/2;
while(Ilag!1 && lowhigh)

iI(elemen9lis9|mid|)
highmid1;
else iI(elemen9~lis9|mid|)
lowmid1;
else iI(elemen9lis9|mid|)


prin9I("\n search is successIul");
tAHF . I.`!`. !I!! !. #*t .16.

Su . !.. !!!. FXAH*t . .

26
prin9I("\n\n Iound a9 d loca9ion
d",mid1,elemen9);
}
mid(lowhigh)/2;
}
iI(Ilag0)
prin9I("\n search is unsuccessIul");
}

I


1.Linear search
2.Binary search
3.Exi9

En9er number oI elemen9 you wan9 9o en9er oI array5

En9er 9he no10
En9er 9he no25
En9er 9he no7
En9er 9he no8
En9er 9he no9

En9er 9he values 9o be search8

En9er your choice1

$earch is successIul
Elemen9 Iound a9 4 loca9ion8

En9er 9he values 9o be search25


En9er your choice2

$earch is successIul
Elemen9 Iound a9 1 loca9ion25