Algo Flow Practical
Algo Flow Practical
(Computer Science)
US1MACSC02
Practical Definition List
PART – A
(Algorithm & Flowchart)
Note:
Use pencil only to write Algorithm, Flowchart and Sample Calculation.
Each Definition must start with a new page only.
Write Definition with Blue Pen.
5. Write an algorithm and draw a flowchart to read any two numbers A and
B. Then find and print the maximum number.
6. Write an algorithm and draw a flowchart to read any three numbers A, B
and C. Then find and print the greatest number with message.
7. Write an algorithm and draw a flowchart to read any three-digit number N.
Check whether the given number is Armstrong or not. Print it with approp-
riate message.
(if N = 153 is Armstrong number then,
Sum = 1*1*1 + 5*5*5 + 3*3*3 = 153)
8. Write an algorithm and draw a flowchart to read five-digit number N.
Check the number is Palindrome or not. And print appropriate message.
Eg. if N = 12321 then it is Palindrome Number
N = 12341 then it is not Palindrome Number
9. Write an algorithm and draw a flowchart to read any Character. Check
whether given character is Capital letter, Small letter, digit or blank of
special character.
10. Write an algorithm and draw a flowchart to read the value of ‘a’, ‘b’, and
‘c’. Find root of quadratic equation.
(delta = b2 – 4abc, if delta < 0 root does not exist
if delta = 0 one root exist (root = -(b+(sqrt(delta)))/(2a)
if delta > 0 two root exist.
root1 = -(b+(sqrt(delta)))/(2a)
root2 = -(b-(sqrt(delta)))/(2a)
LOOP
11. Write an algorithm and draw a flowchart to get the sum of first N natural
numbers. Eg. N =5, then sum = 1+2+3+4+5 = 15
12. Write an algorithm and draw a flowchart to get the sum of first N natural
numbers. Eg. N =6, then sum = 1-2+3-4+5-6 = -3
13. Write an algorithm and draw a flowchart to get the sum of following
series. Eg. N =5, then sum = 2+4+6+8+10 = 30
14. Write an algorithm and draw a flowchart to get the sum of following
series. Eg. N =5, then sum = 3+5+7+9+11
16. Write an algorithm and draw a flowchart to generate the Fibonacci series
upto N terms. Eg. N =10, then series will be 1 1 2 3 5 8 13 21 34 55
17. Write an algorithm and draw a flowchart to read N, R and c and find NcR.
Where NcR = N! / (R! * (N-R)!)
18. Write an algorithm and draw a flowchart to read number N and check
whether the given number is prime or not.