There are various ways of writing an algorithm. Today, I"m going to explain 3 ways of writing an algorithm.

You are watching: Which of the following is not a way of representing algorithms?

1. English-Like Algorithm

An algorithm can be written in many ways. It can be written in simple English but this method also has some demerits. Natural language can be ambiguous and therefore lack the characteristic of being definite. Each step of an algorithm should be clear and shouldn"t have more than one meaning. English language-like algorithms are not considered good for most of the tasks.

2. Flowchart

Flowcharts pictorially depict a process. They are easy to understand and are commonly used in the case of simple problems.

*

Flowchart Conventions

*

3. Pseudocode

The pseudocode has an advantage of being easily converted into any programming language. This way of writing algorithm is most acceptable and most widely used. In order to write a pseudocode, one must be familiar with the conventions of writing it.

1. Single line comments start with // 2. Multi-line comments occur between /* and */ 3. Blocks are represented using brackets. Blocks can be used to represent compound statements or the procedures.

{statements}

4. Statements are delimited by semicolon. 5. Assignment statements indicates that the result of evaluation of the expression will be stored in the variable.

=

6. The boolean expression "x > y" returns true if x is greater than y, else returns false. 7. The boolean expression "x 8. The boolean expression "x 9. The boolean expression "x >= y" returns true if x is greater than or equal to y, else returns false. 10. The boolean expression "x != y" returns true if x is not equal to y, else returns false. 11. The boolean expression "x == y" returns true if x is equal to y, else returns false. 12. The boolean expression "x AND y" returns true if both conditions are true, else returns false. 13. The boolean expression "x OR y" returns true if any of the conditions is true, else returns false. 14. The boolean expression "NOT y" returns true if the result of x evaluates to false, else returns false. 15. ifthen 16. This condition is an enhancement of the above "if" statement. It can also handle the case where the condition isn"t satisfied.

See more: The Ones Who Walk Away From Omelas Literary Analysis, The Ones Who Walk Away From Omelas Analysis

ifthenelse

17. switch case (C or C++)

case { :: ..... ..... ..... :: :default: }

18. while loop

whiledo { statements}

19. do-while loop

repeat statementsuntil

20. for loop

for variable = value1 to value2 { statements}

21. input instruction

Read

22. Output instruction

Print

23. The name of the algorithm is and the arguments are stored in the

Algorithm ()

Note: Number 6 to Number 11 use relational operator, Number 12 to 14 uses logical operator, and Number 15 uses conditional operator.