Scribd
Upload
3 views3 pages

Algorithms for Circle Area and Prime Check

The document contains algorithms for calculating the area of a circle, determining if a number is prime, generating the Fibonacci series, and checking if a number is an Armstrong number. Each algorithm outlines the steps required to perform the respective calculations. The algorithms include variable declarations, loops, and conditional statements to achieve the desired results.

Uploaded by

Sathya P
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views3 pages

Algorithms for Circle Area and Prime Check

The document contains algorithms for calculating the area of a circle, determining if a number is prime, generating the Fibonacci series, and checking if a number is an Armstrong number. Each algorithm outlines the steps required to perform the respective calculations. The algorithms include variable declarations, loops, and conditional statements to achieve the desired results.

Uploaded by

Sathya P
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

ALGORITHM TO FIND AREA OF CIRCLE

[Link] The Program


2. Use The Variables Area And Radius
[Link] The Value Of Radius
[Link]=3.14*Radius*Radius
[Link] The Area
[Link] The Program

ALGORITHM TO FIND WHETHER A GIVEN NUMBER IS PRIME OR


NOT

Step 1: Start
Step 2: Declare variables n, i, flag.
Step 3: Initialize variables
flag ← 1
i←2
Step 4: Read n from the user.
Step 5: Repeat the steps until i=(n/2)
5.1 If remainder of n÷i equals 0
flag ← 0
Go to step 6
5.2 i ← i+1
Step 6: If flag = 0
Display n is not prime
else
Display n is prime
Step 7: Stop

ALGORITHM TO GENERATE FIBONACCI SERIES (0,1,1,2,,3,5,8,13.....)


Step 1: Start
Step 2: Declare variables F1,F2 ,F3 and n .
Step 3: Initialize variables F1 ← 0,F2 ← 1
Step 4: Display F1 and F2
Step 5: Repeat the steps until F2 ≤ n
5.1: F3 ←F2
5.2: F1 ← F2 + F1
5.3: F1 ← F3
5.4: Display F2
Step 6: Stop

Algorithm to find whether a given number is Armstrong number or not

//153=13+53+33 (Armstrong number)

//12≠13+23 (not an Armstrong number)

1. Start the Program

2. Read the value of n

[Link] sum=0 and m=n

4.r=n%10

5.s=r*r*r

[Link]=r+s

7.n=n/10

[Link] the steof 4 to 7 until(n>0)

[Link] sum==m

[Link] the number is Armstrong


[Link]

[Link] the number is not Armstrong

[Link] the Program.

You might also like