1 Computational Problem Solving

Computational Problem
Solving
CS001L -
3rd Term 2020 -2021
Topics:
• Process of Computational Problem Solving
• Problem Analysis, Design, Implementation, and
Testing
• Algorithms
• Pseudocodes and Flowcharting
Learning Objectives
• Identify the terminologies in algorithm,
pseudocode, and flowcharts. (CO1)
• Use appropriate flowcharting symbols in solving
specific problem. (CO1)
1-3 Kendall & Kendall Copyright © 2014 Pearson Education, Inc. Publishing as Prentice Hall
TERMINOLOGIES
• Algorithm
• the step-by-step sequence of instructions that
describe how the data is to be processed to
produce the desired output
• Logic
• Art of reasoning
TERMINOLOGIES
• Syntax
• Rules governing usage of words and punctuation
• Semantics
• Rules governing the logic or idea of languages
• Machine Language
• The computer’s native language represented as
a series of 0’s and 1’s (binary form)
TERMINOLOGIES
• Compiler or Interpreter
• Translation software that converts programmer’s
statements to binary form notifies the programmer
if the programming language is used incorrectly
• Compiler
• Entire program is translated before it can execute
• Interpreter
• Each instruction is translated just prior to execution
5 Steps in Problem Solving Process
01 02 03 04 05
Understand Plan Code Test Production
Understanding the Plan the Logic Coding the Program Testing the Program Putting Program into
Problem Production
May be the most difficult phase

01 Users may not be able to articulate their needs well
Understand User needs may be changing frequently
Programmers may have to learn the user’s functional job
tasks
Documentation – supporting paperwork for a program.
Remember: Failure to analyze and understand the requirements leads to a failed
Understanding the solution!
Problem
Plan the steps that the program will take
02 Use tools such as flowcharts and pseudocode
Plan
Flowchart: a pictorial representation of the logic
steps
Pseudocode: Natural language representation of
the logic
Walk through the logic before coding by desk-
Plan the Logic
checking the logic.
• Coding is one of the most tedious parts in programming.
03 • Programmers choose a particular language because some
languages have built-in capabilities to make them more
Code efficient than others at handling certain types of operations.
• Code the Solution
• Also called writing the program, and
• implementing the solution
• Program should contain well-defined patterns or structures of the following types:
• Sequence
• Selection
Coding the Program • Iteration
• Once a program has been coded, compiled and – or interpreted, you can test
04 if the program will run or not.
• Some compilers and interpreters will enable you to debug a code when an
Test error is apparent.
• Test and Correct the Program
• Testing: method to verify correctness and that requirements are met
• Bug: a program error
• Debugging: the process of locating an error, and correcting and verifying the
correction
• Testing may reveal errors, but does not guarantee the absence of errors
Testing the Program
• Program adequately tested
– Ready for organizational use
05 • Putting program into production
Production – Time to implement
•Can be short or long
•Depends on program nature, size and user needs
– Factors
•Training, data format changes, new platform
• Conversion: entire set of actions organization must take to switch

over to new program(s)
Putting Program into
Production
PSEUDOCODE
STATEMENTS
AND
FLOWCHART
SYMBOLS
PSEUDOCODE
• An English-like representation of the same
thing.
PSEUDO = FALSE
CODE = A program means to put in a

