Lesson Overview - Flowcharts and Pseudocode

Lesson overview: Flowcharts and pseudocode
Preparing for Exam

In order to break down a problem or task into smaller more manageable parts that we can
solve in a systematic and logical way, we need programmatic thinking. In order to apply
programmatic thinking to solving problems, we need a variety of tools, including algorithms,
operators, flowcharts, pseudocode, and conditional statements. In this lesson, we’ll take a
deep dive into using flowcharts, pseudocode, and conditional statements to solve a variety
of logic problems.
Programmatic Thinking is breaking down the problem into smaller parts.
I need certain tools to apply programmatic thinking.
Algorithms
Operators.
Flowcharts
Pseudocode
Conditional Statement
To solve real-world problems with data, we use programmatic thinking. It helps us

organize information into a set of instructions that a computer can follow. These
instructions include things like algorithms (step-by-step procedures), operators
(symbols that help us make decisions), and conditional statements (ways to decide
what to do based on certain conditions).
Algorithms: Algorithms are like recipes for solving problems. They give us a clear
sequence of steps to follow to get the desired result. For example, think of an
algorithm like a recipe for baking a cake. It tells you what ingredients to use and the
steps to follow to make a delicious cake every time.
Operators: Operators are like tools we use to make decisions in our algorithms. They
help us compare things, like numbers or words, to figure out what to do next. Think of
them as the questions you ask when making choices. For example, you might use the
"greater than" operator to decide if one number is bigger than another.
Conditional Statements: These are like instructions that tell the computer what to do
depending on certain conditions. They are like if-then statements in everyday life. For
example, if it's raining, take an umbrella; otherwise, leave it at home.
Let's look at some simple examples:
Comparison Operators:
● Equal to (==): This operator checks if two things are the same. For example, 2 +
2 == 4 is true because 2 + 2 equals 4.
● Not equal to (!=): It checks if two things are different. 2 + 2 != 4 is false because
2 + 2 is not different from 4.
● Greater than (>): It checks if one thing is larger than another. 5 > 4 is true
because 5 is greater than 4.
● Less than (<): It checks if one thing is smaller than another. 4 < 5 is true
because 4 is less than 5.
Boolean Operators:
● AND: If both conditions on the left and right are true, the whole statement is
true. For example, (2 + 2 == 4) AND (1 + 3 == 4) is true because both parts are
true.
● OR: If at least one condition on the left or right is true, the whole statement is
true. For example, (2 + 2 == 4) OR (4 > 5) is true because the first part is true.
● XOR (Exclusive OR): It's true if only one of the conditions on the left or right is
true, but not both. For example, (2 + 2 == 4) XOR (4 > 5) is true because only the
first part is true.
● NOT: This changes the meaning of a condition. For example, NOT (2 + 2 == 4) is
false because it's the opposite of the original condition.
These operators and conditional statements are used to make computers follow our
instructions and make decisions in programs and applications, like games, websites,
and more. They help computers solve problems and perform tasks for us.
Flowcharts: Flowcharts are visual representations of how a program or algorithm flows
from one step to another. They use shapes and arrows to show the sequence of actions
and decisions. Flowcharts are handy for planning and understanding complex
processes.
Pseudocode: Pseudocode is a way to write out the logic of a program in plain,
human-readable language before writing actual code. It helps programmers plan and
outline the steps they need to take in a program without worrying about the exact
programming language syntax.
Divide and Conquer: This is a problem-solving technique where you break a big problem
into smaller, more manageable pieces. You solve the smaller pieces first and then
combine their solutions to solve the overall problem. It's like dividing a big task into
smaller tasks to make it easier to tackle.
Recursive: Recursion is a programming technique where a function calls itself to solve a
problem. It's like solving a puzzle by breaking it into smaller, similar puzzles and solving
them recursively until you get the answer.
Dynamic Programming: This is a method of solving problems by breaking them into
smaller subproblems, solving each subproblem once, and storing the results so you
don't have to recompute them. It's like using a memo pad to remember solutions to
problems you've solved before.
Greedy: Greedy algorithms make the best choice at each step based on the current
situation, without worrying about the future. They often provide quick solutions but
might not always be the most optimal.

Backtracking: Backtracking is a technique for solving problems by trying different
possible solutions systematically until the correct one is found. If one approach doesn't
work, it "backs up" and tries another until it succeeds.
All of these concepts and tools are part of programmatic thinking and are essential for
computer scientists and programmers when they're designing and writing software.
They help in solving real-world problems efficiently and effectively by breaking them
down into logical and manageable parts.

Lesson Overview - Flowcharts and Pseudocode

Uploaded by

Lesson Overview - Flowcharts and Pseudocode

Uploaded by

Lesson overview: Flowcharts and pseudocode

Preparing for Exam

Programmatic Thinking is breaking down the problem into smaller parts.

I need certain tools to apply programmatic thinking.

To solve real-world problems with data, we use programmatic thinking. It helps us

Let's look at some simple examples:

Pseudocode: Pseudocode is a way to write out the logic of a program in plain,

programming language syntax.

smaller tasks to make it easier to tackle.

Recursive: Recursion is a programming technique where a function calls itself to solve a

them recursively until you get the answer.

Dynamic Programming: This is a method of solving problems by breaking them into

problems you've solved before.

might not always be the most optimal.

work, it "backs up" and tries another until it succeeds.

down into logical and manageable parts.

You might also like