Upcoming SlideShare
×

# Algorithm flowcharts

1,044 views

Published on

Algorithm flowcharts

0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total views
1,044
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
8
0
Likes
0
Embeds 0
No embeds

No notes for slide

### Algorithm flowcharts

1. 1. Disclaimer: This presentation is prepared by trainees of baabtra as a part of mentoring program. This is not official document of baabtra –Mentoring Partner Baabtra-Mentoring Partner is the mentoring division of baabte System Technologies Pvt . Ltd
2. 2. Typing Speed Week Target Achieved 1 20 2 3 12
3. 3. Jobs Applied # 1 2 3 Company Designation Applied Date Current Status
4. 4. ALGORITHM FLOWCHARTS MOHAMMED NASEEF PP naseefpp92@gmail.com mohammed naseef pp naseefpp92 in.linkedin.com/in/profilena me 9995614354
5. 5. ALGORITHM FLOWCHARTS
6. 6. What is algorithm? • An algorithm is a representation of a solution to a problem. • An algorithm is procedure consisting of a finite set of unambiguous rules (instructions) which specify a finite sequence of operations that provides the solution to a problem, or to a specific class of problems for any allowable set of input quantities (if there are inputs). In other word, an algorithm is a step-by-step procedure to solve a given problem
7. 7. What is algorithm flowcharts? • A flowchart is a diagram made up of boxes, diamonds and other shapes, connected by arrows - each shape represents a step in the process, and the arrows show the order in which they occur. Flowcharting combines symbols and flowlines, to show figuratively the operation of an algorithm. • A flowchart is a type of diagram that represents an algorithm or process, showing the steps as boxes of various kinds, and their order by connecting them with arrows. • Flowcharts are used in analyzing, designing, documenting or managing a process or program in various fields
8. 8. Properties of an Algorithm • Finiteness: - an algorithm terminates after a finite numbers of steps. • Definiteness: - each step in algorithm is unambiguous. This means that the action specified by the step cannot be interpreted (explain the meaning of) in multiple ways & can be performed without any confusion. • Input:- an algorithm accepts zero or more inputs • Output:- it produces at least one output. • Effectiveness:- it consists of basic instructions that are realizable. This means that the instructions can be performed by using the given inputs in a finite amount of time.
9. 9. Symbols of flowcharts • • • • • • • • • • Start and end symbols Arrows Generic processing steps Subroutines Input/Output Prepare conditional Conditional or decision Junction symbol Concurrency symbol Labeled connectors
10. 10. symbols
11. 11. Types of flowchart • Document flowcharts, showing controls over a document-flow through a system • Data flowcharts, showing controls over a dataflow in a system • System flowcharts showing controls at a physical or resource level • Program flowchart, showing the controls in a program within a system
12. 12. Advantages of Flowchart • It provides an easy way of communication because any other person besides the programmer can understand the way they are represented. • It represents the data flow. • It checks the accuracy in logic flow. • It documents the steps followed in an algorithm. • It provides the facility for coding. • They shows all major elements and their relationship. • It provides the way of modification of running program.
13. 13. Limitation of Flow Charts • It is the total perception of the designer who draw the flowchart. • It's working differ from one compiler to another ,one language to another in some time. • It need weldefined requiremnts. • Its basically for structured programming.