programming language
RULES FOR PSEUDOCODE
• The pseudocode must be language independent.
Try to avoid the use of words peculiar to any
programming language.
• Show key words in CAPITAL LETTERS.
Example: IF condition THEN
DO action
ENDDO
ENDIF
• Indent lines to make the pseudocode easy to read
and understand.
RULES FOR PSEUDOCODE
• Punctuation is optional.
• Every IF must end with an ENDIF.
• Every DO, DO FOR and DO WHILE must end
with ENDDO.
• The main routine (the one that goes from
START to STOP) has to be shown first. All
other routines are to follow.
ADVANTAGES IN USING
PSEUDOCODE
• It bridges the gap between human language and
computer language.
• It is an intermediate notation that allows
expression of program logic in a straight
forward, easy to understand manner without
concerning the programmer with syntax details.
• It is easier to make changes to pseudocode than
to a source program in a high-level language.
RECIPE FOR SMALL SPONGE CAKES
Method:
• SET oven at 180oC.
• FOLLOW Method for Egg Sponge from Step a to
d
• PLACE mixture in patty pans, half filling each
one.
• BAKE at 180oC for approximately 10 minutes.
• COOL on cake cooler.
• CUT and FILL with whipped cream.
PASTILLAS RECIPE
• Procedures:
1. PLACE the condensed milk in a large mixing bowl.
2. GRADUALLY FOLD-IN the powdered milk. The texture of
the mixture will be similar to dough once all the powdered
milk is completely added.
3. SCOOP some of the mixture and mold into cylinders.
4. ROLL each molded cylindrical mixture on granulated
sugar.
5. WRAP in paper or cellophane.
6. SERVE for dessert. Share and enjoy!
EXAMPLE PROBLEM 1:
• We want to be able to enter the ages of two
people and have the computer calculate their
average age and display the answer.
ANSWER To PROBLEM 1:
• DISPLAY a message asking the user to enter the first age
• GET the first age from the keyboard
• DISPLAY a message asking the user to enter the second age
• GET the second age from the keyboard
• CALCULATE the answer by adding the two ages together
• and dividing by two
• OUTPUT display the answer on the screen
• PAUSE so the user can see the answer
EXAMPLE PROBLEM 2:
• Create a pseudo-code that will convert
Fahrenheit temperature to Celsius
temperature.
ANSWER To PROBLEM 2:
• GET a value for ftemp
• SET the value of ctemp to (5 / 9) * (ftemp - 32)
• RETURN the value of ctemp
Flowchart
• A pictorial representation of the logical steps
it takes to solve a problem.
• A flowchart is a diagrammatic representation

that illustrates the sequence of operations to
be performed to get the solution of a problem.
Guidelines in Drawing Flowcharts
• In drawing a proper flowchart, all necessary
requirements should be listed out in logical
order.
• The flowchart should be clear, neat and easy to
follow. There should not be any room for
ambiguity in understanding the flowchart.
• The usual direction of the flow of a procedure
or system is from left to right or top to bottom.
• Only one flow line should come out from a
process symbol.
• Only one flow line should enter a decision symbol,
but two flow lines, one for each possible answer,
should leave the decision symbol.
• Only one flow line is used in conjunction with
terminal symbol.
• If the flowchart becomes complex, it is better to use
connector symbols to reduce the number of flow
lines. Avoid the intersection of flow lines if you want
to make it more effective and better way of
communication.
• Ensure that the flowchart has a logical start and
finish.
• It is useful to test the validity of the flowchart by
passing through it with a simple test data.
Flowchart Symbols
• Flowcharts are usually drawn using some
standard symbols; however, some special
symbols can also be developed when required.
Some standard symbols, which are frequently,
required for flowcharting many computer
programs are the following:
• Terminal Symbol - shows the start and stop points
in a process.
• Preparation Symbol - as the names states, any

process step that is a preparation process flow
step, such as a set-up operation.
• Input/output Symbol - indicates inputs to and

outputs from a process.
• Process Symbol - shows a process or action step. This
is the most common symbol in both process flowcharts
and business process maps.
• Predefined Process (Subroutine) Symbol - is a marker

for another process step or series of process flow
steps that are formally defined elsewhere. This shape
commonly depicts sub-processes (or subroutines in
programming flowcharts).
• Decision Symbol - Indicates a question or branch in
the process flow. Typically, a decision flowchart
shape is used when there are 2 options (Yes/No,
No/No-Go, etc.)
• On-Page Connector Symbol - to show a jump from one

point in the process flow to another.
• Flow lines – a flow of control arrows indicating the

sequence of steps.
Entries and Exits
• The following will show you the number of
entries and exits from each symbol.
1 entry
1 exit
1 entry, 2 exits
1 entry, 1 exit 1 entry, 1exit
Summary
• Programming as Problem Solving
• Programming Process
• Understanding the problem
• Planning the logic
• Coding the program
• Testing the program
• Putting the program into production
• Problem Solving Strategies
• Stepwise Refinement
Summary
• Object Oriented Design Methodology
• Brainstorming
• Filtering
• Scenarios
• Responsibility algorithms
• PSEUDOCODE STATEMENTS
• FLOWCHART Symbols
END

1 Computational Problem Solving

Uploaded by

Copyright:

Available Formats

1 Computational Problem Solving

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

1 Computational Problem Solving

Uploaded by

Copyright:

Available Formats

Computational Problem

May be the most difficult phase

• Conversion: entire set of actions organization must take to switch

CODE = A program means to put in a

• A flowchart is a diagrammatic representation

• Preparation Symbol - as the names states, any

• Input/output Symbol - indicates inputs to and

• Predefined Process (Subroutine) Symbol - is a marker

• On-Page Connector Symbol - to show a jump from one

• Flow lines – a flow of control arrows indicating the

You might also like