By dividing
Show a modified algorithm flowchart to list even numbers between 20 and 40, 22, 24, 26, 28, 30, 32, 34, 36, 38 and that is 9 numbers
Algorithm to find the sum of first n natural numbers:1. Read n.2. Initialize N=1.3. Initialize sum S=0.4. Calculate S=S+N.5. Calculate N=N+1.6. If N>n, then goto step 7 else goto step 4.7. Write the sum S.8. Stop.
idskjhgfhg
Use the Euclidean Algorithm to find gcf 231 = 84*2 + 63 84 = 63*1 + 21 63 = 21*3 Therefore 21 is the greatest common factor of 84 and 231. For the Euclidean Algorithm you take the larger of the 2 numbers and find how many times the the second number can fit in to it. Then use the second number and see how many times the remainder goes in to it. When you get to a point where there is no remainder then you have found the gcf. It is the last remainder that you calculated.
jgfujtf
write an algorithm and draw a flow chart to find perimeter of a square
xsdsd
Draw a flowchart to find the sum of first 50 natural numbers.
Shrek and Donkey
huh?
Max = 0For K = 1 to NIf Number(K) > Max then Max = Number(K)Next KPrint Max
draw the flowchart for transpose of a matrice
factorial
Algorithm Step1: Read A, B, C Step2: If A > B is True, then check whether A > C, if yes then A is greatest otherwise C is greatest Step3: If A > B is False, then check whether B > C, if yes then B is greatest otherwise C is greatest Give the Flowchart Answer
maybe
draw a flow chart to find hcf of two given numbers