Basic HTML Version

|  | Table of Contents |  | View Full Version

Page 71 - 2615_KEC
P. 71

    Example 2: Write an algorithm and draw a flowchart to find the smallest in two numbers A
                     and B.

                     Algorithm:                                               Flowchart:

                     Step  1   Start.                                            Start
                     Step  2    Read  two  numbers  and  store

                               them in A and B.
                                                                            Read A and B
                     Step  3    Compare numbers A and B. If A is
                               less than B, then

                                 print "A is smallest"                            if        Yes

                               Else                                              A < B               Print A is smallest
                               print "B is smallest"
                                                                                    No
                     Step  4   Stop.
                                                                           Print B is smallest

                                                                                 Stop

                     Example 3: Write an algorithm and draw a flowchart to add first 100 natural numbers.

                     Algorithm:                                                                Flowchart:

                     Step  1   Start.                                                             Start
                     Step  2   Let Sum = 0 and N = 0
                                                                                              Sum = 0, N = 0
                     Step  3   N = N + 1

                     Step  4   Sum = Sum + N
                                                                                                 N = N + 1
                     Step  5   Check If N >= 100 then

                               print Sum

                               Else                                                           Sum = Sum + N

                               Go to Step 3.
                                                                                                    Is
                     Step  6   Stop.                                                      No       N >=

                                                                                                  100?

                                                                                                      Yes

                                                                                                Print Sum

                                                                                                   Stop

                                                                                     Algorithm, Flowchart and Mind Maps  69

| 66 67 68 69 70 71 72 73 74 75 76 |