The document defines algorithms and flowcharts. It provides examples of algorithms for basic mathematical operations like addition, subtraction, finding greatest numbers. It also defines the key components of an algorithm like inputs, outputs, finite steps. Additionally, it defines the symbols used in a flowchart like terminal, input/output, process, decision, flow direction and connector symbols. Examples of flowcharts are given for algorithms like addition of two numbers and finding greatest among three numbers.