Computer Programming 2

Algorithm

refers to a step-by-step processing procedure used to solve problems.

Characteristics of an algorithm

✔ Well-defined inputs and outputs

✔ Clear and Unambiguous

✔ Language Independent

✔ Feasible

Flowchart

graphical representation of an algorithm

Data Terminal

defines the starting and ending point of a flowchart

Oval

Shape of data terminal

Initialization

the preparation or initialization of memory space for data processing

Hexagon

shape of initialization

Input/Output

used to represent the data input and output

Parallelogram

shape in input/output

Process

used to represent manipulation of data (assignment and mathematical computations)

Rectangle

shape of process

Decision

used to represent processing of conditions using relational operators.

Diamond

shape of decision

Subroutine/Function

used to group sequences that performs a specific, well-defined task.

Rectangle with lines

shape of subroutine

Flow lines

defines the logical sequence of the program by pointing the next symbol to be performed.

Arrows

shape for flow lines

On-page connector

connects to the flowcharts on the same page.

Circle with arrow

shape of on-page connector

Off-page connector

connects to the flowcharts on different page.

Arrow with pentagon

shape of off-page connector

Sequence Structure

represents a flow which is carried out in a particular order.

Selection Structure

represents a flow wherein processes are selected based on certain conditions.

Repetition Structure

represents a flow wherein a condition is carried out over and over again as long as a certain requirement is satisfied.