[go: up one dir, main page]
Scribd
Upload
1 views2 pages

Expt 2

Uploaded by

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

Expt 2

Uploaded by

shruti.apv2020
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EXPT NO: 2 DATE:

ALGORITHMS
Algorithm and flowchart are the powerful tools for learning programming. An
algorithm is a step-by-step analysis of the process, while a flowchart explains
the steps of a program in a graphical way. Algorithms and flowcharts help to
clarify all the steps for solving the problem.

ALGORITHM:
A software engineer commonly uses an algorithm for planning and solving the
problems. An algorithm is a sequence of steps to solve a particular problem or
it is an ordered set of unambiguous steps that produces a result and terminates
in a finite time.

Algorithm has the following characteristics


▪ Input: An algorithm may or may not require input.
▪ Output: Each algorithm is expected to produce at least one result.
▪ Definiteness: Each instruction must be clear and unambiguous.
▪ Finiteness: If the instructions of an algorithm are executed, the algorithm
should terminate after finite number of steps.

The algorithm includes following three types of control structures.

1. Sequence: In the sequence structure, statements are placed one after the
other and the execution takes place starting from up to down.
2. Branching (Selection): In branch control, there is a condition and
according to a condition, a decision of either TRUE or FALSE is achieved.
In the case of TRUE, one of the two branches is explored; but in the case
of FALSE condition, the other alternative is taken. Generally, the ‘IF-THEN’
is used to represent branch control.
3. Loop (Repetition): The Loop or Repetition allows a statement(s) to be
executed repeatedly based on certain loop condition e.g. WHILE, FOR
loops.
ADVANTAGES OF ALGORITHM
▪ It is a step-wise representation of a solution to a given problem, which
makes it easy to understand.
▪ An algorithm uses a definite procedure.
▪ It is not dependent on any programming language, so it is easy to
understand for anyone even without programming knowledge.
▪ Every step in an algorithm has its own logical sequence so it is easy to
debug.

HOW TO WRITE ALGORITHMS


Step 1: Define your algorithm’s input: Many algorithms take in data to be
processed, e.g. to calculate the area of a rectangle, input may be the rectangle
height and rectangle width.
Step 2: Define the variables: Algorithm's variables allow you to use it for more
than one place. We can define two variables for rectangle height and rectangle
width as HEIGHT and WIDTH (or H & W). We should use meaningful variable
name e.g. instead of using H & W use HEIGHT and WIDTH as variable name.
Step 3: Outline the algorithm's operations: Use input variable for computation
purpose, e.g. to find area of rectangle multiply the HEIGHT and WIDTH variable
and store the value in new variable (say) AREA. An algorithm's operations can
take the form of multiple steps and even branch, depending on the value of the
input variables.
Step 4: Output the results of your algorithm's operations: In case of area of
rectangle, output will be the value stored in variable AREA. If the input variables
described a rectangle with a HEIGHT of 2 and a WIDTH of 3, the algorithm would
output the value of 6.

You might also like