A step-by-step procedure for solving a problem in a finite number of steps.

Slides:



Advertisements
Similar presentations
ALGORITHMS AND FLOWCHARTS
Advertisements

CS101: Introduction to Computer programming
More on Algorithms and Problem Solving
ALGORITHMS AND FLOWCHARTS
CS107 Introduction to Computer Science Lecture 3, 4 An Introduction to Algorithms: Loops.
Clearly Visual Basic: Programming with Visual Basic 2008 Chapter 9 Decisions, Decisions, Decisions.
ALGORITHMS AND FLOWCHARTS
Fundamentals of Algorithms MCS - 2 Lecture # 4
C How to Program, 6/e Summary © by Pearson Education, Inc. All Rights Reserved.
 Control structures  Algorithm & flowchart  If statements  While statements.
II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F.
ITEC113 Algorithms and Programming Techniques
Visual Basic.NET BASICS Lesson 10 Do Loops. 2 Objectives Explain what a loop is. Use the Do While and Do Until loops. Use the InputBox function. Use the.
CS107 Introduction to Computer Science Loops. Instructions Pseudocode Assign values to variables using basic arithmetic operations x = 3 y = x/10 z =
Algorithm & Flowchart.
Fundamentals of C programming
ALGORITHMS AND FLOWCHARTS
PROGRAMMING, ALGORITHMS AND FLOWCHARTS
Flow Charting. Goals Create Algorithms using Flow Charting procedures. Distinguish between Flow Charting and Pseudocode. Top-Down Design Bottom-up Design.
Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and Elizabeth Drake Chapter 2: Flowcharts.
CSE 102 Introduction to Computer Engineering What is an Algorithm?
Algorithm & Flow Charts
Lecture 2: Logical Problems with Choices. Problem Solving Before writing a program Have a thorough understanding of the problem Carefully plan an approach.
Visual Basic Programming
ALGORITHMS AND FLOWCHARTS CSCI 105 – Computer Fluency.
ITEC113 Algorithms and Programming Techniques
Dale Roberts 1 Program Control - Algorithms Department of Computer and Information Science, School of Science, IUPUI CSCI N305.
Chapter 3 - Structured Program Development Outline 3.1Introduction 3.2Algorithms 3.3Pseudocode 3.4Control Structures 3.5The If Selection Structure 3.6The.
Basic Control Structures
Basic problem solving CSC 111.
Advanced Program Design. Review  Step 1: Problem analysis and specification –Specification description of the problem’s inputs and output –Analysis generalize.
Flowcharting & Algorithms. Quick. Close your Eyes and Listen You are still sitting in the classroom. However, you have been called to the counselor’s.
Algorithms Writing instructions in the order they should execute.
PROGRAM DEVELOPMENT CYCLE. Problem Statement: Problem Statement help diagnose the situation so that your focus is on the problem, helpful tools at this.
Fundamentals of Algorithms MCS - 2 Lecture # 5. Representation of Algorithms (continued) Flowcharts.
Introducing block scheme programming March 17. Algorithm / Flow chart An algorithm or a flowchart is a step-by-step procedure for solving a particular.
Flowchart. a diagram of the sequence of movements or actions of people or things involved in a complex system or activity. a graphical representation.
Sum of Arithmetic Sequences. Definitions Sequence Series.
FLOWCHARTING AND ALGORITHMS
STEP 3- DEVELOP AN ALGORITHM At this stage we break down the problem into simple manageable steps so that they can be handled easily.
ALGORITHMS AND FLOWCHARTS. A typical programming task can be divided into two phases: Problem solving phase  produce an ordered sequence of steps that.
Introduction to Flowcharts
Algorithm & Flow Charts Decision Making and Looping
Lecture 2: Introduction to Programming EEE2108: 공학프로그래밍 서강대학교 전자공학과 2011 학년도 2 학기 - Algorithms and Flowcharts -
Loops causes program to execute the certain block of code repeatedly until some conditions are satisfied. Suppose you want to execute some code/s 10 times.
Problem Solving & Computer Programming
ALGORITHMS AND FLOWCHARTS
GC101 Introduction to computers and programs
Chapter 6: Loops.
COVERED BASICS ABOUT ALGORITHMS AND FLOWCHARTS
Computer Programming Flowchart.
Algorithms and Flowcharts
Introduction To Flowcharting
Numbering System TODAY AND TOMORROW 11th Edition
ALGORITHMS & FLOWCHARTING II
Programming Fundamentals
Microsoft Visual Basic 2005 BASICS
Problem Solving and Programming CS140: Introduction to Computing 1 8/21/13.
Lab 2 : Structures Muhammad Zaigham Abbas Shah DIGITAL INSTRUMENTATION SYSTEMS.
ALGORITHMS AND FLOWCHARTS
Lecture 2: Logical Problems with Choices
Unit# 9: Computer Program Development
ALGORITHMS AND FLOWCHARTS
Structured Program
1) C program development 2) Selection structure
ALGORITHMS AND FLOWCHARTS
Introduction to Algorithms and Programming
Click to add Text Computers & Instructions. Computers are given instructions in the form of computer programs that are created through the development.
Introduction to Programming
Structural Program Development: If, If-Else
Presentation transcript:

A step-by-step procedure for solving a problem in a finite number of steps.

Problem Statement: Find the sum of natural numbers from 0 to 50 START IF N <= 50 THEN GOTO Step 4 PRINT sum STOP Step 1: Step 2: Step 3: Step 4: Step 5: Step 6: Step 7: Step 8: sum0 N 1 sum + N NN + 1

Problem Statement: Find the sum of any TWO numbers Problem Statement: Check whether a number given by user is EVEN or ODD Problem Statement: Find the largest of THREE numbers

Flowchart is a type of diagram that represents an algorithm or process, showing the steps as boxes of various kinds, and their order by connecting them with arrows.

Statemement a Statemement b Statemement c Sequence is a default control structure. Instructions are executed one after another

Selection structure test the condition and then executes one sequence of statements instead of another, depending on whether the condition is true or false

Condition p? Statemement a Statemement b TF

Condition p? Statemement a T F

Repetition structure specifies the repetition of an action while some condition remains true. When the conditions of the control statement have been met and control passes to the next statement beyond the repetition structure

Condition p? Statemement block T F

MAX  VALUE1 Print “The largest value is”, MAX STOP YN START Input VALUE1,VALUE2 MAX  VALUE2 is VALUE1>VALUE2