PROGRAMSONFUNCTI

ONS

I
ndex:

1.
Wri
teapr
ogr
am t
oaddt
woi
nteger
susi
ngf
unct
ions
2.Writ
eaf uncti
ontoswapt hev alueoft wov ariabl es
3.Writ
eapr ogram tofi
ndbi ggestoft hreeinteger susing
funct
ions.
4.Writ
eapr ogram tocalculat eareaofaci r
cleusi ng
funct
ion.
5.Writ
eapr ogram,usingf unct i
ons, t
of i
ndwhet hera
numberi sevenorodd
6.Writ
eapr ogram toconv ertt i
met omi nutes.
7.Writ
eapr ogram tocalculat eP(n/r).
8.Writ
eapr ogram tocalculat eC(n/r).
9.Writ
eapr ogram tosum t heser iesŚ1/1!+1/ 2!+1/ 3!+
ů..+1/n!
10.Writeaprogram tosum t heser i
es—1/ 1!+4/ 2!+
27/3!+...
.
11.Writeaprogram tocalcul ateGCDusi ngrecur sive
funct
ions
12.Writeaprogram tocalcul ateexp(x,y)usingr ecur sive
funct
ions.
13.Writeaprogram toprintt heFibonacci seriesusi ng
recur
sion.
14.Addt womat ri
cesusingf uncti
on
15.Copyt wostri
ngusingf unct ion
16.Fi
ndl engthofastringsui ngf unction
17.Sortsetofnumber susi ngf unction
1.
Wri
teapr
ogr
am t
oaddt
woi
nteger
susi
ngf
unct
ions

