Flowcharts So let’s say we want to express the following algorithm to print out the sum of the biggest and smallest of three numbers.

Slides:

Advertisements

Similar presentations

Warm-up Solve: 1) 2x + 1+4x +4x-11= 180 Compare greater than >, less than < or equal = 4+5___ 9 5+5__ 9 Find a number x. 6

Advertisements

Representing an algorithm using Flowcharts

Lecture 8 From NFA to Regular Language. Induction on k= # of states other than initial and final states K=0 a a* b a c d c*a(d+bc*a)*

Chapter 5.2 Factoring by Grouping. 3y (2x – 7)( ) (2x – 7) (2x – 7) – 8 3y 1. Factor. GCF = (2x – 7) Find the GCF. Divide each term by the GCF. (2x –

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

1 Flowchart If – Then – Else อนันต์ ผลเพิ่ม Anan Phonphoem

Introduction to Flowcharting

Flow Control Analysis & Design Tool: Flowcharts

Introduction to Flowcharting

Introduction to Flowcharting A Supplement to Starting Out with C++, 4th Edition by Tony Gaddis Published by Addison-Wesley.

ME 142 Engineering Computation I Fundamentals of Procedural Computer Programming.

Mathematics for Computing Lecture 4: Algorithms and flowcharts Dr Andrew Purkiss-Trew Cancer Research UK

Lab #6 Program Design.

Warm-up: Find the missing side lengths and angle measures This triangle is an equilateral triangle 10 feet 25 feet This triangle is an isosceles triangle.

Fig. 16-CO, p Fig. 16-1, p. 450 Fig. 16-2, p. 450.

Flow Charting, Structured English and PseudoCode

Tutorial #7 Flowcharts (reprise) Program Design. Introduction We mentioned it already, that if we thing of an analyst as being analogous to an architect,

Flow Charting Damian Gordon. Introduction We mentioned it already, that if we thing of an analyst as being analogous to an architect, and a developer.

Chapter 2- Visual Basic Schneider

Developing logic (Examples on algorithm and flowchart)

Flow Charts. Thinking Creatively Flow Charts START END Is A==6? No A = 1 Yes Print A A = A + 1.

Triangle Inequality Theorem The sum of the lengths of any two sides of a triangle is greater than the length of the third side.

Section 1-5 Algebra: Variables and Expressions. Vocabulary Algebra: Is a language of symbols, including variables Variable: Is a symbol, usually a letter,

CSC103: Introduction to Computer and Programming

Taks Objective 2 Properties and attributes of function.

Computational Tools1 Structured Programming Spreadsheets.

Pseudocode Demo for Payroll.c

Selection: IF Statement Damian Gordon. adsdfsdsdsfsdfs dsdlkmfsdfmsdl kfsdmkfsldfmsk dddfsdsdfsd.

We’re going to do two sections today Measuring segments 1.4 – Measuring angles Please begin on the warm up. Thanks.

1 Introduction to Flowcharting. 2 Writing a program Defining the problem –Write down what the program will do Planning –Write down the steps, draw a flowchart.

Flowcharts! January 13, 2005 These are today’s notes! Do you think we will get more snow?

Iteration: WHILE Loop Damian Gordon. WHILE Loop Consider the problem of searching for an entry in a phone book with only SELECTION:

Operations with Rational Numbers. When simplifying expressions with rational numbers, you must follow the order of operations while remembering your rules.

1S Algebra Revision! $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400.

 Deductive Reasoning is a process of reasoning logically from given facts to a conclusion.  Addition Property of equality if a=b then a+c=b+c  Subtraction.

Unit 1 Part 3 Segment Addition & Distance and Midpoint Formulas.

SLEs Investigate some of the approximations to π which have been used.

Prime Numbers Damian Gordon. Prime Numbers So let’s say we want to express the following algorithm: – Read in a number and check if it’s a prime number.

1 Introduction to Flowcharting Computer Science Principles ASFA.

Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.

Lesson 5.5 Use Inequalities in a Triangle. Theorem 5.10 A B C 8 5 IF AB > BC, THEN C > A The angle opposite the longest side is the largest angle; pattern.

Learning Objective To be able to… Understand flow chart symbols Complete and correct flow chart algorithms Create a program based on a flow chart.

Writing Equations Equations with Addition and Subtraction Equations with Multiplication and Division Solving Equations Ratios.

Lessons 6.1 and 6.2 OBJ: To solve inequalities using addition, subtraction, multiplication, and division.

Program Design & Development EE 201 C7-1 Spring

Section 10.4 Other Angle Relationships in Circles.

Triangle Inequality Theorem The sum of the lengths of any two sides of a triangle is greater than the length of the third side.

2.5 Algebra Reasoning. Addition Property: if a=b, then a+c = b+c Addition Property: if a=b, then a+c = b+c Subtraction Property: if a=b, then a-c = b-c.

5.5 Triangle Inequality. Objectives: Use the Triangle Inequality.

ALGORITHMS AND FLOWCHARTS

Properties of Triangles

Flowchart Symbols Terminal Process Input/ Output Decision

Algebraic Expressions

Flowcharting: Decision Structure

Factoring out the GCF.

Triangle Inequality Theorem

Length of a Segment Let A and B be points on a number line, with coordinates a and b. Then the measure of segment AB is.

تصنيف التفاعلات الكيميائية

Structured Program Design

1.2 Use Segments and Congruence

Day 7 Objective: I can factor expressions..

Triangle Inequality Theorem

1.5 The Distribute Property of Multiplication over Addition

Multiplying binomial with polynomial

Writing expressions with two terms

5-5 Triangle Inequality Theorem

MTH-4106 Pretest D For questions 1 to 7 factor the following polynomials. 1. x2  3xy  54y x2  21x  a2 – 12a + 45ab  9b.

Determine whether {image} is convergent or divergent.

Exercise Find the following products mentally. 5(20) 100 5(7) 35 5(27)

Presentation transcript:

Flowcharts So let’s say we want to express the following algorithm to print out the sum of the biggest and smallest of three numbers

START

Read in A, B and C

START A>B? Read in A, B and C

START A>B? Read in A, B and C Yes A>C?

START A>B? No Read in A, B and C Yes A>C?B>C?

START A>B? No Read in A, B and C Yes A>C?B>C? Biggest = C No

START A>B? No Read in A, B and C Yes A>C?B>C? Biggest = ABiggest = C Yes No

START A>B? No Read in A, B and C Yes A>C?B>C? Biggest = ABiggest = CBiggest = B Yes No

START A>B? No Read in A, B and C Yes A>C?B>C? Biggest = ABiggest = CBiggest = B Yes No

A>B?

Yes B<C?

A>B? Yes B<C?A<C? No

A>B? No Yes B<C?A<C? No

A>B? No Yes B<C?A<C? Smallest = C No

A>B? No Yes B<C?A<C? Smallest = ASmallest = C Yes No

A>B? No Yes B<C?A<C? Smallest = ASmallest = CSmallest = B Yes No

A>B? No Yes B<C?A<C? Smallest = ASmallest = CSmallest = B Yes No

A>B? No Yes B<C?A<C? Smallest = ASmallest = CSmallest = B Yes No Print Smallest + Biggest

A>B? No Yes B<C?A<C? Smallest = ASmallest = CSmallest = B Yes No Print Smallest + Biggest END

Flowcharts So let’s say we want to express the following algorithm to print out the biggest of four numbers

START

Read in A, B, C and D

START A>B? Read in A, B, C and D

START A>B? Yes Read in A, B, C and D X = A

START A>B? No Yes Read in A, B, C and D X = A X = B

START A>B? No Yes Read in A, B, C and D X = A X = B

START A>B? No Yes Read in A, B, C and D X = A X = B C>D?

START A>B? No Yes Read in A, B, C and D X = A X = B C>D? Yes Y = C

START A>B? No Yes Read in A, B, C and D X = A X = B C>D? No Yes Y = C Y = D

START A>B? No Yes Read in A, B, C and D X = A X = B C>D? No Yes Y = C Y = D

START A>B? No Yes Read in A, B, C and D X = A X = B C>D? No Yes Y = C Y = D

X>Y?

Yes Print X

X>Y? No Yes Print X Print Y

X>Y? No Yes Print X Print Y

X>Y? No Yes Print X Print Y END

Symbols

Terminal Input/Output Operation Process Decision Connector Module Symbols