Write an algorithm to find the numbers divisible by 3 but not by 6 and then draw the flowchart?

Answer 1

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

Answer 2

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

Answer 3

| 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

Answer 4

#1 n := 3

#2 print n

#3 n := n + 6

#4 repeat from #2

Answer 5

Fogvvucuu V v