1. start the program (Connector Symbol- Ovel Shape)
2. Get the input (a number) from the user (n) - (Input/Output Symbol-parallelogram)
3. store the number in an int variable (m=n)
4. Initialize the sum as Zero (sum=0)-(Rectangle)
5. check the decision as while(n>0)-(Diamond Shape)conditional (or decision), represented as a diamond (rhombus)
6.If this yields true then process as follows:(Processing Symbols-Rectangles)
(remainder) r=n%10;
sum=sum+(r*r*r);
n=n/10;
7.check the decision statement again and continue with the process until the condition becomes false.
8.Finally check m with sum
9. If the sum==m Then print the number is an Armstrong-(Output Symbol-parallelogram)
10.Else not an Armstrong
11.Terminate the Program.(Ovel shape)
First you will need to pick out the two numbers. Then you can use your textbook and the instructions in order to draw out the flow chart.
Algorithm is step wise analysis of the work to be done. Flow chart is a pictorial representation of an algorithm. As flow chart is a picture of work to be done,it may be printed in our mind when we observe it.
The relationship between pressure and flow is given by Bernoulli's law. In an idealized system, the speed increases with the square of the increase in pressure. The flow rate would be given by multiplying the area of the outflow by the speed.
START INPUT a,b,c d=B*B-4ac x1=-b+d/2a x2=-b-d/2a print x1,x2 stop
Example: 9x10 to the 2nd power+7 x 10 to the 3rd power + 2x10 to 0 power? wat would that b? The end answer would be 907, 002 just go with the flow.
armstrong number
123
i need a pic of cuson
no
flow chart to find whther the given number is perfect or not
no answer....pls post
[object Object]
draw a flow chart to find whether the given year is leap year or not
real numbers system chart
,jmkljkljkl
draw a flowchart to find the biggest number among the 3 numbers
First you will need to pick out the two numbers. Then you can use your textbook and the instructions in order to draw out the flow chart.