Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Week 1 - Problem Solving PDF

Download as pdf or txt
Download as pdf or txt
You are on page 1of 17

Week 1

Teacher: Samlall Rabindranauth


?

2
It is the methods we use
to understand what is
happening in our
environment, identify
things we want to change
and then figure out the
things that need to be
done to create the desired
outcome. 3
4
1. Define the problem
In this step, clearly define the issue at
hand. Look at the problem from
multiple perspectives.

5
2. Propose and evaluate solutions
Brainstorm and come up with multiple
solutions to the problem.

6
3. Determine the most efficient solution
Choose a solution that solves the problem
in the best possible way. Meaning the
method that allows you to use the least
amount of resources and ultimately get
the best results.

7
4. Develop the algorithm
An algorithm is a finite number of
precise steps of instructions that
outline how to solve a problem.

This step focuses on preparing the


algorithm to solve the problem using
the best method chosen from step 3.
8
5. Test and validate the solution
In this step, the algorithm is tracked
with test data to see if it produces the
required results it was expected to
produce. After being tested, the
algorithm’s validity is evaluated as
being fit to solve the problem or if it
needs adjustments. 9
10
Algorithm is a step-by-step procedure,
which defines a set of instructions to
be executed in a certain order to get
the desired output. Algorithms are
generally created independent of
underlying languages, i.e. an algorithm
can be implemented in more than one
programming language.
11
12
Not all procedures can be called an algorithm. An algorithm should have the
following characteristics −

❖ Unambiguous − Algorithm should be clear and unambiguous. Each of its steps (or
phases), and their inputs/outputs should be clear and must lead to only one
meaning.

❖ Input − An algorithm should have 0 or more well-defined inputs.

❖ Output − An algorithm should have 1 or more well-defined outputs, and should


match the desired output.

❖ Finiteness − Algorithms must terminate after a finite number of steps.

❖ Feasibility − Should be feasible with the available resources.

❖ Independent − An algorithm should have step-by-step directions, which should be


independent of any programming code.
13
IPO charts
14
An input process output, or IPO, chart is
simply a way to identify the necessary
components that are key to solving the
problem . The chart has three
components, and you write the
description of each component in plain
English, not code or mathematical
formulas. Making an IPO chart helps you
understand what you can expect to get
out of the algorithm. 15
Input: indicates what you need in order
to solve the problem

Process: the processing steps that are


that will allow you to get the required
results or output.

Output: What results or output you want


16
The
End!!!

17

You might also like