Scribd
Upload
75 views

Algorithms Examples: Write An Algorithm To Add Two Numbers Entered by User

The document provides examples of algorithms to: 1) Add two numbers entered by a user and display the sum. 2) Find the largest of three numbers entered by a user. 3) Calculate the factorial of a number entered by a user. 4) Check if a number entered by a user is prime. 5) Calculate and display terms of the Fibonacci series up to 1000.

Uploaded by

Anonymous faL9kQwZ4f
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
75 views

Algorithms Examples: Write An Algorithm To Add Two Numbers Entered by User

The document provides examples of algorithms to: 1) Add two numbers entered by a user and display the sum. 2) Find the largest of three numbers entered by a user. 3) Calculate the factorial of a number entered by a user. 4) Check if a number entered by a user is prime. 5) Calculate and display terms of the Fibonacci series up to 1000.

Uploaded by

Anonymous faL9kQwZ4f
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

ALGORITHMS EXAMPLES

Write an algorithm to add two numbers entered by user.


Step 1: Start
Step 2: Declare variables num1, num2 and sum.
Step 3: Read values num1 and num2.
Step 4: Add num1 and num2 and assign the result to sum.
sumnum1+num2
Step 5: Display sum
Step 6: Stop
Write an algorithm to find the largest among three different numbers entered by user.
Step 1: Start
Step 2: Declare variables a,b and c.
Step 3: Read variables a,b and c.
Step 4: If a>b
If a>c
Display a is the largest number.
Else
Display c is the largest number.
Else
If b>c
Display b is the largest number.
Else
Display c is the greatest number.
Step 5: Stop
Write an algorithm to find the factorial of a number entered by user.
Step 1: Start
Step 2: Declare variables n,fact and i.
Step 3: Initialize variables
fact1
i1
Step 4: Read value of n
Step 5: Repeats the steps until i=n
5.1: factfact*i
5.2: ii+1
Step 6: Display fact
Step 7: Stop

Write an algorithm to check whether a number entered by user is prime or not.


Step 1: Start
Step 2: Declare variables n,i,flag.
Step 3: Initialize variables
flag1
i2
Step 4: Read n from user.
Step 5: Repeats the steps until i<(n/2)
5.1 If remainder of ni equals 0
flag0
Go to step 6
5.2 ii+1
Step 6: If flag=0
Display n is not prime
else
Display n is prime
Step 7: Stop
Write an algorithm to find the Fibonacci series till term1000.
Step 1: Start
Step 2: Declare variables firstterm, secondterm and temp.
Step 3: Initialize variables first_term0 secondterm1
Step 4: Display firstterm and secondterm
Step 5: Repeats the steps until secondterm1000
5.1: tempsecondterm
5.2: secondtermsecondterm+first term
5.3: firsttermtemp
5.4: Display secondterm
Step 6: Stop

You might also like