Algorithm & flowchart

Algorithm & flowchart

• 1.
  Presented To :- SanjayMaheshwari
• 2.
  “A Sequential solutionof any program that written in human language, called Algorithm.” “It may defined as the step – by – step procedure to solve a problem with the help of finite number of instructions.”
• 3.
  Algorithm is thefirst step of the solution process, after the analysis of problem, programmer write the algorithm of that problem.
• 4.
  Rulesfor constructing To createan algorithm, keep following points in mined as :- Input :- There should be zero or more values which are to be supplied. Output :- At least one result is to be Produced.
• 5.
  Definiteness :- Eachstep must be clear and unambiguous. Finiteness :- If we trace the step of an Algorithm, then for all cases, the Algorithm must terminate after a finite number of steps.
• 6.
  Effectiveness :- Each stepmust be sufficiently basic that a person using only paper and pencil can in principle carry it out. In addition, not only each step is definite, it must also be a feasible .
• 7.
  Comment Session :- commentis additional info of program for easily modification. In algorithm comment would be appear two square bracket [].
• 8.
  CONDITIONAL PATTERNS STEP 1:- Start STEP 2 :-Read two numbers [n1 and n2] STEP 3 :- If n1 > n2, go to step 5 STEP 4 :- Print “n2 is biggest” and go to step 6 STEP 5 :- Print “n1 is biggest” STEP 6 :- Stop
• 9.
   A flowchartmay be defined as the pictorial representation of an algorithm. A visual inspection of flowchart provides us an idea of sequencing of instructions and repetition of groups.
• 10.
  VARIOUSBLOCKSINFLOWCHART   Start, stop Assignment, Processing  Input, Output  Conditional statement  Connector
• 11.
  THANK YOU Presented By:- SAURABH SEN BBA{FT} 1st SEM