7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 1/42
Program 1:#include<iostream.h>#include<conio.h>
#include<math.h>float simpleinterest(int p,float r,int t){
float sinterest=0sinterest=((p!r!t)"100)return sinterest
float compoundinterest(int p,float r,int t){
float cinterest=0cinterest=(p!(po$((1%(r"100)),t))return cinterest
&oid main(){
clrscr()
int p,t,chfloat r,interest=0
cout<<'nnter the amount'cin>>pcout<<'nnter the rate of interest'cin>>rcout<<'nnter the time'cin>>t
cout<<'nnter *our choice :'cout<<'n+alculate interest on amount using'cout<<'n1.imple -nterest'cout<<'n.+ompound -nterest'cin>>ch
s$itch(ch){
case 1:interest=simpleinterest(p,r,t)cout<<'n/mount after imple -nterest is '<<interest rea
case :
interest=compoundinterest(p,r,t)cout<<'n/mount after +ompound -nterest is '<<interest rea
default:cout<<'n2rong +hoice.'
getch()
Program :#include<iostream.h>#include<conio.h>
#include<process.h>&oid main(){
clrscr()int 3,n,iint total=1
cout<<'nnter a numer '
cin>>3cout<<'nnter the po$er '
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 2/42
cin>>nif(n<0){
cout<<'n4egati&e po$er'e3it(0)
for(i=1i<=ni%%){
total=total!3
cout<<'n'<<3<<' raised to '<<n<<' is '<<totalgetch()
Program 5:
#include<iostream.h>#include<conio.h>#include<stdio.h>#include<ct*pe.h>
&oid main(){
clrscr()char ch6507int cal=0,sal=0,nal=0cout<<'nnter a string'gets(ch)for(int i=0ch6i78=909i%%)
{if(isupper(ch6i7))
cal%%else if(islo$er(ch6i7))
sal%%
elsenal%%
cout<<'n 4o of +apital /lphaets '<<calcout<<'n 4o of mall /lphaets '<<salcout<<'n 4o of 4on/lphaets '<<nalgetch()
Program ;:#include<iostream.h>#include<conio.h>#include<stdio.h>#include<ct*pe.h>
&oid main(){
clrscr()char ch6507cout<<'nnter a string'gets(ch)
for(int i=0ch6i78=909i%%){
if(isupper(ch6i7))ch6i7=tolo$er(ch6i7)
else if(islo$er(ch6i7))ch6i7=toupper(ch6i7)
cout<<'ntring after change is ' puts(ch)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 3/42
getch()
Program :#include<iostream.h>#include<conio.h>
&oid main(){
clrscr()
int arr6107,ncout<<'nnter sie of arra* 'cin>>ncout<<'nnter arra* elements 'for(int i=0i<ni%%)
cin>>arr6i7
cout<<'nntered elements of arra* are 'for(i=0i<ni%%)
cout<<arr6i7<<' 'getch()
Program :#include<iostream.h>#include<conio.h>&oid main(){
clrscr()
int arr6107,ncout<<'nnter sie of arra* 'cin>>ncout<<'nnter arra* elements 'for(int i=0i<ni%%)
cin>>arr6i7cout<<'n/rra* elements in re&erse order are 'for(i=n1i>=0i)
cout<<arr6i7<<' 'getch()
Program ?:#include<iostream.h>#include<conio.h>#include<process.h>&oid main(){
clrscr()int a6767,6767,c6767int i,@,,m,n,p,rcout<<'nnter the numer of ro$s and columns of matri3 / 'cin>>m>>ncout<<'nnter the numer of ro$s and columns of matri3 A '
cin>>p>>rcout<<'nnter elements of matri3 / 'for(i=0i<mi%%){
for(@=0@<n@%%)cin>>a6i76@7
cout<<'nnter elements of matri3 A 'for(i=0i<pi%%)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 4/42
{for(@=0@<r@%%)
cin>>6i76@7
int chcout<<'nnter *our choice'
cout<<'n1. /ddition of Batrices / and A'cout<<'n. Cifference of Batrices / and A'cout<<'n5. Product of / and A'
cin>>chs$itch(ch){
case 1:if(m8=pDDn8=r){
cout<<'n+annot add matrices'e3it(0)
for(i=0i<mi%%)
{for(@=0@<n@%%)
{c6i76@7=a6i76@7%6i76@7
cout<<'nEesultant matri3 is n'for(i=0i<mi%%)
{for(@=0@<n@%%){
cout<<c6i76@7<<' '
cout<<endl rea
case :if(m8=pDDn8=r){
cout<<'n+annot sutract matrices'
e3it(0)for(i=0i<mi%%){
for(@=0@<n@%%){
c6i76@7=a6i76@76i76@7
cout<<'nEesultant matri3 is 'for(i=0i<mi%%){
for(@=0@<n@%%){
cout<<c6i76@7<<' 'cout<<endl
rea
case 5:if(n8=p)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 5/42
{cout<<'n+annot multipl* matrices'e3it(0)
for(i=0i<mi%%){
for(@=0@<r@%%){
c6i76@7=0
for(=0<n%%){c6i76@7=c6i76@7%(a6i767!676@7)
cout<<'nEesultant matri3 is 'for(i=0i<mi%%){
for(@=0@<r@%%)
{cout<<c6i76@7<<' '
cout<<endl
rea
default:cout<<'n2rong choice'
reagetch()
Program F:#include<iostream.h>#include<conio.h>#include<process.h>&oid main(){
clrscr()int a6767int i,@,m,ncout<<'nnter the numer of ro$s and columns of matri3 / 'cin>>m>>nif(m8=n)
e3it(0)cout<<'nnter elements of matri3 / 'for(i=0i<mi%%){
for(@=0@<n@%%)cin>>a6i76@7
int sum=0cout<<'nCiagonal elements are n'for(i=0i<mi%%){
for(@=0@<n@%%)
{
if(i==@){
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 6/42
sum=sum%a6i76@7cout<<a6i76@7
elsecout<<' '
cout<<'num of diagonal elements is '<<sumgetch()
Program G:#include<iostream.h>#include<conio.h>#include<stdio.h>
#include<process.h>struct student{
char name6507
int rollint mar1
int marint mar5int total
st61007int main(){
int n,ch,i,@,rchar choicedo{cout << '1. -nput tudent Cetails '<<endl
cout << '. Print report'<<endlcout << '5. earch for a tudent'<<endlcout << ';. 3it'cin >> chs$itch(ch){
case 1: cout << 'nter ho$ man* students '
cin >>nfor(i=0i<ni%%){
cout << 'nter name 'gets(st6i7.name)cout <<endl<< 'nter Eoll 4umer '
cin >>st6i7.rollcout << 'nter Bar1 'cin >>st6i7.mar1cout << 'nter Bar 'cin >> st6i7.marcout << 'nter Bar5 '
cin >> st6i7.mar5st6i7.total = st6i7.mar1%st6i7.mar%st6i7.mar5
reacase :
student temp
for (i=0i<ni%%){
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 7/42
for(@=i@<n1@%%){
if ([email protected]>st6@%17.total)
{temp = st6@7st6@7=st6@%17
st6@%17=temp
cout <<'4ame 'cout <<'Eoll'cout <<'Bar1'cout <<'Bar'cout <<'Bar5'
cout <<'Hotal'
for(i=0i<ni%%){
cout <<st6i7.namecout <<st6i7.rollcout <<st6i7.mar1
cout <<st6i7.marcout <<st6i7.mar5cout <<st6i7.total
rea
case 5: int trollcout << 'nnter the roll numer to e searched 'cin >> trollfor(i=0i<ni%%)
{if (st6i7.roll == troll)
{cout << ' n 4ame '<<st6i7.namecout << 'n Eoll '<< st6i7.rollcout << 'n Bar1 '<<st6i7.mar1cout << 'n Bar '<<st6i7.marcout << 'n Bar5 '<<st6i7.mar5
cout << 'n total '<<st6i7.total
rea
case ;: e3it(0)
cout << 'n Co I $ant to continue'cin>>choice$hile(choice == 9J9 DDchoice ==9*9)
getch()return 0
Program 10:
#include<iostream.h>
#include<math.h>
#include<conio.h>float area(float p)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 8/42
{return 5.1;!p!p
float area(int p){
return p!p
float area(float p,float K){return p!K
float area(int p, int K)
{return (0.!p!K)
float area(float p,float K, float r){
float ss=(p%K%r)"return sKrt(s!(sp)!(sK)!(sr))
&oid main()
{clrscr()int p,K,chfloat a,,rchar choicedo{
cout<<'nn+hoose from the follo$ing : 'cout<<'nn1. /rea of sKuare 'cout<<'nn. /rea of circle 'cout<<'nn5. /rea of rectangle 'cout<<'nn;. /rea of right triangle 'cout<<'nn. /rea of triangle 'cout<<'nnnter *our choice : ' cin>>ch
s$itch(ch){case 1: cout<<'nnnter side of sKuare : '
cin>>pcout<<'nnarea of sKuare is : '<<area(p)
rea
case : cout<<'nnnter radius of circle : 'cin>>acout<<'nnarea of circle is : '<<area(a) rea
case 5: cout<<'nnnter length of rectangle : 'cin>>acout<<'nnnter readth of rectangle : 'cin>>cout<<'nnarea of rectangle is : '<<area(a,)
rea
case ;: cout<<'nnnter ase and altitude of right triangle : '
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 9/42
cin>>pcin>>Kcout<<'nnarea of right triangle is : '<<area(K,p)
rea
case : cout<<'nnnter sides of triangle : 'cin>>acin>>
cin>>rcout<<'nnarea of triangle is : '<<area(a,,r) rea
cout<<'nn2ant to choose again : '
cin>>choice$hile(choice==9*9DDchoice==9J9)
getch()
Program 11:
#include<iostream.h>#include<conio.h>#include<stdio.h>
class tudent{
pri&ate:int rollnochar stuLname6507
int claschar address607float percent
pulic:&oid getdata(){
cout<<endl<<'nter roll numer '
cin>>rollnocout<<endl<<'nter name 'gets(stuLname)cout<<endl<<'nter address 'gets(address)cout<<endl<<'nter +lass '
cin>>clascout<<endl<<'nter percentage 'cin>>percent
&oid putdata(){
cout<<endl<<'Eoll numer '<<rollnocout<<endl<<'4ame ' puts(stuLname)cout<<endl<<'/ddress ' puts(address)cout<<endl<<'+lass '<<clas
cout<<endl<<'Percentage '<<percent
int retLrollno()
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 10/42
{return rollno
int retLclas(){
return clas
&oid main()
{clrscr()tudent s67int i,roll,clasnofor(i=0i<i%%){
cout<<'nter details for tudent '<<i%1s6i7.getdata()
cout<<endl<<'nter the roll numer $hose details *ou $ish to see '
cin>>rollcout<<endl<<'nter the +lass '
cin>>clasnoint flag=0for(i=0i<i%%){
if((s6i7.retLrollno()==roll) MM (s6i7.retLclas()==clasno)){
s6i7.putdata()flag=1
if(flag==0)
cout<<endl<<'4o student $ith such roll numer e3ists 'getch()
Program 15:
#include<iostream.h>
#include<conio.h>#include<stdio.h>class Person{
pri&ate:char name6507
char address607long int phoneno
pulic:&oid readinfo(){
cout<<endl<<'nter name '
gets(name)cout<<endl<<'nter address 'gets(address)cout<<endl<<'nter phone numer 'cin>>phoneno
&oid sho$info()
{cout<<endl<<'4ame : '
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 11/42
puts(name)cout<<endl<<'/ddress : ' puts(address)
cout<<endl<<'Phone 4o : '<<phoneno
class tudent:pulic Person{
pri&ate:
int rollnochar schoolnm6507int clasfloat percent
pulic:&oid readstudinfo()
{readinfo()cout<<endl<<'nter chool name 'gets(schoolnm)
cout<<endl<<'nter Eoll 4umer 'cin>>rollno
cout<<endl<<'nter +lass 'cin>>clascout<<endl<<'nter Percentage 'cin>>percent
&oid displa*studinfo()
{sho$info()cout<<endl<<'chool 4ame : ' puts(schoolnm)cout<<endl<<'Eoll 4umer : '<<rollno
cout<<endl<<'+lass : '<<clascout<<endl<<'Percentage : '<<percent
class mplo*ee:pulic Person{
pri&ate:
int empidchar compan*nm6507char designation607
pulic:&oid readempinfo(){
readinfo()cout<<endl<<'nter +ompan* name 'gets(compan*nm)cout<<endl<<'nter mplo*ee id 'cin>>empidcout<<endl<<'nter Cesignation '
gets(designation)&oid displa*empinfo(){
sho$info()cout<<endl<<'+ompan* 4ame : '
puts(compan*nm)
cout<<endl<<'mplo*ee id : '<<empidcout<<endl<<'Cesignation : '
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 12/42
puts(designation)
&oid main(){
clrscr()
cout<<endl<<'tudent N@ect'tudent ss.readstudinfo()
s.displa*studinfo()cout<<endlcout<<endl<<'mplo*ee N@ect'mplo*ee ee.readempinfo()e.displa*empinfo()
getch()
Program 1;:
#include<iostream.h>
#include<conio.h>#include<stdio.h>class Person{
pri&ate:char name6507
char address607long int phoneno
pulic:&oid readinfo(){
cout<<endl<<'nter name 'gets(name)cout<<endl<<'nter address 'gets(address)cout<<endl<<'nter phone numer 'cin>>phoneno
&oid sho$info(){
cout<<endl<<'4ame : ' puts(name)cout<<endl<<'/ddress : ' puts(address)
cout<<endl<<'Phone 4o : '<<phoneno
class tudent:pulic Person{
pri&ate:
int rollnofloat percent
pulic:&oid readstudinfo(){
readinfo()
cout<<endl<<'nter Eoll 4umer '
cin>>rollnocout<<endl<<'nter Percentage '
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 13/42
cin>>percent&oid displa*studinfo()
{sho$info()cout<<endl<<'Eoll 4umer : '<<rollno
cout<<endl<<'Percentage : '<<percent
class Oraduatetudent:pulic tudent{
pri&ate:char su@ect6507char collegenm6507char $oring
pulic:&oid readgstudinfo(){
readstudinfo()
cout<<endl<<'nter +ollege name 'gets(collegenm)
cout<<endl<<'nter Bain u@ect 'gets(su@ect)cout<<endl<<'2oring(J"4): 'cin>>$oring
&oid displa*gstudinfo()
{displa*studinfo()cout<<endl<<'+ollege 4ame : ' puts(collegenm)cout<<endl<<'Bain u@ect : '
puts(su@ect)char $orstatus(){
return $oring
&oid main(){
clrscr()int *ear,iint $orstud=0,non$or=0cout<<endl<<'nter *ear '
cin>>*earOraduatetudent gs67for(i=0i<i%%){
gs6i7.readgstudinfo()if(gs6i7.$orstatus()==9*9DDgs6i7.$orstatus()==9J9)
$orstud%%else
non$or%%clrscr()cout<<endl<<'E.P. BBNE-/Q 4-NE + PIAQ-+ +RNNQ '<<endl
cout<<endl<<'Cetails of /lumus for Jear '<<*ear<<' are : '
cout<<endlcout<<endl<<'Jear : '<<*ear
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 14/42
cout<<endl<<'4o of $oring /lumunus '<<$orstudcout<<endl<<'4o of non$oring /lumunus '<<non$orcout<<endl
for(i=0i<i%%)gs6i7.displa*gstudinfo()
getch()
Program 1:
#include<iostream.h>#include<string.h>
#include<stdio.h>#include<conio.h>class +lothing{
char +ode617char H*pe617int iechar Baterial607
float Price pulic:
+lothing(){
strcp*(+ode,' ')strcp*(H*pe,' ')strcp*(Baterial,' ')ie = 0
Price = 0"" Cestructor to deallocate &aluesS +lothing()
{cout<<'+alling Cestructor'
&oid +alPrice(){
if (strcmp(Baterial, '+NHHN4') == 0){
Price = 100
elseif (strcmp(Baterial, 'QJ+E/') == 0){
Price = 100
&oid nter(){
cout << 'nter code : 'gets(+ode)
cout << 'nter t*pe : 'gets(H*pe)cout << 'nter sie : 'cin >> iecout << 'nter Baterial : 'gets(Baterial)
+alPrice()
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 15/42
"" Tunction to displa* &alues&oid ho$(){
cout << '+ode : ' puts(+ode)cout << 'H*pe : '
puts(H*pe)cout << 'ie : ' << ie << endlcout << 'Baterial : '
puts(Baterial)cout << 'Price : ' << Price
&oid main(){
clrscr()+lothing ++.nter()+.ho$()
Program 1:
#include<iostream.h>#include<conio.h>#include<stdio.h>class Aan
{ pri&ate:
long int accnochar name6507char address607
float alance pulic:
&oid readdata()&oid sho$data()&oid $ithdra$(int)&oid deposit(int)
&oid Aan::readdata(){
cout<<endl<<'nter account numer 'cin>>accnocout<<endl<<'nter name 'gets(name)
cout<<endl<<'nter address 'gets(address)cout<<endl<<'nter account alance 'cin>>alance
&oid Aan::sho$data()
{cout<<endl<<'/ccount numer '<<accnocout<<endl<<'4ame ' puts(name)cout<<endl<<'/ddress ' puts(address)
cout<<endl<<'/ccount alance '<<alance
&oid Aan::$ithdra$(int amount)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 16/42
{float al=0 al=alanceamount
if(al<1000){
cout<<endl<<'+annot $ithdra$ '
else{
alance=al
&oid Aan::deposit(int amount){
alance%=amount
&oid main(){
clrscr()
int chchar choice
do{cout<<endl<<'nter *our choice'cout<<endl<<'1. /dd Cetail 'cout<<endl<<'. ho$ Cetail 'cout<<endl<<'5. 2ithdra$ /mount '
cout<<endl<<';. Ceposit anount 'cin>>chAan 1int amt=0s$itch(ch)
{case 1:
1.readdata() rea
case : 1.sho$data() rea
case 5:amt=0cout<<endl<<'nter the amount *ou $ant to $ithdra$'cin>>amt 1.$ithdra$(amt) rea
case ;:amt=0cout<<endl<<'nter the amount *ou $ant to deposit'cin>>amt 1.deposit(amt) rea
default:cout<<endl<<'2rong choice'
cout<<endl<<'Co *ou $ish to continue(*"n)'cin>>choice$hile(choice==9*9DDchoice==9J9)
getch()
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 17/42
Program 1?:#include<iostream.h>#include<conio.h>
&oid s$ap(int !a,int !){
int temp
temp=!a!a=!!=temp
&oid main(){
clrscr()int 3,*cout<<'nnter &alues of 3 and * '
cin>>3>>*cout<<'nUalues efore s$apping are 'cout<<'n3='<<3<<'n*='<<*s$ap(M3,M*)
cout<<'nnUalues after s$apping are 'cout<<'n3='<<3<<'n*='<<*
getch()
Program 1F:
#include<iostream.h>
#include<conio.h>&oid main(){
clrscr()int a67={11,15,1,,,?F,G0
int !p=aint icout<<'n/rra* elements initiall* are n'for(i=0i<?i%%)
cout<<a6i7<<'n'cout<<'n/rra* elements using a pointer to arra* are n'for(i=0i<?i%%)
cout<<!p%%<<'n' p=acout<<'n/rra* elements after incrementing each element * 1 are n'for(i=0i<?i%%){
(!p)%%
cout<<a6i7<<'n'getch()
Program 1G:
#include<fstream.h>#include<stdio.h>#include<conio.h>#include<ct*pe.h>#include<process.h>&oid main()
{
clrscr()int n,@
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 18/42
fstream ofile,afilechar str61007char ch,ch1
do{
cout<<'nt1.+reate He3tnt.+ount &o$els"$ords"digitsnt5.ho$ He3tnt;.3it'cin>>chs$itch(ch)
{ case 919 :
ofile.open('smp.t3t',ios::out)cout<<'n nter Hhe He3t 'gets(str)ofile<<str
ofile.close() rea
case 99 :char tmp1
int &=0,d=0,$=0afile.open('smp.t3t',ios::in)
$hile(8afile.eof()){
afile.get(tmp1)if(tmp1==9a9DDtmp1==9e9DDtmp1==9i9DDtmp1==9o9DDtmp1==9u9)
&%%if(isdigit(tmp1))
d%%if(tmp1==9 9DDtmp1==9.9)
$%%
afile.close()cout<<'n 4o of Uo$els: '<<&cout<<'n 4o of digits: '<<dcout<<'n 4o of $ords: '<<$%1 rea
case 959 :afile.open('smp.t3t',ios::in)
$hile(afile){
afile.get(ch)cout<<ch
afile.close()
rea case 9;9 : e3it(0)cout<<'nt CN I $ant to continue 'cin>>ch1
$hile(ch1==9J9DDch1==9*9)
getch()
Program 0:
#include<fstream.h>
#include<conio.h>
#include<stdio.h>struct telrec
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 19/42
{long int telnochar custLname6507
t1&oid main(){
clrscr()int chchar choice
do{cout<<'nter *our choice '<<endlcout<<'1. /dd Cetail '<<endlcout<<'. Tind customer '<<endlcin>>ch
s$itch(ch){
case 1:ofstream f
f.open('HQPRN4.HVH',ios::out)cout<<'nter telephone numer : '
cin>>t1.telnocout<<endl<<'nter customer name : 'gets(t1.custLname)f.$rite((char!)Mt1,sieof(telrec))f.close() rea
case :long int telint flag=0ifstream f1f1.open('HQPRN4.HVH',ios::in)
cout<<'nter the numer *ou $ant to search 'cin>>telcout<<endl$hile(8f1.eof()){
f1.read((char!)Mt1,sieof(t1))if(t1.telno==tel)
{cout<<'+ustomer name is '<<t1.custLname<<endlflag=1 rea
if(flag==0) cout<<'+ustomer not found' f1.close() rea
cout<<'Co *ou $ish to continue(*"n) '
cin>>choice$hile(choice==9*9DDchoice==9J9)getch()
Program 1:
#include<fstream.h>#include<stdio.h>
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 20/42
#include<conio.h>#include<process.h>#include<string.h>
class donor {
char name6507
char address6507char group67 pulic:
&oid input(){
cout<<'nnter Conor 4ame: 'gets(name)cout<<'nter /ddress: 'gets(address)
cout<<'nter Alood Oroup: 'gets(group)
&oid displa*()
{cout<<'nConor 4ame: '<<name<<'t/ddress: '<<address<<'tAlood Oroup:
'<<group<<'t'
char !getgroup(){
return group
&oid main(){
clrscr()donor dint n,i,@fstream ofile,afile
char ch,ch1
do{
cout<<'nt1./dd recordsnt.earch Eecordsnt5.Qist Eecordsnt;.3it'cin>>chs$itch(ch){
case 919 :ofile.open('dnr.dat',ios::outDios::inar*)cout<<'nnter no. of records to e ntered: 'cin>>nfor(i=0i<ni%%){
d.input()ofile.$rite((char!)Md,sieof(donor))
ofile.close() rea
case 99 : cout<<'nnter Alood Oroup to e searched: '
char g67,flag=0
gets(g)afile.open('dnr.dat',ios::in)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 21/42
$hile(afile){
afile.read((char !)Md,sieof(donor))
if(8afile) rea
if (strcmp(g,d.getgroup())==0)
{d.displa*()flag=1
if(flag==0)
cout<<'n 4o record Tound'afile.close()
rea case 959 :
afile.open('dnr.dat',ios::in)$hile(afile)
{afile.read((char !)Md,sieof(donor))
if(8afile) rea
d.displa*()afile.close() rea
case 9;9 : e3it(0)cout<<'nt CN I $ant to continue '
cin>>ch1 $hile(ch1==9J9DDch1==9*9)getch()
Program :
#include<fstream.h>#include<stdio.h>#include<conio.h>#include<process.h>class oo {
char name6507int nofloat price pulic:&oid input(){
cout<<'nnter Aoo 4ame: 'gets(name)cout<<'nter ANNW 4o.: 'cin>>nocout<<'nter Price'cin>>price
&oid setprice(){
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 22/42
cout<<'nnter Price'cin>>price
&oid displa*(){
cout<<'nAoo 4ame: '<<name<<'tAoo 4o.: '<<no<<'tPrice: '<<price<<'t'
int getno(){
return no
&oid main(){
clrscr() oo int n,i,@fstream ofile,afile
char ch,ch1
do{
cout<<'nt1./dd recordsnt.earch Eecordsnt5.Bodif* Eecordsnt;.3it'cin>>chs$itch(ch)
{ case 919 :
ofile.open('.dat',ios::outDios::inar*)cout<<'nnter no. of records to e ntered: 'cin>>n
for(i=0i<ni%%){
.input()ofile.$rite((char!)M,sieof(oo))
ofile.close() rea
case 99 : cout<<'nnter Aoo 4o. to e searched: 'int n,flag=0cin>>nafile.open('.dat',ios::in)$hile(afile){
afile.read((char !)M,sieof(oo))if(8afile)
reaif (n==.getno()){
.displa*()
flag=1 rea
if(flag==0)
cout<<'n 4o record Tound'
afile.close()
rea case 959 :
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 23/42
cout<<'nnter Aoo 4o. to e modified 'int n1,flag1=0,r=0cin>>n1
afile.open('.dat',ios::inDios::outDios::inar*)$hile(afile){
afile.read((char !)M,sieof(oo))if(8afile)
rea
if (n1==.getno()){
.setprice()afile.seep(r!sieof(),ios::eg)afile.$rite((char !)M,sieof(oo))flag1=1
rear%%
if(flag1==0)cout<<'n 4o record Tound'
afile.close() rea
case 9;9 : e3it(0)
cout<<'nt CN I $ant to continue 'cin>>ch1
$hile(ch1==9J9DDch1==9*9)getch()
Program 5:
#include<iostream.h>#include<limits.h>#include<process.h>#include<conio.h>
int linearLsearch(int /6 7,int n, int p)&oid inar*Lsearch(int /6 7,int n, int p)
&oid selectionLsort(int /6 7,int n)&oid uleLsort(int /6 7,int n)
&oid insertionLsort(int /6 7, int n)&oid insertLelement(int /67, int n)&oid deleteLelement(int /67, int n)
int /607,n,mg=0
&oid main(){int i,ch,o=0,h=0,t=0,,m
int A607,p,suscript
char choice
cout<<'nter the ie of arra* : '
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 24/42
cin>>n
cout<<'nnnter the elements : nn'
for(int i=0 i<n i%%)cin>>/6i7
cout<<'nn/rra* formed is : 'for(i=0 i<n i%%)cout<</6i7<<' '
do{cout<<'nnnn+hoose from the follo$ing : 'cout<<'nnn1. earch element in an arra* 'cout<<'nn. ort the arra* 'cout<<'nn5. -nsert element in arra* '
cout<<'nn;. Celete element in arra* 'cout<<'nn. 3it 'cout<<'nnnnter *our choice : 'cin>>ch
int flag=1s$itch(ch)
{ case 1 :
cout<<'nnnter element to e searched : 'cin>>pfor(i=0i<ni%%){
if((/6i7</6i%17MM/6i%17>/6i%7)DD(/6i7>/6i%17MM/6i%17</6i%7)){
flag=0 rea
if(flag==0){
cout<<'nnInsorted arra*. Qinear earch'suscript=linearLsearch(/,n,p)if(suscript== 1)cout<<'nnEeKuested element not found.'
else{cout<<'nnearch uccessful.'cout<<'nnnHhe reKuested element is '<<p<<'. nnuscript =
'<<suscript<<'nPosition in arra* = '<<suscript%1
else{
cout<<'nnorted arra*. Ainar* earch' inar*Lsearch(/,n,p)
rea
case :cout<<'nnt1. election ort '
cout<<'nnt. Aule ort '
cout<<'nnt5. -nsertion sort '
cout<<'nntnter *our choice : ' cin>>ch
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 25/42
s$itch(ch) { case 1 : if(o==1)
cout<<'nn/rra* alread* sorted using election sort 'else{if(h==0MMt==0)
{selectionLsort(/,n)cout<<'nnnnorted arra* is : nn'
for(=0 <n %%)cout<</67<<' 'o=1else if(h==1MMt==0)cout<<'nn/rra* alread* sorted using Aule sort '
elsecout<<'nn/rra* alread* sorted using -nsertion sort ' rea
case : if(h==1)
cout<<'nn/rra* alread* sorted using -nsertion sort 'else{if(o==0MMt==0) { uleLsort(/,n) cout<<'nnnnorted arra* is : nn' for( =0 <n %%)
cout<</67<<' ' h=1 else if(t==1MMo==0)cout<<'nn/rra* alread* sorted using -nsertion sort '
elsecout<<'nn/rra* alread* sorted using election sort ' rea
case 5: if(t==1)
cout<<'nn/rra* alread* sorted using -nsertion sort 'else{if(h==0MMo==0){insertionLsort(/,n)
t=1else if(h==1MMo==0)cout<<'nn/rra* alread* sorted using Aule sort 'elsecout<<'nn/rra* alread* sorted using selection sort '
rea
default: cout<<'nn 2rong input'
rea
case 5: insertLelement(/,n)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 26/42
rea
case ;: deleteLelement(/,n)rea
case : e3it(0) rea default : cout<<'nn2rong input: '
cout<<'nn2ant to choose from menu again : 'cin>>choice$hile(choice==9*9DDchoice==9J9)
getch()
int linearLsearch(int /67, int n, int p){for(int i=0 i<n i%%)
{if (/6i7==p) return i return 1
&oid inar*Lsearch(int /67, int n, int p){ int Q,I,mid char ch Q=0 I=n1
$hile(Q<=I){ mid=(Q%I)"
if(/6mid7==p) { cout<<'nnlement '<<p<<' found. earch uccessful.' cout<<'nnuscript = '<<mid<<' nnPosition = '<<mid%1 rea
else if(p<=/6mid7) I=mid1
else Q=mid%1 if(Q>I)
{cout<<'nnInsuccessful search.' cout<<'nnnn2ant to search again. : ' cin>>ch if(ch==9*9DDch==9J9) {cout<<'nnnnnter the element to e searched : ' cin>>p
else e3it(1)
&oid selectionLsort(int /67, int n){int small int ,count=0 for(int i=0 i<n i%%) { small=/6i7 count%%
for(int @=i%1 @<n @%%)
{
if(/6@7<small) {small=/6@7
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 27/42
/6@7=/6i7 /6i7=small
if(mg==0) {
cout<<'nn/rra* after iteration '<<count<<' is :nn' for(=0 <n %%) cout<</67<<' '
&oid uleLsort (int /67, int n){ int temp int count=0for(int i=0 i<n i%%) {
for(int @=0 @<n1 @%%){ if(/6@%17</6@7)
{ count%% temp=/6@%17 /6@%17=/6@7 /6@7=tempcout<<'nn/rra* for iteration '<<count<<' is : nn'for(int =0 <n %%)
cout<</67<<' '
&oid insertionLsort(int /67, int n){int @,t /6n7=0
for(int i=n i>=0 i)/6i7=/6i17
/607=-4HLB-4for(int i=1 i<=n i%%) { t=/6i7 @=i1 $hile(t</6@7)
{ /6@%17=/6@7 @ /6@%17=t cout<<'nn/rra* after iteration '<<i<<' => nn'
for(int =1 <=n %%) cout<</67<<' ' cout<<'nn' cout<<'nnnorted arra* is : nn' for(int =1 <=n %%)
cout<</67<<' '
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 28/42
&oid insertLelement(int /67, int n){ int p,poschar choice
do{if(n>=0DDn<1)cout<<'nn/rra* N&erflo$.'
elsecout<<'nnnter element along $ith its position : nn'cout<<'lement = ' cin>>p
cout<<'nnPosition = ' cin>>posfor(int i=n i>=pos i){/6i7=/6i17n%%
/6n7=0/6pos17=p
cout<<'nn/rra* formed : '
for(int i=0 i<n i%%)cout<</6i7<<' '
cout<<'nn2ant to insert again : ' cin>>choice$hile(choice==9*9DDchoice==9J9)
&oid deleteLelement(int /67, int n){ int pos,flag=1
char choice do{
cout<<'nnnnter position of element to delete it : ' cin>>pos
if(pos1>n1) { cout<<'nn-n&alid ' else for(int i=0 i<n i%%) {
if(pos1 ==i) {flag=0 for(int @=pos1 @<n @%%) {
/6@7=/6@%17
n
if(flag) {
cout<<'nn-n&alid ... nter again : '
cout<<'nnn/rra* formed : ' for(int i=0 i<n i%%) cout<</6i7<<' '
cout<<'nnn2ant to delete again : '
cin>>choice $hile(choice==9*9DDchoice==9J9)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 29/42
Program ;:#include<iostream.h>#include<conio.h>
&oid merge(int 67,int,int 67,int,int 67)&oid main(){
clrscr()int a607,607,c607,mn=0,m,n,icout<<'nnter numer of elements of arra* / 'cin>>mcout<<'nnter elements of arra* / in ascending order n'for(i=0i<mi%%)
cin>>a6i7cout<<'nnter numer of elements of arra* A 'cin>>ncout<<'nnter elements of arra* A in descending order n'
for(i=0i<ni%%)cin>>6i7
mn=m%nmerge(a,m,,n,c)cout<<'nlements of merged arra* are n'for(i=0i<mni%%)
cout<<c6i7<<' 'cout<<endl
getch()&oid merge(int a67,int m,int 67,int n,int c67){
int i,@,
for(i=0,@=n1,=0 i<m MM @>=0){
if(a6i7<=6@7)c6%%7=a6i%%7
elsec6%%7=6@7
if(i<m){
$hile(i<m)c6%%7=a6i%%7
else
{$hile(@>=0)
c6%%7=6@7
Program :#include<iostream.h>#include<conio.h>#include<process.h>&oid main(){
clrscr()
int a6767int i,@,m,n
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 30/42
cout<<'nnter the numer of ro$s and columns of matri3 / 'cin>>m>>nif(m8=n)
e3it(0)cout<<'nnter elements of matri3 / 'for(i=0i<mi%%)
{for(@=0@<n@%%)
cin>>a6i76@7
int chcout<<'nnter *our choice'cout<<'n1. ho$ Ipper Ciagonal elements'cout<<'n. ho$ Qo$er Ciagonal elements'cout<<'n5. ho$ Ciagonal elements'
cin>>chcout<<endls$itch(ch){
case 1:for(i=0i<mi%%)
{for(@=0@<n@%%){
if(i<=@)cout<<a6i76@7
else
cout<<' 'cout<<endl
rea
case :for(i=0i<mi%%){
for(@=0@<n@%%){
if(i>=@)cout<<a6i76@7
elsecout<<' '
cout<<endl
rea
case 5:for(i=0i<mi%%){
for(@=0@<n@%%){
if((i==@)DD((i%@)==m1))
cout<<a6i76@7else
cout<<' 'cout<<endl
rea
default:cout<<'n2rong choice'
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 31/42
reagetch()
Program :
#include<iostream.h>#include<process.h>#include<conio.h>
struct 4ode{
int info 4ode !ne3t
!start,!ne$ptr,!sa&e,!ptr,!rear 4ode !+reateL4e$L4ode(int)
&oid -nsertLAeg(4ode!)&oid Cispla*(4ode!)&oid -nsertLnd(4ode!)&oid Cel4ode()
&oid Hra&erse(4ode!)&oid main()
{clrscr()start=rear=4IQQint infint choicechar ch=9*9
$hile(ch==9*9DDch==9J9){
cout<<'nter *our choice 'cout<<'n1.-nsert at eggining'cout<<'n.-nsert at end'
cout<<'n5.Celete node'cout<<'n;.Cispla* lined list'cin>>choices$itch(choice){case 1:cout<<'nnter information for ne$ node'
cin>>infne$ptr=+reateL4e$L4ode(inf)if(ne$ptr8=4IQQ){
cout<<'n4e$ node created'
else{
cout<<'n+annot create ne$ node'e3it(1)
-nsertLAeg(ne$ptr)
reacase :cout<<'nnter information for ne$ node'cin>>infne$ptr=+reateL4e$L4ode(inf)if(ne$ptr8=4IQQ)
{
cout<<'n4e$ node created'
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 32/42
else{
cout<<'n+annot create ne$ node'
e3it(1)-nsertLnd(ne$ptr)
reacase 5:Cel4ode()
cout<<'n4ode deleted' reacase ;:Cispla*(start) readefault:
cout<<'n2rong choice' reacout<<'nCo *ou $ish to continue(*"n)'
cin>>ch
getch() 4ode !+reateL4e$L4ode(int n){
ptr=ne$ 4ode ptr>info=n
ptr>ne3t=4IQQreturn ptr
&oid -nsertLAeg(4ode !np){
if(start==4IQQ)start=np
else{
sa&e=startstart=npnp>ne3t=sa&e
&oid -nsertLnd(4ode !np){
if(start==4IQQ)start=rear=np
else{
rear>ne3t=nprear=np
&oid Cel4ode(){
if(start==4IQQ)cout<<'nInderflo$n'
else{
ptr=start
start=start>ne3tdelete ptr
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 33/42
&oid Cispla*(4ode !np)
{$hile(np8=4IQQ){
cout<<np>info<<' 'np=np>ne3t
cout<<endl
Program ?:#include <iostream.h>#include <stdio.h>
#include <conio.h>#include <stdli.h>#include <ct*pe.h>#define B/V 100
int stac6B/V7int top
&oid push(int stac67, int &al, int Mtop)int pop(int stac67, int Mtop)&oid sho$Ltac(int stac67, int top)&oid main(){
int choice, &al
char opt = 9J9top = 1clrscr()do{
cout << 'ntt Bain Benu'cout << 'nt1. /ddition of tac'cout << 'nt. Celetion from tac'cout << 'nt5. Hra&erse of tac'cout << 'nt;. 3it from Benu'cout << 'nnnter *our choice from ao&e > 'cin >> choice
s$itch (choice){ case 1:
do{
cout << 'nter the &alue to e added in the stac '
cin >> &al push(stac, &al, top)cout << 'nCo *ou $ant to add more elements <J"4> 'cin >> opt
$hile (toupper(opt) == 9J9) rea
case :opt = 9J9do{
&al = pop(stac, top)if (&al 8= 1)
cout << 'Ualue deleted from statc is ' << &al
cout << 'nCo *ou $ant to delete more elements <J"4> 'cin >> opt
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 34/42
$hile (toupper(opt) == 9J9) rea
case 5:
sho$Ltac(stac, top) rea
case ;:
e3it(0)
$hile (choice 8= ;)&oid push(int stac67, int &al, int Mtop){
if (top == B/V 1){
cout << 'tac Tull 'else{
top = top % 1stac6top7 = &al
int pop(int stac67, int Mtop){
int &alueif (top < 0)
{cout << 'tac mpt* '&alue = 1
else
{&alue = stac6top7top = top 1
return (&alue)
&oid sho$Ltac(int stac67, int top)
{int iif (top < 0){
cout << 'tac mpt*'return
i = topclrscr()cout << 'Hhe &alues are 'do{
cout << 'n' << stac6i7i = i 1
$hile(i >= 0)
Program F:
#include <iostream.h>
#include <stdio.h>#include <conio.h>
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 35/42
#include <stdli.h>#include <ct*pe.h>#define B/V 0
char Kueue6B/V7int front, rear&oid addLX(char Kueue67, int front, char &al, int Mrear) char
delLX(char Kueue67, int Mfront, int rear)&oid sho$LX(char Kueue67, int front, int rear)&oid main()
{int choicechar &alchar opt = 9J9
rear = 1front = 1
clrscr()do{
cout << 'ntt Bain Benu'
cout << 'nt1. /ddition of Xueue'cout << 'nt. Celetion from Xueue'
cout << 'nt5. Hra&erse of Xueue'cout << 'nt;. 3it from Benu'cout << 'nnnter Jour choice from ao&e 'cin >> choices$itch (choice){
case 1:do{
cout << 'nter the &alue to e added in the Kueue'
cin >> &aladdLX(Kueue, front, &al, rear)cout << 'Co *ou $ant to add more element
<J"4> 'cin >> opt
$hile (toupper(opt) == 9J9) rea
case :opt = 9J9do{
&al = delLX(Kueue, front, rear)if (&al 8= 1)
cout << 'Ualue deleted from Xueue is '<< &al
cout << 'nCo *ou $ant to delete more element<J"4> '
cin >> opt $hile (toupper(opt) == 9J9)
reacase 5:
sho$LX(Kueue, front, rear) rea
case ;:e3it(0)
$hile (choice 8= ;)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 36/42
&oid addLX(char Kueue67, int front, char &al, int Mrear){
if ((rear % 1) Y B/V == front){
cout << 'Xueue Tull '
else{
rear = (rear % 1) Y B/VKueue6rear7 = &al
char delLX(char Kueue67, int Mfront, int rear){
char &alueif (front == rear){
cout << 'Xueue mpt* '
&alue = 1
else{
front = (front % 1) Y B/V&alue = Kueue6front7
return (&alue)
&oid sho$LX(char Kueue67, int front, int rear){
clrscr()cout << 'Hhe &alues are '
do{
front = (front % 1) Y B/Vcout << 'n' << Kueue6front7
$hile(front 8= rear)
Program G:#include <iostream.h>#include <stdio.h>#include <conio.h>#include <stdli.h>#include <ct*pe.h>
struct node{
int &aluenode !lin
node !push(node !top, int &al)
node !pop(node !top)&oid sho$Ltac(node !top)&oid main(){
node !topint t&al, choice
char opt = 9J9
top = 4IQQclrscr()
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 37/42
do{
cout << 'ntt Bain Benu'
cout << 'nt1. /ddition of tac'cout << 'nt. Celetion from tac'cout << 'nt5. Hra&erse of tac'
cout << 'Znt;. 3it from Benu'cout << 'nnnter *our choice from ao&e 'cin >> choice
s$itch (choice){
case 1:do{
cout << 'nter the &alue. : '
cin >> t&altop = push(top, t&al)cout << 'nCo *ou $ant to add more elements <J"4> 'cin >> opt
$hile (toupper(opt) == 9J9) rea
case :opt = 9J9do{
top = pop(top)if (t&al 8= 1)
cout << 'Ualue deleted from tac is ' << t&alcout << 'nCo *ou $ant to delete more elements <J"4> 'cin >> opt
$hile (toupper(opt) == 9J9) rea
case 5:sho$Ltac(top) rea
case ;:e3it(0)
$hile (choice 8= ;)node !push(node !top, int &al){
node !temptemp = ne$ node
temp>&alue = &altemp>lin = 4IQQif(top ==4IQQ)
top = tempelse{
temp>lin = toptop = temp
return(top)
node !pop(node !top)
{
node !tempint t&al
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 38/42
clrscr()if (top == 4IQQ ){
cout << 'tac mpt* 'troll = 1
else{
temp = top
top = top>lint&al = temp>&aluetemp>lin = 4IQQcout << 'ntPopped Ualue is : ' << temp>&aluedelete temp
return (top)&oid sho$Ltac(node !top){
node !temptemp = top
clrscr()cout << 'Hhe &alues are n'$hile (temp 8= 4IQQ){
cout << 'n' << temp>&aluetemp = temp>lin
Program 50:
#include <iostream.h>#include <stdio.h>#include <conio.h>#include <stdli.h>#include <ct*pe.h>struct node{
int nofloat alar*node !lin
node !addLX(node !rear, int &al,float &al1) "" /dd Kueuenode !delLX(node !front, int M&al, float M&al1)"" Celete Kueue
&oid sho$LX(node !front) "" ho$ Kueue&oid main(){
node !front, !rearint &alfloat &al1
int choicechar opt = 9J9front = rear = 4IQQclrscr()do{
cout << 'ntt Bain Benu'
cout << 'nt1. /ddition of Xueue'cout << 'nt. Celetion from Xueue'
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 39/42
cout << 'nt5. Hra&erse of Xueue'cout << 'nt;. 3it from Benu'cout << 'nnnter Jour choice from ao&e '
cin >> choices$itch (choice){
case 1:do{
cout << 'nter the &alue to e added in the Kueue'
cin >> &alcin >> &al1rear = addLX(rear, &al,&al1)if (front == 4IQQ)
front = rearcout << 'nCo *ou $ant to add more element
<J"4> 'cin >> opt
$hile (toupper(opt) == 9J9) rea
case :opt = 9J9do{
front = delLX(front, &al, &al1)if (front == 4IQQ)
rear = frontif (&al 8= 1)
cout << 'Ualue deleted from Xueue is '<< &al
cout << 'nCo *ou $ant to delete more element
<J"4> 'cin >> opt
$hile (toupper(opt) == 9J9) rea
case 5:sho$LX(front) rea
case ;:e3it(0)
$hile (choice 8= ;)
node !addLX(node !rear, int &al, float &al1){
node !temptemp = ne$ nodetemp>no = &altemp>alar* = &al1
temp>lin = 4IQQrear>lin = temprear = tempreturn (rear)
node !delLX(node !front, int M&al, float M&al1)
{
node !tempclrscr()
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 40/42
if (front == 4IQQ){
cout << 'Xueue mpt* '
&al = 1else
{temp = frontfront = front>lin
&al = temp>no&al1 = temp>alar*temp>lin = 4IQQdelete temp
return (front)
&oid sho$LX(node !front){
node !temp
temp = frontclrscr()
cout << 'Hhe Xueue &alues are'$hile (temp 8= 4IQQ){
cout <<'n4N : '<< temp>nocout <<'nalar* : '<<temp>alar*temp = temp>lin
Program 51:
#include<iostream.h>#include<conio.h>#include<stdli.h>#include<process.h>int -nsertLinL+X(int67,int)&oid Cispla*(int67,int,int)int CelLinL+X(int67)
const int sie=?int +Xueue6sie7,front=1,rear=1&oid main(){
clrscr()int item,res,ch
char choicedo{
cout<<'nnter *our choice'cout<<'n1.-nsert'cout<<'n.Celete'
cout<<'n5.Cispla*'cin>>chs$itch(ch){
case 1:cout<<'nnter item to insert '
cin>>item
res=-nsertLinL+X(+Xueue,item)if(res==1)
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 41/42
cout<<'nN&erflo$88 'else{
Cispla*(+Xueue,front,rear) rea
case :item=CelLinL+X(+Xueue)cout<<'nCeleted element is '<<item<<endl
Cispla*(+Xueue,front,rear) rea
case 5:Cispla*(+Xueue,front,rear) rea
default:
cout<<'n2rong choice 'cout<<'nCo *ou $ish to continue(*"n) 'cin>>choice
$hile(choice==9*9DDchoice==9J9)getch()
int -nsertLinL+X(int +Xueue67,int ele){
if((front==0 MM rear==sie1) DD (front==rear%1))return 1
else if(rear==1)
front=rear=0else if(rear==sie1)
rear=0else
rear%%
+Xueue6rear7=elereturn 0
int CelLinL+X(int +Xueue67){
int retif(front==1)
return 1else{
ret=+Xueue6front7if(front==rear)
front=rear=1
else if(front==sie1)front=0
elsefront%%
return ret
&oid Cispla*(int +Xueue67,int front,int rear){
int i=0cout<<'n+ircular Xueue is 'if(front==1)
return
if(rear>=front){
7/23/2019 Solution of C++ Programs for Class 12
http://slidepdf.com/reader/full/solution-of-c-programs-for-class-12 42/42
for(i=fronti<reari%%)cout<<+Xueue6i7<<' '
cout<<+Xueue6rear7<<endl
else{
for(i=0i<reari%%)cout<<+Xueue6i7<<' '
cout<<+Xueue6rear7<<' '
for(i=fronti<siei%%)cout<<+Xueue6i7<<' '