Flowchart:
Odd or Even.
Flowchart:
STOP
Biggest of Three Numbers.
Flowchart:
If
Ans=0
YES
NO
Real , Equal
YES
If Ans<0
Real , Unequal
NO
Imaginary
R1=-B+B2-4AC
R2= B+B2-4AC
PRINT R1, R2
STOP
Armstrong Number
Flow Chart:
Start
Get n
a=n
No
while
(a>0)
Yes
r=n%10
s = s + (r * r * r)
a=a/10
If(s==
n)
No
Print
Armstrong
Number
Yes
Print
Armstrong
Number
Stop
Reverse A Number
Flow Chart:
Start
No
while (n>0)
Yes
b=n%10
s=(s*10)+b
n=n/10
Stop
Get a number
copy=num
No
while
(num>0)
Yes
rem=num%10
sum=(sum*10)+rem
num=num/10
if(copy==su
m)
Print Not A
Palindrome
Print Palindrome
Stop
Fibonnaci Series
Flow chart:
Start
while
(i<=n)
Yes
c=a+b
Print c
Stop
No
Prime or Not
Flowchart:
Simple Calculator
Flowchart:
Swap(a,b)
Initialize x=10,y=20
Print x,y
Call
swap(x,y)
Print x,y
stop
t=a
a=b
b=t
Print a,b
start
Initialize x=10,y=20
Swap(*a,*b
)
t=*a
*a=*b
*b=t
Print x,y
Call
swap(&x,&y)
Print x,y
stop
Print a,b
Recursive function
Flowchart:
start
fact(a)
Read n
if(a=
=0)
f= fact(n)
return 1
Print f
stop
return(a*fact(n-1))
start
Read a
Assign
Count=0,
i=o
a[i]!
=\0
Count ++
stop
i++
Read a
Compute strlen(a)
Stop
Initialize temp
i,j=0
Read str
Compute j=strlen(str)-1
If i<j
true
temp=str[i]
str[i]=str[j]
str[j]=temp
i++
j--
Stop
False
strcpy(b,a)
strrev(a)
String is
Palindrome
True
If(strcm
p(a,b)=
=0)
False
stop
Find string copy using library function
Flow chart:
start
Read a,b
Strcpy(b,a)
stop
String is not
palindrome
Matrix Addition
Flowchart
start
Read c,d
first[10][10],second[10]
[10],sum[10][10]
For(c=0;c<m;c++
for(d=0;d<n;d++)
Sum[c][d]=first[c][d]+second[c][d]
Display sum[c][d]
Stop
1111
Matrix Multiplication
Flowchart
start
Read
m,n,p,q,c,d,k,sum=0
Read first[10][10],second[10]
[10]
False
If
n!
=p
Matrix not
Possible
True
for(c=0;c<m;c++)
for(d=0;d<q;d++)
for(k=0;k<p;k++)
Sum=sum+first[c][k]*second[k]
[d]
Multiply[c][d]=sum
Display multiply[c][d]
stop