Introduction to Flowcharting
|
|
- Cory Wilkinson
- 6 years ago
- Views:
Transcription
1 Introduction to Flowcharting 1
2 Acknowledgment This tutorial is based upon Appendix C from Starting Out with C++: From Control Structures to Objects (5th Edition) Copyright Tony Gaddis 2007 Published by Addison-Wesley 2
3 Definitions A flowchart depicts pictorially the sequence in which instructions are carried out in an algorithm. A flowchart is a schematic representation of an algorithm or a stepwise process, showing the steps of boxes of various kinds and their order by connecting these with arrows. Flowcharts are used not only as aids in developing algorithms but also to document algorithms. Flowcharts are used in designing or documenting a process or program.
4 Need for the flowchart Efficient Communication Efficient Analysis Proper Documentation Easy and efficient coding Program Debugging Program Maintenance
5 What is a Flowchart? A flowchart is a diagram that depicts the flow of control of a program. START Display message How many hours did you work? Read Hours Display message How much do you get paid per hour? Read PayRate Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 5
6 Basic Flowchart Symbols START Display message How many hours did you work? Rounded Rectangle Notice there are three types of symbols in this flowchart: rounded rectangles parallelograms a rectangle Each symbol represents a different type of operation. Rectangle Rounded Rectangle Read Hours Display message How much do you get paid per hour? Read PayRate Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END Parallelogram 6
7 Basic Flowchart Symbols Terminals represented by rounded rectangles indicate a starting or ending point START Display message How many hours did you work? Read Hours Display message How much do you get paid per hour? Read PayRate Terminal START Multiply Hours by PayRate. Store result in GrossPay. END Terminal Display GrossPay END 7
8 Basic Flowchart Symbols Input/Output Operations represented by parallelograms indicate an input or output operation START Display message How many hours did you work? Read Hours Display message How much do you get paid per hour? Read PayRate Input/Output Operation Display message How many hours did you work? Read Hours Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 8
9 Basic Flowchart Symbols Processes represented by rectangles indicates a process such as a mathematical computation or variable assignment Multiply Hours by PayRate. Store result in GrossPay. Process START Display message How many hours did you work? Read Hours Display message How much do you get paid per hour? Read PayRate Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 9
10 Stepping Through the Flowchart In the next seven slides we will step through each symbol in the flowchart. We will show the program output and the contents of the variables. START Display message How many hours did you work? Read Hours Display message How much do you get paid per hour? Read PayRate Variable Contents: Hours:? PayRate:? GrossPay:? Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 10
11 Stepping Through the Flowchart START Display message How many hours did you work? Step 1: An Output Operation How many hours did you work? Screen Output Read Hours Display message How much do you get paid per hour? Read PayRate Variable Contents: Hours:? PayRate:? GrossPay:? Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 11
12 Stepping Through the Flowchart START Display message How many hours did you work? How many hours did you work? 40 Step 2: An Input Operation (User types 40) Read Hours Display message How much do you get paid per hour? Read PayRate Variable Contents: Hours: 40 PayRate:? GrossPay:? The value 40 is stored in Hours. Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 12
13 Stepping Through the Flowchart START Display message How many hours did you work? How much do you get paid per hour? Screen Output Step 3: An Output Operation Read Hours Display message How much do you get paid per hour? Read PayRate Variable Contents: Hours: 40 PayRate:? GrossPay:? Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 13
14 Stepping Through the Flowchart START Display message How many hours did you work? How much do you get paid per hour? 20 Read Hours Display message How much do you get paid per hour? Step 4: Input Operation Read PayRate Variable Contents: Hours: 40 PayRate: 20 GrossPay:? (User types 20) The value 20 is stored in PayRate. Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 14
15 Stepping Through the Flowchart START Display message How many hours did you work? How much do you get paid per hour? 20 Step 5: The product of Hours times PayRate is stored in GrossPay Read Hours Display message How much do you get paid per hour? Read PayRate Variable Contents: Hours: 40 PayRate: 20 GrossPay: 800 The value 800 is stored in GrossPay. Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 15
16 Stepping Through the Flowchart START Display message How many hours did you work? Your gross pay is 800 Screen Output Read Hours Display message How much do you get paid per hour? Read PayRate Variable Contents: Hours: 40 PayRate: 20 GrossPay: 800 Step 6: An Output Operation Multiply Hours by PayRate. Store result in GrossPay. Display GrossPay END 16
17 Four Flowchart Structures Sequence Decision (Selection) Repetition (Iteration) Case
18 Sequence Structure A series of actions are performed in sequence The pay-calculating example was a sequence flowchart. 18
19 Selection Structure One of two possible actions is taken, depending on a condition. 19
20 Selection Structure A new symbol, the diamond, indicates a yes/no question. If the answer to the question is yes, the flow follows one path. If the answer is no, the flow follows another path NO YES 20
21 Selection Structure In the flowchart segment below, the question is x < y? is asked. If the answer is no, then process A is performed. If the answer is yes, then process B is performed. NO x < y? YES Process A Process B 21
22 Selection Structure The flowchart segment below shows how a decision structure is expressed in C as an if/else statement. Flowchart C Code NO x < y? YES if (x < y) a = x * 2; else Calculate a as x plus y. Calculate a as x times 2. a = x + y; 22
23 Selection Structure The flowchart segment below shows a decision structure with only one action to perform. It is expressed as an if statement in C code. Flowchart C Code NO x < y? YES if (x < y) a = x * 2; Calculate a as x times 2. 23
24 Iteration Structure An iteration structure represents part of the program that repeats. This type of structure is commonly known as a loop. 24
25 Iteration Structure Notice the use of the diamond symbol. A loop tests a condition, and if the condition exists, it performs an action. Then it tests the condition again. If the condition still exists, the action is repeated. This continues until the condition no longer exists. 25
26 Iteration Structure In the flowchart segment, the question is x < y? is asked. If the answer is yes, then Process A is performed. The question is x < y? is asked again. Process A is repeated as long as x is less than y. When x is no longer less than y, the iteration stops and the structure is exited. x < y? YES Process A 26
27 Iteration Structure The flowchart segment below shows an iteration structure expressed in C as a while loop. Flowchart C Code while (x < y) x < y? YES Add 1 to x x++; 27
28 Controlling an Iteration Structure The action performed by an iteration structure must eventually cause the loop to terminate. Otherwise, an infinite loop is created. In this flowchart segment, x is never changed. Once the loop starts, it will never end. QUESTION: How can this flowchart be modified so it is no longer an infinite loop? x < y? YES Display x 28
29 Controlling an Iteration Structure ANSWER: By adding an action within the iteration that changes the value of x. YES x < y? Display x Add 1 to x 29
30 A Pre-Test Iteration Structure This type of structure is known as a pre-test iteration structure. The condition is tested BEFORE any actions are performed. YES x < y? Display x Add 1 to x 30
31 A Pre-Test Iteration Structure In a pre-test iteration structure, if the condition does not exist, the loop will never begin. YES x < y? Display x Add 1 to x 31
32 A Post-Test Iteration Structure This flowchart segment shows a post-test iteration structure. The condition is tested AFTER the actions are performed. A post-test iteration structure always performs its actions at least once. Display x Add 1 to x x < y? YES 32
33 A Post-Test Iteration Structure The flowchart segment below shows a post-test iteration structure expressed in C as a do-while loop. Flowchart Display x Add 1 to x C Code do { printf( %d,x); x++; } while (x < y); x < y? YES 33
34 Case Structure One of several possible actions is taken, depending on the contents of a variable.
35 Case Structure The structure below indicates actions to perform depending on the value in years_employed. CASE years_employed Other bonus = 100 bonus = 200 bonus = 400 bonus = 800
36 Case Structure If years_employed = 1, bonus is set to 100 If years_employed = 2, bonus is set to 200 CASE years_employed If years_employed = 3, bonus is set to 400 If years_employed is any other value, bonus is set to Other bonus = 100 bonus = 200 bonus = 400 bonus = 800
37 Connectors Sometimes a flowchart will not fit on one page. A connector (represented by a small circle) allows you to connect two flowchart segments. A 37
38 Connectors The A connector indicates that the second flowchart segment begins where the first segment ends. START A A END 38
39 Modules A program module, such as a subprogram (or function in C), is represented by a special symbol. 39
40 Modules The position of the module symbol indicates the point the module is executed. A separate flowchart can be constructed for the module. START Read Input. Call calc_pay function. Display results. END 40
41 Combining Structures Structures are commonly combined to create more complex algorithms. The flowchart segment below combines a selection structure with a sequence structure. YES x < y? Display x Add 1 to x 41
42 Combining Structures This flowchart segment shows two selection structures combined. NO x > min? YES Display x is outside the limits. NO x < max? YES Display x is outside the limits. Display x is within limits. 42
43 Review What do each of the following symbols represent? (Answer on next slide)
44 Answer What do each of the following symbols represent? Terminal Decision Input/Output Operation Connector Process Module
45 Review Name the four flowchart structures. (Answer on next slide)
46 Answer Sequence Decision Repetition Case
47 Review What type of structure is this? (Answer on next slide)
48 Repetition Answer
49 Review What type of structure is this? (Answer on next slide)
50 Sequence Answer
51 Review What type of structure is this? (Answer on next slide)
52 Case Answer
53 Review What type of structure is this? (Answer on next slide)
54 Decision Answer
depicts pictorially schematic representation of an algorithm document algorithms. used in designing or documenting
Definition A flowchart depicts pictorially the sequence in which instructions are carried out in an algorithm. A flowchart is a schematic representation of an algorithm or a stepwise process, showing the
More informationFlow Chart & Algorithms
Flow Chart Algorithms Planning Your Code Page 1 Page 4 See Appendix A, for Licensing Attribution information by-nc-sa-3.0 https://creativecommons.org/licenses/by-nc-sa/3.0/ https://creativecommons.org/faq/#what-does-some-rights-reserved-mean
More informationChapter 2: Input, Processing, and Output
Chapter 2: Input, Processing, and Output Starting Out with Programming Logic & Design Second Edition by Tony Gaddis Copyright 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter Topics
More informationFundamental of Programming (C)
Borrowed from lecturer notes by Omid Jafarinezhad Fundamental of Programming (C) Lecturer: Vahid Khodabakhshi Lecture 5 Structured Program Development Department of Computer Engineering How to develop
More informationFundamentals of Programming
Fundamentals of Programming Lecture 5 - Structured Program Development Lecturer : Ebrahim Jahandar Borrowed from lecturer notes by Omid Jafarinezhad How to develop a program? Requirements Problem Analysis
More informationIDENTIFY WAYS OF REPRESENTING ALGORITHMS.
IDENTIFY WAYS OF REPRESENTING ALGORITHMS. OBJECTIVES: Identify ways of representing algorithms: Content Representation of algorithms as Pseudocode or Flowcharts; use of flow chart symbols: input/output
More informationFLOW CHART AND PSEUDO CODE
FLOW CHART AND PSEUDO CODE Flowchart A Flowchart is a pictorial representation of an algorithm. The First flowchart is made by John Von Newman in 1945. It is a symbolic diagram of operation sequence, dataflow,
More informationCS 199 Computer Programming. Spring 2018 Lecture 2 Problem Solving
CS 199 Computer Programming Spring 2018 Lecture 2 Problem Solving ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence
More informationSoftware Development. Designing Software
Software Development Designing Software Modules Modular programming is a software design technique that emphasizes separating the functionality of a program into independent, interchangeable modules, such
More informationSNS COLLEGE OF ENGINEERING
SNS COLLEGE OF ENGINEERING DEPARTMENT OF CSE Presented By Thillaiarasu.N SCRAMBLE 2 Solution 3 What is Pseudocode? 4 Consists of: Short Readable Formally styled English language Used for: Explaining the
More informationChapter 1: Problem Solving Skills Introduction to Programming GENG 200
Chapter 1: Problem Solving Skills Introduction to Programming GENG 200 Spring 2014, Prepared by Ali Abu Odeh 1 Table of Contents Fundamentals of Flowcharts 2 3 Flowchart with Conditions Flowchart with
More informationAn Introduction to Programming with C++ Sixth Edition. Chapter 7 The Repetition Structure
An Introduction to Programming with C++ Sixth Edition Chapter 7 The Repetition Structure Objectives Differentiate between a pretest loop and a posttest loop Include a pretest loop in pseudocode Include
More informationPseudo Code and Flow Charts. Chapter 1 Lesson 2
Pseudo Code and Flow Charts Chapter 1 Lesson 2 Pseudocode Using Pseudocode Statements and Flowchart Symbols English-like representation of the logical steps it takes to solve a problem Flowchart Pictorial
More informationComputers Programming Course 6. Iulian Năstac
Computers Programming Course 6 Iulian Năstac Recap from previous course Data types four basic arithmetic type specifiers: char int float double void optional specifiers: signed, unsigned short long 2 Recap
More informationEngineering program development. Edited by Péter Vass
Engineering program development Edited by Péter Vass Introduction Question: Why engineering program development may be useful for a PhD student in Earth Sciences? Counter-argument: In these days a wide
More informationChapter Two: Program Design Process and Logic
Chapter Two: Program Design Process and Logic 2.1 Chapter objectives Describe the steps involved in the programming process Understand how to use flowchart symbols and pseudocode statements Use a sentinel,
More informationSlide 1. Slide 2. Slide 3. General Problem-Solving. Find the Weight of the Block. General_Problem_Solving_slides.docx 9/7/07 MET 107
Slide 1 General Problem-Solving MET 107 Slide 2 General problem-solving techniques Set aside some time to think about the problem before starting. Draw a sketch of the problem. Understand the overall purpose
More informationALGORITHMS AND FLOWCHARTS
ALGORITHMS AND FLOWCHARTS ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence of steps that describe solution of problem
More informationBIL101E: Introduction to Computers and Information systems Lecture 8
BIL101E: Introduction to Computers and Information systems Lecture 8 8.1 Algorithms 8.2 Pseudocode 8.3 Control Structures 8.4 Decision Making: Equality and Relational Operators 8.5 The if Selection Structure
More informationProblem Solving FLOWCHART. by Noor Azida Binti Sahabudin Faculty of Computer Systems & Software Engineering
Problem Solving FLOWCHART by Noor Azida Binti Sahabudin Faculty of Computer Systems & Software Engineering azida@ump.edu.my OER Problem Solving by Noor Azida Binti Sahabudin work is under licensed Creative
More information4*4*4 2. What is the output of the following flowchart for the values given below: (25 p)
Samples 1. Design a pseudocode that computes x n. Prompt the user to enter the value of x and n from keyboard. (25 p) Ex: Sample input for 4 and 3 your design should calculate 4 3 4*4*4 2. What is the
More informationPROGRAM DESIGN TOOLS. Algorithms, Flow Charts, Pseudo codes and Decision Tables. Designed by Parul Khurana, LIECA.
PROGRAM DESIGN TOOLS Algorithms, Flow Charts, Pseudo codes and Decision Tables Introduction The various tools collectively referred to as program design tools, that helps in planning the program are:-
More informationChapter 3: Modules. Starting Out with Programming Logic & Design. Second Edition. by Tony Gaddis
Chapter 3: Modules Starting Out with Programming Logic & Design Second Edition by Tony Gaddis Copyright 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter Topics 3.1 Introduction
More informationPROBLEM SOLVING AND OFFICE AUTOMATION. A Program consists of a series of instruction that a computer processes to perform the required operation.
UNIT III PROBLEM SOLVING AND OFFICE AUTOMATION Planning the Computer Program Purpose Algorithm Flow Charts Pseudo code -Application Software Packages- Introduction to Office Packages (not detailed commands
More informationLECTURE 5 Control Structures Part 2
LECTURE 5 Control Structures Part 2 REPETITION STATEMENTS Repetition statements are called loops, and are used to repeat the same code multiple times in succession. The number of repetitions is based on
More informationFUNDAMENTALS OF COMPUTING & COMPUTER PROGRAMMING UNIT III. 2 Marks PROBLEM SOLVING AND OFFICE AUTOMATION
FUNDAMENTALS OF COMPUTING & COMPUTER PROGRAMMING UNIT III 2 Marks PROBLEM SOLVING AND OFFICE AUTOMATION Planning the Computer Program Purpose Algorithm Flow Charts Pseudocode -Application Software Packages-
More informationChapter 1. Introduction to Programming and Visual Basic Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of
Chapter 1 Introduction to Programming and Visual Basic Addison Wesley is an imprint of 2011 Pearson Addison-Wesley. All rights reserved. Section 1.1 COMPUTER SYSTEMS: HARDWARE AND SOFTWARE Computer systems
More informationStructured Program Development in C
1 3 Structured Program Development in C 3.2 Algorithms 2 Computing problems All can be solved by executing a series of actions in a specific order Algorithm: procedure in terms of Actions to be executed
More informationLoops / Repetition Statements. There are three loop constructs in C. Example 2: Grade of several students. Example 1: Fixing Bad Keyboard Input
Loops / Repetition Statements Repetition s allow us to execute a multiple times Often they are referred to as loops C has three kinds of repetition s: the while loop the for loop the do loop The programmer
More informationFLOWCHARTS A flowchart is a graphical representation of the steps to be followed for solving problem. It consists of a set of symbols.
FLOWCHARTS A flowchart is a graphical representation of the steps to be followed for solving problem. It consists of a set of symbols. Each symbol represents a specific activity. A typical problem involves
More informationC How to Program, 6/e by Pearson Education, Inc. All Rights Reserved.
C How to Program, 6/e Before writing a program to solve a particular problem, it s essential to have a thorough understanding of the problem and a carefully planned approach to solving the problem. The
More informationChapter 1: An Overview of Computers and Logic
Chapter 1: An Overview of Computers and Logic Programming Logic and Design, Third Edition Comprehensive Objectives After studying Chapter 1, you should be able to: Understand computer components and operations
More informationIntroduction. C provides two styles of flow control:
Introduction C provides two styles of flow control: Branching Looping Branching is deciding what actions to take and looping is deciding how many times to take a certain action. Branching constructs: if
More informationBasic Flowchart Symbols and Meaning
Page 1 of 7 ConceptDraw Solution Park HOW TO GUIDE Tips from ConceptDraw Experts and Experienced Users Ge ConceptDraw PRO Discover the World of Visual Communication Try It Free Flowcharts are the ideal
More informationLoops / Repetition Statements
Loops / Repetition Statements Repetition statements allow us to execute a statement multiple times Often they are referred to as loops C has three kinds of repetition statements: the while loop the for
More informationIntroduction to Programming in C Department of Computer Science and Engineering. Lecture No. #01 Introduction: The Process of Programming
Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #01 Introduction: The Process of Programming Welcome to the introductory programming course on NPTEL MOOCs. The
More informationTheory of control structures
Theory of control structures Paper written by Bohm and Jacopini in 1966 proposed that all programs can be written using 3 types of control structures. Theory of control structures sequential structures
More informationMethod & Tools for Program Analysis & Design
Method & Tools for Program Analysis & Design TMB208 Pemrograman Teknik Kredit: 3 (2-3) 1 Programming Logic and Design, Introductory, Fourth Edition 2 1 Programming Methods Based on structures of programming
More informationComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Computer Fundamentals Pradeep K. Sinha Priti Sinha Chapter 11 Planning the Chapter 11: Planning Computer the Program Program Slide 1/50 Learning Objectives In this chapter you will learn about: Programs
More informationEvaluating the Style of your programs
Evaluating the Style of your programs Objectives At the end of this exercise, students will: Roles Be able to evaluate a program for conformance to style guide for the class. Be able to evaluate arithmetic
More informationReview. Input, Processing and Output. Review. Review. Designing a Program. Typical Software Development cycle. Bonita Sharif
Input, Processing and Output Bonita Sharif 1 Review A program is a set of instructions a computer follows to perform a task The CPU is responsible for running and executing programs A set of instructions
More informationComputer is an electronic machine that can receive, store, transform and output data of all kinds (image, text, numeric, graphics and sound).
ELECTRONIC COMPUTERS THEN AND NOW Computer is an electronic machine that can receive, store, transform and output data of all kinds (image, text, numeric, graphics and sound). In the Past (i.e., during
More informationLesson 1. Introduction to Programming OBJECTIVES
Introduction to Programming If you re new to programming, you might be intimidated by code and flowcharts. You might even wonder how you ll ever understand them. This lesson offers some basic ideas and
More informationThere are algorithms, however, that need to execute statements in some other kind of ordering depending on certain conditions.
Introduction In the programs that we have dealt with so far, all statements inside the main function were executed in sequence as they appeared, one after the other. This type of sequencing is adequate
More information50) Which of the following statement temporarily stops the execution of a program?
FFC MODEL SCHOOL 1) Which one option is not in Edit Menu? (a) Undo (b) Redo (c) Find (d) Font 2) Which Keyboard shortcut is used to make the selected word bold? (a) Ctrl+Shift+B (b) Shift+B (c) Alt+B (d)
More informationLoops! Loops! Loops! Lecture 5 COP 3014 Fall September 25, 2017
Loops! Loops! Loops! Lecture 5 COP 3014 Fall 2017 September 25, 2017 Repetition Statements Repetition statements are called loops, and are used to repeat the same code mulitple times in succession. The
More informationUNDERSTANDING PROBLEMS AND HOW TO SOLVE THEM BY USING COMPUTERS
UNDERSTANDING PROBLEMS AND HOW TO SOLVE THEM BY USING COMPUTERS INTRODUCTION TO PROBLEM SOLVING Introduction to Problem Solving Understanding problems Data processing Writing an algorithm CONTINUE.. Tool
More informationIntroduction to Computers
Introduction to Computers 1 1 Introduction to Computers 1.1 INTRODUCTION A computer is a device capable of performing computations and making logical decisions at speeds of millions and even billions of
More informationبسم اهلل الرمحن الرحيم
بسم اهلل الرمحن الرحيم Fundamentals of Programming C Session # 3 By: Saeed Haratian Spring 2016 Outlines Equality and Relational Operators A Simple C Program: Relations Keywords Algorithm Flow Chart Pseudo
More informationITT Technical Institute. ET2560T Introduction to C Programming Onsite and Online Course SYLLABUS
ITT Technical Institute ET2560T Introduction to C Programming Onsite and Online Course SYLLABUS Credit hours: 4.5 Contact/Instructional hours: 67 (41 Theory Hours, 26 Lab Hours Prerequisite(s and/or Corequisite(s:
More informationFirst Visual Basic Lab Paycheck-V1.0
VISUAL BASIC LAB ASSIGNMENT #1 First Visual Basic Lab Paycheck-V1.0 Copyright 2013 Dan McElroy Paycheck-V1.0 The purpose of this lab assignment is to enter a Visual Basic project into Visual Studio and
More informationFundamentals of Programming (Python) Control Structures. Sina Sajadmanesh Sharif University of Technology Fall 2017
Fundamentals of Programming (Python) Control Structures Sina Sajadmanesh Sharif University of Technology Some slides have been adapted from Python: How to Program 1 st Edition Outline 1. Control Structures
More informationAlgorithms: The recipe for computation
Algorithms: The recipe for computation 2C Visualizing Algorithms with Flowcharts 15-105 Principles of Computation, Carnegie Mellon University - CORTINA 1 Flowcharts Flowcharts are used to show the flow
More informationWord 2003: Flowcharts Learning guide
Word 2003: Flowcharts Learning guide How can I use a flowchart? As you plan a project or consider a new procedure in your department, a good diagram can help you determine whether the project or procedure
More informationChapter Overview. C++ Basics. Variables and Assignments. Variables and Assignments. Keywords. Identifiers. 2.1 Variables and Assignments
Chapter 2 C++ Basics Overview 2.1 Variables and Assignments 2.2 Input and Output 2.3 Data Types and Expressions 2.4 Simple Flow of Control 2.5 Program Style Copyright 2011 Pearson Addison-Wesley. All rights
More informationC++ Programming Lecture 7 Control Structure I (Repetition) Part I
C++ Programming Lecture 7 Control Structure I (Repetition) Part I By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department while Repetition Structure I Repetition structure Programmer
More informationFlow Charts. Visual Depiction of Logic Flow
Flow Charts Visual Depiction of Logic Flow Flow Charts Describe a sequence of events using pictures Often associated with computer programs, but are quite common in other fields General way to depict a
More informationChapter 8 Algorithms 1
Chapter 8 Algorithms 1 Objectives After studying this chapter, the student should be able to: Define an algorithm and relate it to problem solving. Define three construct and describe their use in algorithms.
More informationFirst C or C++ Lab Paycheck-V1.0 Using Microsoft Visual Studio
C & C++ LAB ASSIGNMENT #1 First C or C++ Lab Paycheck-V1.0 Using Microsoft Visual Studio Copyright 2013 Dan McElroy Paycheck-V1.0 The purpose of this lab assignment is to enter a C or C++ into Visual Studio
More informationSOFTWARE ANALYSIS & DESIGN TOOLS
SOFTWARE ANALYSIS & DESIGN TOOLS http://www.tutorialspoint.com/software_engineering/software_analysis_design_tools.htm Copyright tutorialspoint.com Software analysis and design includes all activities,
More informationSkill Area 306: Develop and Implement Computer Program
Add your company slogan Skill Area 306: Develop and Implement Computer Program Computer Programming (YPG) LOGO Skill Area 306.2: Produce Structured Program 306.2.1 Write Algorithm 306.2.2 Apply appropriate
More informationPSEUDOCODE AND FLOWCHARTS. Introduction to Programming
PSEUDOCODE AND FLOWCHARTS Introduction to Programming What s Pseudocode? Artificial and Informal language Helps programmers to plan an algorithm Similar to everyday English Not an actual programming language
More informationCSC 121 Spring 2017 Howard Rosenthal
CSC 121 Spring 2017 Howard Rosenthal Agenda To be able to define computer program, algorithm, and highlevel programming language. To be able to list the basic stages involved in writing a computer program.
More information(4-2) Selection Structures in C H&K Chapter 4. Instructor - Andrew S. O Fallon CptS 121 (September 12, 2018) Washington State University
(4-2) Selection Structures in C H&K Chapter 4 Instructor - Andrew S. O Fallon CptS 121 (September 12, 2018) Washington State University Control Structures 2 Recall that algorithms are composed of three
More information*Starting Out with C++: From Control Structures through Objects, 7/E* by *Tony Gaddis* COMPUTER PROGRAMMING LECTURE 05 LOOPS IMRAN IHSAN
PowerPoint Slides adapted from *Starting Out with C++: From Control Structures through Objects, 7/E* by *Tony Gaddis* Copyright 2012 Pearson Education Inc. COMPUTER PROGRAMMING LECTURE 05 LOOPS IMRAN IHSAN
More informationExample. CS 201 Selection Structures (2) and Repetition. Nested if Statements with More Than One Variable
CS 201 Selection Structures (2) and Repetition Debzani Deb Multiple-Alternative Decision Form of Nested if Nested if statements can become quite complex. If there are more than three alternatives and indentation
More informationUnit 1: Introduction to Algorithms
1 Unit 1: Introduction Unit 1: Introduction to Algorithms Steps involved in Problem Solving Problem solving by the computer involves the following steps 1. Problem definition 2. Analysis 3. Design 4. Coding
More informationLesson 6A Loops. By John B. Owen All rights reserved 2011, revised 2014
Lesson 6A Loops By John B. Owen All rights reserved 2011, revised 2014 Topic List Objectives Loop structure 4 parts Three loop styles Example of a while loop Example of a do while loop Comparison while
More informationLogic & Algorithms Foundations of Computer Science Behrouz A. Forouzan, Brooks/Cole Thomson Learning, Pacific Grove, USA, 2003.
OVERVIEW Logic & Algorithms Foundations of Computer Science Behrouz A. Forouzan, Brooks/Cole Thomson Learning, Pacific Grove, USA, 2003. OBJECTIVES After reading this chapter, the reader should be able
More informationCopyright 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 5-1
Copyright 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 5-1 Chapter 6 : (Control Structure- Repetition) Using Decrement or Increment While Loop Do-While Loop FOR Loop Nested Loop
More informationAlgorithms. Abdelghani Bellaachia, CSCI 1121 Page: 1
Algorithms 1. Objectives... 2 2. Design You Solution... 2 3. Structure of an algorithm:... 3 4. Pseudocode:... 4 5. Example... 5 6. Selection or Conditional Execution... 8 7. Looping or Iteration... 9
More informationAlgorithms (continued)
Algorithms (continued) QUIZ What are the 3 (or 4) fundamental control structures that we use as building blocks for algorithms? Building blocks for algorithms Sequential Actions (input, output, computations)
More informationStructured Program Development
Structured Program Development Chih-Wei Tang ( 唐之瑋 ) Department of Communication Engineering National Central University JhongLi, Taiwan Outline Introduction The selection statement if if.else switch The
More informationThe sequence of steps to be performed in order to solve a problem by the computer is known as an algorithm.
CHAPTER 1&2 OBJECTIVES After completing this chapter, you will be able to: Understand the basics and Advantages of an algorithm. Analysis various algorithms. Understand a flowchart. Steps involved in designing
More information8 Algorithms 8.1. Foundations of Computer Science Cengage Learning
8 Algorithms 8.1 Foundations of Computer Science Cengage Learning 8.2 Objectives After studying this chapter, the student should be able to: Define an algorithm and relate it to problem solving. Define
More informationProblem Solving Footer Text 10/30/2015 1
Problem Solving Footer Text 10/30/2015 1 Learning Outcome List five (5) steps in problem solving Identify input, process and output from a given problem. 8.2.2 Define algorithm. Solve a given problem using
More informationAlgorithms. Chapter 8. Objectives After studying this chapter, students should be able to:
Objectives After studying this chapter, students should be able to: Chapter 8 Algorithms Define an algorithm and relate it to problem solving. Define three construct and describe their use in algorithms.
More information1. The narratives, diagrams, charts, and other written materials that explain how a system works are collectively called
CH 3 MULTIPLE CHOICE 1. The narratives, diagrams, charts, and other written materials that explain how a system works are collectively called a) documentation. b) data flows. c) flowcharts. d) schema.
More information3. Introduction to Algorithm and Flowchart
3. Introduction to Algorithm and Flowchart 3.1 Algorithm An algorithm is a set of instructions, sometimes called a procedure or a function that is used to perform a certain task. This can be a simple process,
More information34. Recursion. Java. Summer 2008 Instructor: Dr. Masoud Yaghini
34. Recursion Java Summer 2008 Instructor: Dr. Masoud Yaghini Outline Introduction Example: Factorials Example: Fibonacci Numbers Recursion vs. Iteration References Introduction Introduction Recursion
More informationIT 1033: Fundamentals of Programming Loops
IT 1033: Fundamentals of Programming Loops Budditha Hettige Department of Computer Science Repetitions: Loops A loop is a sequence of instruction s that is continually repeated until a certain condition
More informationIntroduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras
Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Week 03 Lecture 12 Create, Execute, and Exit from a Process
More informationChapter 3: Decision Structures
Chapter 3: Decision Structures Starting Out with Java: From Control Structures through Objects Fourth Edition by Tony Gaddis Addison Wesley is an imprint of 2010 Pearson Addison-Wesley. All rights reserved.
More information4. The is a diagram that graphically depicts the steps that take place in a program. a. Program b. Flowchart c. Algorithm d. Code e.
Gaddis: Starting Out with Programming Logic & Design Test Bank Chapter Two MULTIPLE CHOICE 1. Which error produces incorrect results but does not prevent the program from running? a. syntax b. logic c.
More informationBASIC PLC PROGRAMMING
Q. What are ladder diagrams and sequence listing? Ladder diagram: Ladder diagrams are the most commonly used diagrams for nonelectronic control circuits. They are sometimes called elementary diagrams or
More informationAlgorithms and Flowcharts
UNIT 2 Chapter 1 Algorithms and Flowcharts After studying this lesson, the students will be able to understand the need of Algorithm and Flowcharts; solve problems by using algorithms and flowcharts; get
More informationFundamentals of Programming. Lecture 6: Structured Development (part one)
Fundamentals of Programming Lecture 6: Structured Development (part one) Instructor: Fatemeh Zamani f_zamani@ce.sharif.edu edu Sharif University of Technology Computer Engineering Department Outline Algorithms
More information(I m not printing out these notes! Take your own.)
PT1420 Week 2: Software Program Design I (I m not printing out these notes! Take your own.) Today we'll be discussing designing programs: Algorithms and errors Flowcharts and pseudocode Sequence structures
More informationChapter 2. Designing a Program. Input, Processing, and Output Fall 2016, CSUS. Chapter 2.1
Chapter 2 Input, Processing, and Output Fall 2016, CSUS Designing a Program Chapter 2.1 1 Algorithms They are the logic on how to do something how to compute the value of Pi how to delete a file how to
More informationStaff Microsoft VISIO Training. IT ESSENTIALS Creating Flowcharts Using Visio 2013 (ST562) June 2015
Staff Microsoft VISIO Training IT ESSENTIALS Creating Flowcharts Using Visio 01 (ST) June 01 Book online at: Royalholloway.ac.uk/it/training Self-Study packs also available 1 th June 01 Table of Contents
More informationWeek 1 Introduction to Computer and Algorithm (Part1) UniMAP Sem II 11/12 DKT121: Basic Computer Programming 1
Week 1 Introduction to Computer and Algorithm (Part1) UniMAP Sem II 11/12 DKT121: Basic Computer Programming 1 General Information Contributes 3 units: 2 hours lectures 2 hours labs and tutorials Main
More information4. Assignment statements Give an assignment statement that sets the value of a variable called total to 20: Answer: total = 20;
First Exam Review, Thursday, February 6, 2014 Note: Do not hand in this lab; but use it for review. Review all materials from notes, slides, examples and labs. Here is an overview of topics with some example
More informationConcept of algorithms Understand and use three tools to represent algorithms: Flowchart Pseudocode Programs
Morteza Noferesti Concept of algorithms Understand and use three tools to represent algorithms: Flowchart Pseudocode Programs We want to solve a real problem by computers Take average, Sort, Painting,
More informationUNIT-3 PROBLEM SOLVING AND OFFICE AUTOMATION
UNIT-3 PROBLEM SOLVING AND OFFICE AUTOMATION 1. PLANNING THE COMPUTER To solve a problem using computer, three phases are necessary. They are i. Identifying the purpose i. Identifying the purpose ii. Developing
More informationAli Khan < Project Name > Design Document. Version 1.0. Group Id: S1. Supervisor Name: Sir.
< Project Name > Design Document Version 1.0 Group Id: S1. Supervisor Name: Sir. Revision History Date Version Description Author Table of Contents 1. Introduction of Design Document 2. Entity Relationship
More informationCSCE150A. Introduction. While Loop. Compound Assignment. For Loop. Loop Design. Nested Loops. Do-While Loop. Programming Tips CSCE150A.
Chapter 5 While For 1 / 54 Computer Science & Engineering 150A Problem Solving Using Computers Lecture 05 - s Stephen Scott (Adapted from Christopher M. Bourke) Fall 2009 While For 2 / 54 5.1 Repetition
More informationComputer Science & Engineering 150A Problem Solving Using Computers. Chapter 5. Repetition in Programs. Notes. Notes. Notes. Lecture 05 - Loops
Computer Science & Engineering 150A Problem Solving Using Computers Lecture 05 - Loops Stephen Scott (Adapted from Christopher M. Bourke) 1 / 1 Fall 2009 cbourke@cse.unl.edu Chapter 5 5.1 Repetition in
More informationChapter 2: Understanding Structure. Programming Logic and Design, 4 th Edition Introductory
Chapter 2: Understanding Structure Programming Logic and Design, 4 th Edition Introductory Objectives After studying Chapter 2, you should be able to: Describe the features of unstructured spaghetti code
More informationUnit-II Programming and Problem Solving (BE1/4 CSE-2)
Unit-II Programming and Problem Solving (BE1/4 CSE-2) Problem Solving: Algorithm: It is a part of the plan for the computer program. An algorithm is an effective procedure for solving a problem in a finite
More information