0% found this document useful (0 votes)
370 views

Algorithm and Flowchart Unit - 1

The document defines an algorithm as a sequence of steps to solve a problem and get a desired output from a given input. It provides an example algorithm to calculate the sum of two numbers and lists properties of algorithms like being finite, definite, and effective. The document also defines a flowchart as a diagram that visually represents the flow of data through a process. Flowcharts can be used to represent algorithms pictorially and have advantages like better communication, analysis, and documentation of programs and systems.

Uploaded by

Akshay Pophali
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
370 views

Algorithm and Flowchart Unit - 1

The document defines an algorithm as a sequence of steps to solve a problem and get a desired output from a given input. It provides an example algorithm to calculate the sum of two numbers and lists properties of algorithms like being finite, definite, and effective. The document also defines a flowchart as a diagram that visually represents the flow of data through a process. Flowcharts can be used to represent algorithms pictorially and have advantages like better communication, analysis, and documentation of programs and systems.

Uploaded by

Akshay Pophali
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

ALGORITHM AND FLOWCHARTS

ALGORITHM

❖ Algorithm can be defined as: “A sequence of activities to be


processed for getting desired output from a given input.”
❖ A formula or set of steps for solving a particular problem
❖ There may be more than one way to solve a problem, so
there may be more than one algorithm for a problem.
❖ Points to remember
1. Getting specified output is essential after algorithm is
executed.
2. One will get output only if algorithm stops after finite
time.
3. Activities in an algorithm to be clearly defined in other
words for it to be unambiguous.
EXAMPLE OF ALGORITHM

Problem statement : Write an algorithm to read two numbers


and find their sum.
Inputs to the algorithm: two numbers : num1, num2.
Expected output: Sum of the two numbers.

Algorithm:
Step1: Start
Step2: Read/input the first num1.
Step3: Read/input the second num2.
Step4: Sum num1+num2 // calculation of sum
Step5: Print Sum
Step6: End
PROPERTIES OF ALGORITHM
❖ Finiteness
An algorithm must always terminate after a
finite number of steps.
❖ Definiteness
Each step of an algorithm must be precisely
defined
❖ Input
The value/quantities are given to the algorithm
before it begins.
❖ Output
The output is expected value/quantities always
have a specified relation to the inputs
❖ Effectiveness
Algorithms to be developed/written using basic
operations
FLOWCHARTS

❖ The flowchart is a diagram which visually presents


the flow of data through processing systems.
❖ A flow chart can be used for representing an
algorithm.
❖ Flow chart is used for representing algorithm in
pictorial form
❖ You can see a flow chart as a blueprint of a design
you have made for solving a problem
❖ Flowchart is drawn according to defined rules
FLOWCHART SYMBOLS
ADVANTAGES OF USING FLOWCHART

❖ Communication
A Flowchart can be used as a better way of
communication of the logic of a system
❖ Effective analysis
A flowchart of a problem can be used for
effective analysis of the problem.
❖ Documentation of Program/System
Program flowcharts are a vital part of a good
program documentation
❖ Efficient Program Maintenance:
With help of flowchart time to time maintenance
become easier
❖ Coding of the Program
Writing code referring the flowchart of the solution
become easy
THANK YOU

You might also like