[go: up one dir, main page]
Scribd
Upload
14 views3 pages

C Program 3 (1) (Algos)

An algorithm is a set of clear and unambiguous rules or instructions for problem-solving. Key characteristics include well-defined inputs and outputs, finite execution, feasibility, and language independence. The document also provides algorithms for finding the largest of three numbers, calculating factorials, checking for prime numbers, and determining the area of a circle.

Uploaded by

ranajitbar170
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
14 views3 pages

C Program 3 (1) (Algos)

An algorithm is a set of clear and unambiguous rules or instructions for problem-solving. Key characteristics include well-defined inputs and outputs, finite execution, feasibility, and language independence. The document also provides algorithms for finding the largest of three numbers, calculating factorials, checking for prime numbers, and determining the area of a circle.

Uploaded by

ranajitbar170
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
You are on page 1/ 3

3. What is an algorithm in programming? What are the charateristics of algorithm?

The word Algorithm means “a process or set of rules to be followed in calculations or other
problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-
by-step define how a work is to be executed upon in order to get the expected results.

Characteristics:

 Clear and Unambiguous: Algorithm should be clear and unambiguous. Each of its steps
should be clear in all aspects and must lead to only one meaning.
 Well-Defined Inputs: If an algorithm says to take inputs, it should be well-defined
inputs.
 Well-Defined Outputs: The algorithm must clearly define what output will be yielded
and it should be well-defined as well.
 Finite-ness: The algorithm must be finite, i.e. it should not end up in an infinite loops or
similar.
 Feasible: The algorithm must be simple, generic and practical, such that it can be
executed upon will the available resources. It must not contain some future technology,
or anything.
 Language Independent: The Algorithm designed must be language-independent, i.e. it
must be just plain instructions that can be implemented in any language, and yet the
output will be same, as expected.

4. 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
5. Write an algorithm to find the factorial of a number entered by user.

Step 1: Start
Step 2: Declare variables n,factorial and i.
Step 3: Initialize variables
factorial←1
i←1
Step 4: Read value of n
Step 5: Repeat the steps until i=n
5.1: factorial←factorial*i
5.2: i←i+1
Step 6: Display factorial
Step 7: Stop

6. 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
flag←1
i←2
Step 4: Read n from 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

7. Write an algorithm to find out the area of a circle.

Step 1: Start
Step 2: Input the radius of the circle.
Step 3: Find the area of the circle using the formula
Area=3.14*r*r
Step 4: Print the area of the circle
Step 5: Stop

You might also like