Start
Input a
if a%3 = 0 then
Print a
else
print" enter another number"
end
1. start
2. Input N
3. if N<3, go to step 6
4. if N%3 && N%6!=0 then
print N
5. N=N-3 go to step 3
6. end
1) Get the minimum number
2) get the maximum number
3) start at the minimum number
4) is it divisible by three but not by six?
If yes, jump to step 5
If no, increment by 1 and repeat step 4
5) output the current number
6) increment the number by six
7)is it greater than or equal to our maximum number?
if yes, end the program
if no, jump to step 5
| n := 3 |
|
v
| print n |
|
v
| n := n+6 |
|
v
(draw an arrow back to the second step)
.......................................................
1. start
2. Input N
3. if N<3, go to step 6
4. if N%3 && N%6!=0 then
print N
5. N=N-3 go to step 3
6. end
Write_an_algorithm_to_find_the_numbers_divisible_by_3_but_not_by_6_and_then_draw_the_flowchart
#1 n := 3
#2 print n
#3 n := n + 6
#4 repeat from #2
Fogvvucuu V v
jgfujtf
please give me an algorithm and a corresponding flow chart that displays list of numbers from 1 to 20.
flow chart to swap two number
n=100 loop until n = 9 print n n = n -1 end loop
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
jgfujtf
write an algorithm and draw a flow chart to find perimeter of a square
please give me an algorithm and a corresponding flow chart that displays list of numbers from 1 to 20.
dejene
how to write a structured algorithm that input the name and price of an item and quantity and amount
flow chart to swap two number
Shrek and Donkey
2+4
Max = 0For K = 1 to NIf Number(K) > Max then Max = Number(K)Next KPrint Max
n=100 loop until n = 9 print n n = n -1 end loop
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
the number of steps of an algorithm will be countable and finite.