Pr
ogr
am:
#i
ncl
ude<st
dio.
h>
i
ntsum(
inta,
intb)
;
i
ntmai
n()
{
i
ntnum1,
num2,
tot
al=0;
pr
int
f("
\nEnt
ert
hef
ir
stnumber
:")
;
scanf
("%d"
,&num1)
;
pr
int
f("
\nEnt
ert
hesecondnumber
:")
;
scanf
("%d"
,&num2)
;
t
otal
=sum(
num1,
num2)
;
pr
int
f("
\nTot
al=%d"
,tot
al)
;
r
etur
n0;
}

i
ntsum (
inta,
intb)
{
i
ntr
esul
t;
r
esul
t=a+b;
r
etur
nresul
t;
}
Out
put
:

2.
Wri
teaf
unct
iont
oswapt
hev
alueoft
wov
ari
abl
es

Pr
ogr
am:
#i
ncl
ude<st
dio.
h>
v
oidswap_
cal
l
_by
_val
(i
nt,
int
);
v
oidswap_
cal
l
_by
_ref
(i
nt*
,int*
);
i
ntmai
n()
{
i
nta=1,
b=2,
c=3,
d=4;
pr
int
f("
\nI
nmai
n()
,a=%dandb=%d"
,a,
b);
swap_
cal
l
_by
_val
(a,
b);
pr
int
f("
\nI
nmai
n()
,a=%dandb=%d"
,a,
b);
pr
int
f("
\n\
nInmai
n()
,c=%dandd=%d"
,c,
d);
swap_
cal
l
_by
_ref
(&c,
&d)
;
pr
int
f("
\nI
nmai
n()
,c=%dandd=%d"
,c,
d);
r
etur
n0;
}
v
oidswap_
cal
l
_by
_val
(i
nta,
intb)
{
i
ntt
emp;
t
emp=a;
a=b;
b=t
emp;
pr
int
f("
\nInf
unct
ion(
Cal
lByVal
ueMet
hod)a=%dand
b=%d" ,
a,b)
;
}
v
oidswap_
cal
l
_by
_ref
(i
nt*
c,i
nt*
d)
{
i
ntt
emp;
t
emp=*
c;
*
c=*
d;
*
d=t
emp;
pr
int
f("
\nI
nfunct
ion(
Cal
lByRef
erenceMet
hod)c=%d
andd=%d"
,*c,
*d)
;
}
Out
put
:

3.Wri
teapr ogr
am t
ofi
ndbi
ggestoft
hreei
nteger
susi
ng
funct
ions.

Pr
ogr
am:

#i
ncl
ude<st
dio.
h>
i
ntgr
eat
er(
inta,
intb,
intc)
;
i
ntmai
n()
{
i
ntnum1,
num2,
num3,
lar
ge;
pr
int
f("
\nEnt
ert
hef
ir
stnumber
:")
;
scanf
("%d"
,&num1)
;
pr
int
f("
\nEnt
ert
hesecondnumber
:")
;
scanf
("%d"
,&num2)
;
pr
int
f("
\nEnt
ert
het
hir
dnumber
:")
;
scanf
("%d"
,&num3)
;
l
arge=gr
eat
er(
num1,
num2,
num3)
;
pr
int
f("
\nLar
gestnumber=%d"
,lar
ge)
;
r
etur
n0;
}
i
ntgr
eat
er(
inta,
intb,
intc)
{
i
f(
a>b&&a>c)
r
etur
na;
i
f(
b>a&&b>c)
r
etur
nb;
el
se
r
etur
nc;
}
Out
put
:
4.Wri
teaprogr
am t
ocal
cul
atear
eaofaci
rcl
eusi
ng
funct
ion.

Pr
ogr
am:
#i
ncl
ude<st
dio.
h>
f
loatcal
_ar
ea(
fl
oatr
);
i
ntmai
n()
{
f
loatar
ea,
radi
us;
pr
int
f("
\nEnt
ert
her
adi
usoft
heci
rcl
e:"
);
scanf
("%f
",&r
adi
us)
;
ar
ea=cal
_ar
ea(
radi
us)
;
pr
int
f("
\nAr
eaoft
heci
rcl
ewi
thr
adi
us%f=%f
",r
adi
us,
ar
ea);
r
etur
n0;
}
f
loatcal
_ar
ea(
fl
oatr
adi
us)
{
r
etur
n(3.
14*r
adi
us*r
adi
us)
;
}
Out
put
:
5.Wr
it
eaprogram,usi
ngf
unct
ions,
tof
indwhet
hera
numberi
sevenorodd

Progr am:
#include<stdio.
h>
i
ntev enodd(int)
;
i
ntmai n()
{
i
ntnum, fl
ag;
print
f("\nEnterthenumber:
");
scanf ("
%d",&num) ;
fl
ag=ev enodd(num) ;
i
f( fl
ag==1)
print
f("\n%di sEVEN",num);
else
print
f("\n%di sODD",num);
return0;
}
i
ntev enodd(inta)
{
i
f(a%2==0)
return1;
else
return0;
}
Out
put
:

6.
Wri
teapr
ogr
am t
oconv
ertt
imet
omi
nut
es.

Pr
ogr
am:
#include<st dio.h>
#include<coni o.h>
i
ntconv er t_
time_ i
n_ mins(i
nthrs,i
ntminut
es);
mai n( )
{
i
nthr s,mi nutes,total_mins;
printf("
\nEnt erhour sandmi nutes:"
);
scanf ("%d%d" ,&hrs, &minutes)
;
total_mi ns=conv ert_ti
me_ i
n_mins(hr
s,minut
es)
;
printf("
\nTot alminut es=%d" ,t
otal
_mins)
;
get ch();
return0;
}
i
ntconv er t_
time_ i
n_ mins(i
nthrs,i
ntminut
es)
{
i
ntmi ns;
mins=hr s*60+mi nut es;
returnmi ns;
}

Out
put
:
7.
Wri
teapr
ogr
am t
ocal
cul
ateP(
n/r
).

Pr
ogr
am:

#i
ncl
ude<st
dio.
h>
#i
ncl
ude<coni
o.h>
i
ntFact
(i
ntn)
;
mai
n()
{
i
ntn,
r;
f
loatr
esul
t;

pr
int
f("
\nEnt
ert
hev
alueofn:
");
scanf
("%d"
,&n)
;
pr
int
f("
\nEnt
ert
hev
alueofr
:")
;
scanf
("%d"
,&r
);
r
esul
t=(
fl
oat
)Fact
(n)
/Fact
(r)
;
pr
int
f("
\nP(
n/r
):P(
%d)
/(%d)=%f
",n,
r,r
esul
t)
;
get
ch(
);
r
etur
n0;
}
i
ntFact
(i
ntnum)
{
i
ntf
=1,
i;
f
or(
i=num;
i
>=1;
i
--)
f=f
*i;
r
etur
nf;
}
Out
put
:

8.
Wri
teapr
ogr
am t
ocal
cul
ateC(
n/r
).

Pr
ogr
am:
#i
ncl
ude<st
dio.
h>
#i
ncl
ude<coni
o.h>
i
ntFact
(i
ntn)
;
mai
n()
{
i
ntn,
r;
f
loatr
esul
t;

pr
int
f("
\nEnt
ert
hev
alueofn:
");
scanf
("%d"
,&n)
;
pr
int
f("
\nEnt
ert
hev
alueofr
:")
;
scanf
("%d"
,&r
);
r
esul
t=(
fl
oat
)Fact
(n)
/(Fact
(r)
*Fact
(n-
r)
);
pr
int
f("
\nC(
n/r
):C(
%d/
%d)=%.
2f"
,n,
r,r
esul
t)
;
get
ch(
);
r
etur
n0;
}
i
ntFact
(i
ntnum)
{
i
ntf
=1,
i;
f
or(
i=num;
i
>=1;
i
--)
f=f
*i;
r
etur
nf;
}
Out
put
:
9.
Writ
eaprogr
am t
osum t
heser
iesŚ1/
1!+1/
2!+1/
3!+
ů.
.+1/n!

Pr
ogr
am:
#i
ncl
ude<st
dio.
h>
#i
ncl
ude<coni
o.h>
i
ntFact
(i
nt)
;
mai
n()
{
i
ntn,
f,i
;
f
loatr
esul
t=0.
0;

pr
int
f("
\nEnt
ert
hev
alueofn:
");
scanf
("%d"
,&n)
;
f
or(
i=1;
i
<=n;
i
++)
{
f
=Fact
(i
);
r
esul
t+=1/
(fl
oat
)f;
}
print
f("
\nThesum oft
heser
ies1/
1!+1/
2!+1/
3!.
..=%f
",
resul
t);
get
ch(
);
r
etur
n0;
}
i
ntFact
(i
ntnum)
{
i
ntf
=1,
i;
f
or(
i=num;
i
>=1;
i
--)
f=f
*i;
r
etur
nf;
}
Out
put
:

10.
Wri
teapr
ogr
am t
osum t
heser
ies—1/
1!+4/
2!+
27/
3!+.
..
.

Pr
ogr
am:
#i
ncl
ude<st
dio.
h>
#i
ncl
ude<coni
o.h>
#i
ncl
ude<mat
h.h>
i
ntFact
(i
nt)
;
mai
n()
{
i
ntn,
i,NUM,
DENO;
f
loatsum=0.
0;

pr
int
f("
\n"
);
scanf
("%d"
,&n)
;
f
or(
i=1;
i
<=n;
i
++)
{
NUM =pow(
i,
i)
;
DENO=Fact
(i
);
sum +=(
fl
oat
)NUM/
DENO;
}
pr
int
f("
\n1/
1!+4/
2!+27/
3!+.
..
.=%f
",sum)
;
get
ch(
);
r
etur
n0;
}
i
ntFact
(i
ntn)
{
i
ntf
=1,
i;
f
or(
i=n;
i
>=1;
i
--)
f
=f*
i;
r
etur
nf;
}
Out
put
:

11.Writ
eapr
ogr
am t
ocal
cul
ateGCDusi
ngr
ecur
siv
e
funct
ions

Pr
ogr
am:

#i
ncl
ude<st
dio.
h>
i
ntGCD(
int
,int
);
mai
n()
{
i
ntnum1,
num2,
res;
pr
int
f("
\nEnt
ert
het
wonumber
s:"
);
scanf
("%d%d"
,&num1,
&num2)
;
r
es=GCD(
num1,
num2)
;
pr
int
f("
\nGCDof%dand%d=%d"
,num1,
num2,
res)
;
r
etur
n0;
}
i
ntGCD(
intx,
inty
)
{
i
ntr
em;
r
em =x%y
;
i
f(
rem==0)
r
etur
ny;
el
se
r
etur
n(GCD(
y,r
em)
);
}
Out
put
:

12.Writ
eaprogr
am t
ocal
cul
ateexp(
x,y
)usi
ngr
ecur
siv
e
funct
ions.

Pr
ogr
am:
#i
ncl
ude<st
dio.
h>
#i
ncl
ude<mat
h.h>
i
ntexp(
intn1,
i
ntn2)
;
i
ntmai
n()
{
i
ntbase,
a,r
esul
t;
pr
int
f("
Ent
erbasenumber
:"
);
scanf
("%d"
,&base)
;
pr
int
f("
Ent
erpowernumber
:"
);
scanf
("%d"
,&a)
;
r
esul
t=exp(
base,
a);
pr
int
f("
%d^
%d=%d"
,base,
a,
resul
t)
;
r
etur
n0;
}
i
ntexp(
intbase,
inta)
{
i
f(a!
=0)
r
etur
n(base*
exp(
base,
a-1)
);
el
se
r
etur
n1;
}
Out
put
:
13.Writeapr
ogr
am t
opr
intt
heFi
bonacci
ser
iesusi
ng
recur
sion.

Pr
ogr
am:

#include<st di
o.h>
#include<mat h.
h>
i
ntFi bonacci(i
nt);
mai n()
{
i
ntn;
printf
("\nEnterthenumberoftermsintheseri
es:")
;
scanf (
"%d",&n);
for(i
nti=0;i
<n;i
++)
printf
("\nFibonacci(%d)=%d",
i,Fi
bonacci
(i
));
return0;
}
i
ntFi bonacci(i
ntnum)
{
i
f(num==0)
return0;
elseif(num==1)
return1;
else
return(Fibonacci(num -1)+Fi
bonacci
(num -2))
;
}
Out
put
:

14.Addt
womat
ri
cesusi
ngf
unct
ion

Pr
ogr
am:

#i
ncl
ude<stdi
o.h>
#i
ncl
ude<coni
o.h>

v
oidr ead_arr(
inta[10][
10]
,
intr
ow,
i
ntcol)
{
i
nti,j
;
f
or (
i=1;
i<=row;i++)
{
f
or (
j=1;
j<=col;
j++)
{
print
f("
EnterElement%d%d: "
,i
,
j);
scanf("
%d" ,
&a[i]
[j
])
;
}
}
}
voi
dadd_ ar
r(i
ntm1[ 10]
[10],
i
ntm2[
10]
[10]
,
int
m3[10][
10],
intr
ow,intcol)
{
i
nti,
j
;
f
or(i
=1;i
<=row;i
++)
{
f
or(j
=1;j
<=col;
j
++)
{
m3[i
][
j]=( m1[i
][
j]+m2[ i
][
j]
);
}
}
}

v
oidpr int_ar
r(i
ntm[10]
[10]
,i
ntr
ow,
i
ntcol
)
{
i
nti,j
;
f
or(i=1;i
<=row;i
++)
{
for(j
=1;j
<=col;
j
++)
{
printf
("%d",
m[i
][
j]
);
}
print
f("\
n");
}
}

main(
)
{
i
ntm1[
10]
[10]
,
m2[
10]
[10]
,
m3[
10]
[10]
,
row,
col
;

pri
ntf
("Ent
ernumberofrows:"
);
scanf
("%d",
&row)
;
pri
ntf
("Ent
ernumberofcolomns:"
);
 scanf("
%d",
&col
);
read_ar
r(m1,
row,col
);
read_ar
r(m2,
row,col
);
add_arr(
m1,m2,m3,r
ow,col
);
pri
nt_arr
(m3,
row,col
);
getch()
;
}
Out
put
:

15.Copyt
wost
ri
ngusi
ngf
unct
ion

Program:
#incl
ude<stdi
o.h>
voidmy st
rcpy(
charstr
2[30]
,charst
r1[
30]
);
i
ntmai n()
{
charstr1[30]
,str
2[30]
;
inti;
pri
ntf
("Ent
erst
ri
ng:
\n"
);
gets(
str1)
;

my
str
cpy
(st
r2,
str
1);

pr
int
f("
Copi
edst
ri
ngi
s:%s"
,st
r2)
;

retur
n0;
}
voi
dmy st
rcpy(charstr
2[30]
,charst
r1[
30]
)
{
inti;
for(i
=0;
str1[i
]!
='\0'
;
i++)
{
str
2[i
]=st r
1[i
];
}
str2[
i]='\
0';
}
Output:

16.Fi
ndl
engt
hofast
ri
ngsui
ngf
unct
ion
Progr
am:

#i
ncl
ude<st
dio.
h>
i
ntFi
ndLengt
h(charst
r[
])
;
i
ntmai
n(){
charst
r[
100]
;
i
ntl
engt
h;

pr
int
f("
\nEnt
ert
heSt
ri
ng:
");
get
s(st
r);

l
engt
h=Fi
ndLengt
h(st
r);

pr
int
f("
\nLengt
hoft
heSt
ri
ngi
s:%d"
,lengt
h);
r
etur
n(0)
;
}

i
ntFi
ndLengt
h(charst
r[
]){
i
ntl
en=0;
whi
l
e(st
r[
len]!
='\
0')
l
en++;
r
etur
n(l
en)
;
}
Out
put
:
17.
Sor
tsetofnumber
susi
ngf
unct
ion
Pr
ogr
am:
#i
ncl
ude<st
dio.
h>
v
oidasc_
sor
t(i
nta[
100]
,i
ntn)
;
mai
n()
{
i
nta[
100]
,i
,n;

pr
int
f("
Ent
ern:
\n"
);
scanf
("%d"
,&n)
;
f
or(
i=0;
i
<n;
i
++)
{
pr
int
f("
a[%d]
=",
i
);
scanf
("%d"
,&a[
i]
);
}
asc_
sor
t(a,
n);
pr
int
f("
Arr
ayi
nascendi
ngor
deri
s:\
n")
;
f
or(
i=0;
i
<n;
i
++)
{
pr
int
f("
%d\
t",
a[i
])
;
}

}
v
oidasc_
sor
t(i
nta[
10]
,i
ntn)
{
i
nti
,j
,temp;
f
or(
i=0;
i
<n-
1;i
++)
{
f
or(
j=i
+1;
j
<n;
j
++)
{
i
f(
a[i
]>a[
j]
)
{
t
emp=a[
i]
;
a[
i]=a[
j]
;
a[
j]=t
emp;
}
}
}
Out
put
: