Flowchart design for algorithms

Flowchart design for algorithms

• 1.
  Flowchart Design Dr. Kuppusamy.P Associate Professor / SCOPE
• 2.
  Flow Chart • Graphicalrepresentation of an algorithm in relation to its sequence of functions. • Represents a workflow or process. Advantages: ➢ Logic is displayed with graphical symbols to make simple understanding of an algorithm. ➢ Flowchart makes better communication to other users to represent algorithm of a problem. ➢ Flowchart allows the problem solver to split the problem into smaller parts. These parts can be connected to make master chart. Dr. Kuppusamy P
• 3.
  Flow Chart Symbols •Oval - Rectangle with rounded sides is used to indicate either START/ STOP of the program. • Input and output indicators - Parallelograms represent an input and output operations. • Process Indicators - Rectangle is used to indicate any set of processing operations such as arithmetic operations. Dr. Kuppusamy P
• 4.
  Flow Chart Symbols •Decision Makers: The diamond indicates the decision making. It tests the conditions and take suitable action depends on the answers. • Iterative Statements: The repeated set of instruction based on a conditions can be written with this following symbol. • Flow Lines: Flow lines indicate the direction being followed in the flowchart. Iteration Dr. Kuppusamy P
• 5.
  Flow Chart Symbols •Page connectors: Circles are used to join the different parts of a flowchart called page connectors. • Few more symbols: Dr. Kuppusamy P
• 6.
  Flow Chart forAverage of 2 Numbers Algorithm 1. Declare Variables 2. Get input 3. Find average and assign the value 4. Display output result Flow Chart Dr. Kuppusamy P
• 7.
  Difference of FlowChart & Algorithm • a Algorithm Flow chart Step-by-step logical procedure for solving a problem Diagrammatic representation of an algorithm using different symbols. It contains step-by-step English descriptions, each step representing a particular operation leading to solution of problem The flowchart employs a series of blocks and arrows, each of which represents a particular step in an algorithm Used for Small Problems Used for detailed representations of complex programs For complex programs, algorithms prove to be Inadequate For complex programs, Flowcharts prove to be adequate Dr. Kuppusamy P
• 8.
  References Dr. Kuppusamy P •Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to Algorithms”, MIT Press. • Computer Programming – ISBN: 978- 93 – 80170 – 39 – 8