How to write algorithm and draw flowchart for finding the sum of first ten even numbers?

Just think about what you'd do. Move down the list of even numbers, adding each to the sum. Stop after you've added up 10 of them.

How do you get just the even numbers? Start with the first (2) and keep adding 2 each time.
sum=0
n=2
for i=1..10
sum +=n
n +=2
next i

Create a flowchart that will display the sum of all even numbers from 1-10

Start

X=2
If X>=10 Yes= stop
No= display X
X=X+2
Its a loop structure

Why did the mathematician always carry a ladder? In case he needed to reach the higher numbers! Anyway, here's the algorithm and flowchart you're looking for:

Algorithm to find the sum of the first ten even numbers:
1. Initialize a variable "sum" to 0.
2. Initialize a variable "count" to 0.
3. Initialize a variable "num" to 2.
4. Repeat the following steps until "count" becomes 10:
a. Add "num" to "sum".
b. Increment "count" by 1.
c. Increment "num" by 2.
5. Display the value of "sum" as the sum of the first ten even numbers.

Flowchart for the algorithm:
+--------------+
| |
| Start |
| |
+--------------+
|
V
+-----------------+
| |
| sum = 0 |
| count = 0 |
| num = 2 |
| |
+-----------------+
|
V
+-------------------------+
| |
| count < 10 ? |
| |
+----+---------+---------+
| |
V |
+-----+-----+ |
| add num | |
| to sum | |
+-----+-----+ |
| |
V |
+----+-------- +
| increment |
| count by 1|
+-----+------+
|
V
+-----+------+
| increment |
| num by 2 |
+-----+------+
|
V
+-----+------+
| count = 10|
+-----+------+
|
V
+-----+------+
| display |
| sum |
+-----+------+
|
V
+-----+------+
| |
| End |
| |
+-------------+

I hope this gave you a little chuckle while explaining the algorithm and flowchart to find the sum of the first ten even numbers!

To write an algorithm and draw a flowchart for finding the sum of the first ten even numbers, you can follow these steps:

Algorithm:
1. Start
2. Initialize a variable, sum, to 0.
3. Initialize a variable, count, to 0.
4. Initialize a variable, num, to 2.
5. Repeat the following steps until count becomes 10:
a. Add the value of num to sum.
b. Increment the value of count by 1.
c. Increment the value of num by 2.
6. Print the value of sum.
7. Stop

Flowchart:
Here is the step-by-step flowchart representation of the algorithm:

Start
|
V
[sum = 0]
[count = 0]
[num = 2]
|
V
[Is count = 10?]
| \
| Yes \ No
| |
V V
[Print sum] [sum = sum + num]
[count = count + 1]
[num = num + 2]
|
V
Stop

In the flowchart, the diamond-shaped box represents a decision point where a condition is evaluated. If the condition is true, the flow continues along the arrow labeled "Yes." If it's false, the flow continues along the arrow labeled "No." The rectangular boxes represent actions to be performed, such as setting variables or printing values.