0% found this document useful (0 votes)
22 views2 pages

ICT - 2Q Lesson 2

This document provides information about input/output, process, decision, and initialization in algorithms as well as guidelines for creating a flowchart. It defines key flowchart symbols like terminals, arrows, and connectors. The guidelines indicate that a flowchart should have one start and end, focus on logic over all steps, and properly use symbols like rectangles for steps and rhombuses for decisions. Following the guidelines helps ensure flowcharts clearly show the program flow and are effective for documentation and debugging.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views2 pages

ICT - 2Q Lesson 2

This document provides information about input/output, process, decision, and initialization in algorithms as well as guidelines for creating a flowchart. It defines key flowchart symbols like terminals, arrows, and connectors. The guidelines indicate that a flowchart should have one start and end, focus on logic over all steps, and properly use symbols like rectangles for steps and rhombuses for decisions. Following the guidelines helps ensure flowcharts clearly show the program flow and are effective for documentation and debugging.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ICT

Input/Output –
• Inputting of data
for processing, and
Algorithm the printing out of [input/output
data]
processed data.
2nd Quarter
• “Action”
• Represents the
input of data by the user and the output data
Algorithm – produced by the program.
• Is a computer procedure that is a lot like a recipe
(called a procedure) and tells your computer Process –
precisely what steps to take to solve a problem or • Manipulation of data.
reach a goal. • “Steps”
(assignments and
2 Types of algorithms –
mathematical
• Flowchart Add variable X&Y
computations).
• Pseudocode • Represents a step
Pseudocode – or instruction such
as arithmetic
• A structural conventions of a normal programming
operations and comparisons.
language, but is intended for human reading rather
than machine reading. Decision –
• An algorithm in English statements in outline form to • Process conditions using relational operators.
conceptualize the flow of the program before coding • Involves 2 course of action that is answerable by
it in a programming language. “true/yes” or “false/no” (Boolean condition).
• It cannot be executed on a real computer. • The symbol represents the “If... Then” and the “For...
• Uses indentations and the statements: if, then, and Next” statements.
else to show the logical structure of the algorithm
steps. Example:

Flowchart –
• A visual representation of the sequence of steps and
decisions needed to perform a process. Yes No
Should it be
• Each step in the sequence is noted within a diagram
able to…
shape.
• Steps are linked by connecting lines and directional
arrows.
• Allows anyone to view the flowchart and logically
follow the process from beginning to end. Initialization or Preparation –
• The preparation initialization of memory for data
BASIC FLOW CHART SYMBOL processing.
• Represents the process that will change the
Terminal – direction of
• Defines the starting initialization
and ending point of of any value
the flowchart. BEGIN or the N=5
• Represent the start execution of
and the end of the variable.
program.
• Contains the word “begin” or “start’, and “end” or
“stop”
Arrow or Flow Direction Indicator – 5. Cannot use “and” on a process.
• Logical sequence of the program. 6. No more processes under “Stop/End” terminal
• Indicates the flow of direction or the next activity to 7. Output differs from input by putting “print” or a
be done. question mark (?) before the statement.

Advantages:
1. Flow of the program can be easily understood.
On-Page Connector – 2. Determines the validity of the processes involved in
• Connects to the flowchart to avoid spaghetti the program.
connection on the same 3. Debugging or correction of errors is less complicated.
page. 4. Produces effective program documentation.
• Indicates that the process
A
is continued where the
matching on-page is
placed.

Off-Page Connector –
• Connects flowchart on different page to avoid
spaghetti
connection.
B

GUIDELINES FOR PREPARING A FLOWCHART


Guidelines:
1. Determine the following:
– Data to be entered
– Information to be produce.
– The way data will be entered.
– The point when information will be produced.
2. There should only be one “Start”/”Begin” and
“Stop”/”End” process.
3. Concentrate on the logic of the program.
4. Choose only the important steps. No need to
represent all the steps in the flowchart.

Remember:
1. Lines should be connected when making a flowchart.
2. Do not interchange symbols.
– Rounded Rectangle – Terminal (Begin/End,
Start/Stop)
– Parallelogram – Input/Output
– Rectangle – Steps/Process
– Rhombus – Decision (Conditional
Statement, yes/true, no/false)
– Hexagon – Initialization/Preparation
– Arrow – Flowchart Direction
– Circle – On-Page Connector
– “Bottom up” Pentagon – Off-page
Connector
3. Use start/stop and begin/end respectively. DO NOT
INTERCHANGE (begin/stop, start/end)
4. Always have an initialization after terminal

You might also like