Algorithms and Flowcharts Chapter Notes | National Cyber Olympiad Class 8 PDF Download

Introduction

An algorithm is basically a procedure of steps that we exactly follow to solve a particular task or problem. We can say that it is a set of rules that we need to follow while developing a program code during problem-solving. Furthermore, if we write an algorithm before actually writing a code, it becomes easy to perform the coding part. Moreover, the algorithm is in simple English language hence, others can also easily understand it and develop the code.

Features of an algorithm

The features of an algorithm are as follows:

• Clarity
  • The algorithm should be very clear and unambiguous in its meaning. It should be simple so that one can understand it easily.
• Well-defined inputs
  • A program may require to take input from the user. Therefore, the algorithm should clearly define the inputs.
• Well-defined outputs
  • The algorithm should clearly specify the output that the program will produce.
• Finiteness
  • The algorithm should have a termination point. This means that the algorithm should not be such that it runs infinite times or end up in loops.
• Feasibility
  • The algorithm should be such that we can implement it easily. Hence, it should be simple and practical to implement.
• Language independent
  • It should be in simple English language. Since the code implementation should result in the same output no matter which programming language we use while writing the code.

Introduction to Flowcharts

It is basically a diagrammatic representation of an algorithm. Furthermore, it uses various symbols and arrows to describe the beginning, ending, and flow of the program. Moreover, the programmers use it to depicting the flow of data and instructions while problem-solving. Flowcharting is the process of drawing a flowchart for an algorithm.

Symbols in a flowchart

The flowchart uses various symbols in the representation. These basic symbols are as follows:

• Terminal
  • It represents the start, stop, or halt in a program’s flow. The flowchart always starts and ends with this symbol. Besides, we represent it using an oval shape.
• Input/Output
  • We represent it using a parallelogram. It indicates any input from the user or output of the program.
• Processing
  • We represent it using a rectangle. It indicates any arithmetic operation’s processing such as addition, subtraction, multiplication, division, etc.
• Decision
  • We represent it using the diamond symbol. It represents any type of decision in a program that results in true or false. For example. if-conditions.
• Connectors
  • We represent it using a circle. Whenever a flowchart is too large we can use connectors to avoid confusion.
• Flow lines
  • These are basically arrows that represent the flow of the program.