32.

Wr
it
eaCpr
ogr
am t
omul
ti
plyt
wodi
mensi
onal
mat
ri
ces

#i
ncl
ude<st
dio.
h>

i
ntmain()
{
i
nta[
10][
10]
,b[
10]
[10]
,resul
t[
10]
[10]
,r1,
c1,
r2,
c2,
i,j
,k;

pri
ntf
("Ent
err
owsandcolumnf
orf
ir
stmat
ri
x:"
);
scanf
("%d%d",&r
1,&c1)
;

pri
ntf
("Ent
err
owsandcolumnf
orsecondmat
ri
x:"
);
scanf
("%d%d",
&r2,
&c2)
;

//Columnoff ir
stmatri
xshouldbeequaltocolumnofsecondmat r
ixand
whil
e( c1!=r2)
{
pri
ntf(
"Err
or!col
umnoff i
rstmatr
ixnotequaltorowofsecond.
\n\n"
);
pri
ntf(
"Enterr
owsandcol umnforfi
rstmatr
ix:")
;
scanf(
"%d%d" ,&r
1,&c1);
pri
ntf(
"Enterr
owsandcol umnforsecondmat r
ix:"
);
scanf(
"%d%d" ,
&r2,&c2)
;
}

//Storingelement soffirstmat
ri
x.
pri
ntf(
"\ nEnterelementsofmatri
x1:\
n")
;
for
(i
=0; i<r1;++i)
f
or (
j=0; j
<c1;++j)
{
printf(
"Enterelementsa%d%d:",
i
+1,j
+1)
;
scanf ("
%d" ,
&a[i]
[j
])
;
}

//Storingelement sofsecondmat r
ix.
pri
ntf(
"\ nEnterelementsofmatri
x2:\n")
;
for
(i
=0; i<r2;++i)
f
or (
j=0; j
<c2;++j)
{
printf(
"Enterelementsb%d%d:",i
+1,j
+1)
;
scanf ("
%d" ,
&b[i]
[j
])
;
}

/
/Init
ial
izi
ngallel
ement
sofr
esul
tmat
ri
xto0
f
or(i
=0;i<r
1;++i)
f
or(j
=0;j
<c2;++j)
{
r
esult
[i
][
j]=0;
}

/
/Mul ti
plyingmat r
icesaandband
/
/storingresultinresul
tmatri
x
f
or(i
=0; i
<r1;++i)
f
or(j
=0; j
<c2;++j)
f
or(k=0;k<c1;++k)
{
r
esul t
[i
][
j]
+=a[i
][
k]*
b[k]
[j
];
 }

//Displayingther esul
t
pri
ntf(
"\ nOutputMat ri
x:
\n");
for
(i
=0; i<r1;++i)
f
or (
j=0; j
<c2;++j)
{
printf(
"%d" ,resul
t[i
][
j]
);
if
(j ==c2-1)
pr i
ntf(
"\n\
n" )
;
}
ret
urn0;
}

Out
put
Enterr
owsandcol
umnf orfi
rstmatr
ix:
3
2
Enterr
owsandcol
umnf orsecondmatri
x:3
2
Err
or!col
umnoffi
rstmatr
ixnotequalt
orowofsecond.

Ent
err
owsandcol
umnf
orfi
rstmat
ri
x:2
3
Ent
err
owsandcol
umnf
orsecondmatr
ix:
3
2

Ent
erel
ement
sofmatr
ix1:
Ent
erel
ement
sa11:
3
Ent
erel
ement
sa12:
-2
Ent
erel
ement
sa13:
5
Ent
erel
ement
sa21:
3
Ent
erel
ement
sa22:
0
Ent
erel
ement
sa23:
4

Ent
erel
ement
sofmatr
ix2:
Ent
erel
ement
sb11:
2
Ent
erel
ement
sb12:
3
Ent
erel
ement
sb21:
-9
Ent
erel
ement
sb22:
0
Ent
erel
ement
sb31:
0
Ent
erel
ement
sb32:
4

Out
putMat
ri
x:
2429

625
33.Wr
it
eaCpr
ogr
am t
ofi
ndt
hebi
ggestof3gi
vennumber
s
34.Wr
it
eaCpr
ogr
am t
odi
spl
ayt
hel
engt
handr
ever
seofast
ri
ngusi
ngst
ri
ngf
unct
ions.

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

chars[
1000]
,i
;

pr
int
f("
Ent
erast
ri
ng:
");

scanf
("%s"
,s)
;

f
or(
i=0;
s[i
]!='
\0'
;++i
);

pr
int
f("
Lengt
hofst
ri
ng:
%d"
,i)
;

r
etur
n0;

Out
put

Ent
erast
ri
ng:
Progr
ami
z

Lengt
hofst
ri
ng:
9
35.Wr
it
eaCpr
ogr
am t
odi
spl
aywhet
heranumberi
sev
enoroddusi
ngcondi
ti
onal
oper
ator
.

#i
ncl
ude<st
dio.
h>

mai
n()

i
ntn;

pr
int
f("
Ent
erani
nteger
\n"
);

scanf
("%d"
,&n)
;

n%2==0?pr
int
f("
Evennumber
\n"
):pr
int
f("
Oddnumber
\n"
);

r
etur
n0;

}
36.Wr
it
eaCpr
ogr
am t
ofi
ndt
hesum andav
eragemar
ksof10st
udent
sst
oredi
nanar
ray
.
#include<st dio.h>
voidmai n()
{
inti,
n,sum=0;
fl
oatav g;
print
f("
Inputthe10numbers:
\n"
);
for(i
=1;i<=10;
i++)
{
pri
ntf("Number-
%d:"
,i
);

scanf
("%d"
,&n)
;
sum +=n;
}
avg=sum/10.0;
pr
intf
("Thesum of10noi
s:%d\
nTheAv
eragei
s:%f
\n"
,sum,
avg)
;

I
nputthe10number s:
Number-1:1
Number-2:2
Number-3:3
Number-4:4
Number-5:5
Number-6:6
Number-7:7
Number-8:8
Number-9:9
Number-10:10
Thesum of10nois: 55
TheAverageis:5.
500000
37.Wr
it
eaCpr
ogr
am t
oacceptanddi
spl
ayt
hedet
ail
sofanempl
oyeeusi
ngst
ruct
ures.
#incl ude<st dio.h>
#incl ude<coni o.h>
structemp
{
i
nteno;
charename[ 10];
fl
oatsal ;
};
voidl inkfloat()
{
fl
oata=0, *b;
b=&a;
a=* b;
}
voidmai n()
{
structemp* e;
i
ntn, i
;
clr
scr (
);
printf(“\nEnt ertheSize\n”) ;
scanf (
“%d” ,&n);
e=( structemp* )cal
loc(
n,sizeof(str
uctemp) );
printf(“\nEnt ertheEno,EName, ESal \n”)
;
for(i=0;i<n;i++)
{
scanf (
“%d%s%f ”,
&e[i
].
eno,&e[i]
.ename, &e[
i]
.sal
);
}
printf(“\n\nDet ailsofEmpl oyee\ n\n”
);
for(i=0;i<n;i++)
{
printf(“\n\n%d\ t%s\ t
%f”,
e[i
].eno,e[i
].
ename,e[i]
.sal
);
}
get ch();
}
38.Writ
eaCpr ogram t
osear
chf
oragi
venel
ementi
nanar
rayusi
ngbi
nar
ysear
ch.
#incl
ude<stdi
o.h>
voidbi
nary
_search()
;

i
nta[ 50] ,n,i
tem, loc,beg,mid,end, i
;
v
oi dmai n()
{
printf("\nEntersizeofanar ray :"
);
scanf (
"%d" ,
&n) ;
printf("\nEnterelementsofanar rayinsort
edf or
m:\n"
);
for(i=0; i
<n;i++)
scanf ("
%d" ,
&a[ i
])
;
printf("\nEnterITEM tobesear ched:")
;
scanf (
"%d" ,
&item) ;
binar y_search();
get ch();
}
v
oi dbi nar y_
search( )
{
beg=0;
end=n- 1;
mi d=( beg+end)/2;
whi le((beg<=end)&&( a[mid]!=it
em) )
{
if( it
em <a[ mi d]
)
end=mi d-1;
el se
beg=mi d+1;
mi d=( beg+end)/2;
}
i
f( a[mi d]==i t
em)
pr intf(
"\n\nITEM foundatl ocation%d",
mi d+1);
else
pr intf(
"\n\nITEM doesn'texist")
;
}

Ent
ersi
zeofanar
ray
:5

Ent
erel
ement
sofanar
rayi
nsor
tedf
orm:
1025356489

Ent
erI
TEM t
obesear
ched:
35

I
TEM f
oundatl
ocat
ion3
39.Writ
eaCpr ogr
am t
ofi
ndt
hear
eaandci
rcumf
erenceofaci
rcl
e.
#incl
ude<st
dio.
h>

i
ntmai
n(){

i
ntrad;
f
loatPI=3.
14,
area,
ci;

pri
ntf
("\
nEnterr
adiusofci
rcl
e:"
);
scanf
("%d"
,&rad);

ar
ea=PI*r ad*r
ad;
pr
int
f("
\nAr
eaofcir
cle:
%f"
,ar
ea)
;

ci
=2*PI*r ad;
pr
int
f("
\nCi
rcumf
erence:
%f"
,ci
);

ret
urn(
0);
}

Out
put:
Enterr
adi
usofacircl
e:1
Areaofci
rcl
e:3.
14
Cir
cumfer
ence :
6.28
40.Wr
it
eaCpr
ogr
am t
odi
spl
ayl
engt
hofast
ri
ngusi
ngpoi
nter
s.
#i
ncl
ude<stdi
o.h>
#i
ncl
ude<coni
o.h>

i
ntst
ri
ng_
ln(
char
*);

v
oidmai n(){
charstr[
20];
i
ntlength;
cl
rscr(
);

pri
ntf
("\
nEnt
eranyst
ri
ng:
");
gets(
str
);

l
ength=st r
ing_l
n(st
r);
pri
ntf(
"Thelengt
hoft hegi
venst
ri
ng%si
s:%d"
,st
r,l
engt
h);
getch(
);
}

i
ntstring_l
n(char
*p)/
*p=&st
r[
0]*
/
{
i
ntcount=0;
whi l
e( *
p!='\0'
){
count++;
p++;
}
returncount;
}

Entert
heStri
ng:pr
it
esh
Lengthoft
hegiv
enstri
ngpr
it
eshi
s:7
41.Wr
it
eaCpr
ogr
am t
ofi
ndt
het
ransposeofagi
venmat
ri
x.

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
nta[
10]
[10]
,tr
anspose[
10]
[10]
,r,
c,i
,j
;

pr
int
f("
Ent
err
owsandcol
umnsofmat
ri
x:"
);

scanf
("%d%d"
,&r
,&c)
;

/
/St
ori
ngel
ement
soft
hemat
ri
x

pr
int
f("
\nEnt
erel
ement
sofmat
ri
x:
\n"
);

f
or(
i=0;
i<r
;++i
)

f
or(
j=0;
j<c;
++j
)

pr
int
f("
Ent
erel
ementa%d%d:
",i
+1,
j+1)
;

scanf
("%d"
,&a[
i]
[j
])
;

/
/Di
spl
ayi
ngt
hemat
ri
xa[
][
]*/

pr
int
f("
\nEnt
eredMat
ri
x:\
n")
;

f
or(
i=0;
i<r
;++i
)

f
or(
j=0;
j<c;
++j
)

pr
int
f("
%d"
,a[
i]
[j
])
;

i
f(j
==c-
1)

pr
int
f("
\n\
n")
;

}
 /
/Fi
ndi
ngt
het
ransposeofmat
ri
xa

f
or(
i=0;
i<r
;++i
)

f
or(
j=0;
j<c;
++j
)

t
ranspose[
j]
[i
]=a[
i]
[j
];

/
/Di
spl
ayi
ngt
het
ransposeofmat
ri
xa

pr
int
f("
\nTr
ansposeofMat
ri
x:
\n"
);

f
or(
i=0;
i<c;
++i
)

f
or(
j=0;
j<r
;++j
)

pr
int
f("
%d"
,t
ranspose[
i]
[j
])
;

i
f(
j==r
-1)

pr
int
f("
\n\
n")
;

r
etur
n0;

Out
put

Ent
err
owsandcol
umnsofmat
ri
x:2

Ent
erel
ementofmat
ri
x:

Ent
erel
ementa11:
2

Ent
erel
ementa12:
3

Ent
erel
ementa13:
4

Ent
erel
ementa21:
5

Ent
erel
ementa22:
6
Ent
erel
ementa23:
4

Ent
eredMat
ri
x:

2 3 4

5 6 4

Tr
ansposeofMat
ri
x:

2 5

3 6

4 4
42.Wr
it
eaCpr
ogr
am t
ofi
ndt
hesum oft
heser
ies12+22+32+…….
n2

#incl
ude<stdio.h>
i
ntmai n(){
i
ntn,i;
i
ntsum=0;
pri
ntf(
"Entertheni .
e.maxv al
uesofseries:
");
scanf("
%d" ,
&n);
sum =( n*(n+1)*( 2*n+1) )/6;
pri
ntf(
"Sum oft heseries:"
);
for(i
=1; i
<=n;
i++){
i
f( i
!=n)
pri
ntf
("%d^2+",
i);else
pri
ntf
("%d^2=%d" ,
i
,sum)
;
}
retur
n0;
}

Out
put
:
Ent
ert
heni
.
e.maxv
aluesofser
ies:
5
Sum oft
heser
ies:
1^2+2^
2+3^
2+4^
2+5^
2=55
43.Wr
it
eaCpr
ogr
am t
odi
spl
ayel
ement
sinagi
venar
rayusi
ngpoi
nter
s.
#include<stdio.h>
{
inta[5]
={ 5,4,
6,8,
9};
int*p=&a[0];
inti;
//clr
scr();
for(i
=0;i<5;i++)
print
f("\nArray
[%d]i
s%d",i
,*(
p+i))
;
for(i
=0;i<5;i++)
print
f("\n%dat%u" ,*
(p+i
),
(p+i)
);
mai n()
getch();
}

OUTPUT
Ar
ray
[0]i
s5
Ar
ray
[1]i
s4
Ar
ray
[2]i
s6
Ar
ray
[3]i
s8
Ar
ray
[4]i
s9
5at2686708
4at2686712
6at2686716
8at2686720
9at2686724
44.Wr
it
eaCpr
ogr
am t
ogener
atet
hemul
ti
pli
cat
iont
abl
eofagi
vennumber

#i
nclude<stdio.
h>
i
ntmai n(){
i
ntnum, i=1;
pri
ntf(
"
EnteranyNumber :
")
;
scanf(
"%d",&num);
pri
ntf(
"Mult
ipl
icat
iontabl
eof%d:
",num)
;

whil
e(i<=10){
pr
int
f("
%dx%d=%d" ,num,
i,num *i
);
i
++;
}
r
eturn0;
}

Pr
ogr
am Out
put
:
Ent
eranyNumber
:5

5x1=5

5x2=10

5x3=15

5x4=20

5x5=25

5x6=30

5x7=35

5x8=40

5x9=45

5x10=50
45.Wr
it
eaCpr
ogr
am t
ofi
ndt
her
oot
sofaquadr
ati
cequat
ion.

#i
ncl
ude<st
dio.
h>
#i
ncl
ude<mat
h.h>

i
ntmai
n()
{
doubl
ea,
b,c,
det
ermi
nant
,root
1,r
oot
2,r
eal
Par
t,i
magi
nar
yPar
t;

pr
int
f("
Ent
ercoef
fi
cient
sa,
bandc:
");
scanf
("%l
f%l
f%l
f"
,&a,
&b,
&c)
;

det
ermi
nant=b*
b-4*
a*c;

/
/condi
ti
onf
orr
eal
anddi
ff
erentr
oot
s
i
f(det
ermi
nant>0)
{
/
/sqr
t()f
unct
ionr
etur
nssquar
eroot
r
oot
1=(
-b+sqr
t(det
ermi
nant
))/
(2*
a);
r
oot
2=(
-b-
sqr
t(det
ermi
nant
))/
(2*
a);

pr
int
f("
root
1=%.
2lfandr
oot
2=%.
2lf
",
root
1,r
oot
2);
}

/
/condi
ti
onf
orr
eal
andequal
root
s
el
sei
f(det
ermi
nant==0)
{
r
oot
1=r
oot
2=-
b/(
2*a)
;

pr
int
f("
root
1=r
oot
2=%.
2lf
;"
,root
1);
}
 /
/ifr
oot
sar
enotr
eal
el
se
{
r
eal
Par
t=-
b/(
2*a)
;
i
magi
nar
yPar
t=sqr
t(-
det
ermi
nant
)/(
2*a)
;
pri
ntf
("r
oot1=%.
2lf
+%.
2lf
iandr
oot
2=%.
2f-
%.2f
i"
,real
Par
t,i
magi
nar
yPar
t,r
eal
Par
t,
i
maginar
yPart)
;
}

r
etur
n0;
}

Out
put

Ent
ercoef
fi
cient
sa,
bandc:
2.3

5.
6

Root
sar
e:-
0.87+1.
30i
and-
0.87-
1.30i
46.Wr
it
eaCpr
ogr
am t
ofi
ndt
henumberofchar
act
ers,
wor
dsi
nagi
vent
ext
.

#i
ncl
ude<st
dio.
h>
#i
ncl
ude<coni
o.h>
#i
ncl
ude<st
ri
ng.
h>
v
oidmai
n()
{
charst
r[
100]
;
i
nti
=0,
l=0,
f=1;
cl
rscr
();
put
s("
Ent
eranyst
ri
ng\
n")
;
get
s(st
r);
f
or(
i=0;
str
[i
]!='
\0'
;i
++)
{
l
=l+1;
}
pr
int
f("
Thenumberofchar
act
ersi
nthest
ri
ngar
e%d\
n",
l);
f
or(
i=0;
i<=l
-1;
i++)
{
i
f(
str
[i
]=='
')
{
f=f+1;
}
}
pr
int
f("
Thenumberofwor
dsi
nthest
ri
ngar
e%d"
,f)
;
get
ch(
);
}

I
nput&Out
put
:

Ent
eranyst
ri
ng
abcdefghi
jkl
mnopqrst
uvwxy
z
Thenumberofchar
act
ersi
nthest
ri
ngar
e34
Thenumberofwor
dsi
nthest
ri
ngar
e9
47.Writ
eaCpr ogram t
ocheckwhet
heragi
vent
ri
angl
eisequi
l
ater
alori
soscel
esorscal
ene.
#incl
ude"coni
o. h"
#incl
ude"stdi
o.h"

voidmai n()
{
i
ntx, y
,z;
pri
ntf("\
nEnterthesidesofat ri
angle"
);
scanf("%d%d%d" ,
&x,&y,
&z);
i
f((x==y)&&( y
==z) )
{
pri
ntf("\
nThetriangleisequilater
al"
);
}
el
sei f((
x==z)||(y
==z)||(x==y )
)
{
pri
ntf("\
nThetriangleisi
sosel es")
;
}
el
se
{
pri
ntf("\
nThetriangleisscalene");
}
getch();
}
Output:

Ent
ert
hesi
desofat
ri
angl
e
12
10
12

Thet
ri
angl
eisi
soscel
es
48.Wr
it
eaCpr
ogr
am t
ocal
cul
ateSi
mpl
eandCompoundi
nter
est
.

#i
ncl
ude"
coni
o.h"
#i
ncl
ude"
stdi
o.h"

#i
ncl
ude<mat h.h>
i
ntmain()
{
floatp,q,r,
SI,CI;
intn;
pr i
ntf(
"Ent erthev al
ueofPrincipalp=" )
;
scanf ("%f",
&p) ;
pr i
ntf(
"Ent erthev al
ueofRat er=" );
scanf ("%f",
&r);
pr i
ntf(
"Ent erthev al
ueofPer i
odi nyearn="
);
scanf ("%d" ,
&n);
SI=( (
p* r*
n) /
100);
pr i
ntf(
"Simpl eInterestSI
=%f\ n",
SI);
q=1+( r
/100) ;
CI =p*pow( q,n)-
p;
pr i
ntf(
"CompoundI nter
estCI=%f\ n",
CI)
;
ret ur
n0;
}

Sampl
eI nput
Ent
erthev alueofPrincipalp=1000
Ent
erthev alueofRat er=12
Ent
erthev alueofPer i
odi nyearn=2
Sampl
eOut put
Si
mpleInterestSI=240.000000
CompoundI nterestCI=254.400009
49.Wr
it
eaCpr
ogr
am t
oswapt
wonumber
swi
thoutusi
ngat
hir
dvar
iabl
e

#i
ncl
ude<stdi
o.h>
i
ntmain(
)
{
i
ntx=10,y=5;

//Codetoswap'x'and'
y'
x=x+y ;//xnowbecomes15
y=x-y ;//ybecomes10
x=x-y ;//xbecomes5

pr
int
f("
Aft
erSwappi
ng:
x=%d,
y=%d"
,x,
y);

r
etur
n0;
}

Out
put
:

Af
terSwappi
ng:
x=5,
y=10
50.Wr
it
eaCpr
ogr
am t
ofi
ndt
hel
argestof2number
susi
ngauser
-def
inedf
unct
ion.

#i
ncl
ude<st
dio.
h>

/
*Functi
ondecl
arati
ons*/
i
ntmax(i
ntnum1,intnum2)
;
i
ntmin(
intnum1,
intnum2);

i
ntmain()
{
i
ntnum1,num2,
maxi
mum,
mini
mum;

/*Inputtwonumber sf
rom user*/
pri
ntf(
"Enteranytwonumbers:")
;
scanf("
%d%d" ,&num1,
&num2) ;

maxi
mum =max(num1,num2);//Cal
lmaxi
mum functi
on
mi
nimum =mi
n(num1,num2);//Call
mini
mum f
unction

pr
int
f("
\nMaxi
mum =%d\n"
,maxi
mum)
;
pr
int
f("
Mini
mum =%d",
minimum)
;

r
etur
n0;
}

/
**
*Findmaxi mum betweent
wonumber
s.
*/
i
ntmax(intnum1,intnum2)
{
r
etur
n( num1>num2)?num1: num2;
}

/
**
*Findmi ni
mum betweent
wonumbers.
*/
i
ntmi n(
intnum1,
intnum2)
{
r
eturn(num1>num2)?num2: num1;
}

I
nput

I
nputt
wonumber
s:10
20

Out
put

Maxi
mum =20
Mi
nimum =10