Pseudocode.

Slides:



Advertisements
Similar presentations
Repetition Control Structures
Advertisements

CHAPTER 5: Repetition Control Structure. Objectives  To develop algorithms that use DOWHILE and REPEAT.. UNTIL structures  Introduce a pseudocode for.
PSEUDOCODE & FLOW CHART
Program Design Tool. 6 Basic Computer Operations Receive information Put out information Perform arithmetic Assign a value to variable (memory location)
ITEC113 Algorithms and Programming Techniques
TEL 104 / MKK Fundamental Programming: Lecture 3
Chapter 9 Describing Process Specifications and Structured Decisions
Chapter 2: Algorithm Discovery and Design
Program Design and Development
Chapter 8: Introduction to High-level Language Programming Invitation to Computer Science, C++ Version, Third Edition.
Repetition Control Structures
Pseudocode.
Chapter 1 Program Design
Pseudocode Algorithms Using Sequence, Selection, and Repetition.
Chapter 8: Introduction to High-level Language Programming Invitation to Computer Science, C++ Version, Third Edition.
Chapter 3 Planning Your Solution
PRE-PROGRAMMING PHASE
Computer Science 101 Introduction to Programming.
DCT 1123 Problem Solving & Algorithms
CHAPTER 4: INTRODUCTION TO COMPUTER ORGANIZATION AND PROGRAMMING DESIGN Lec. Ghader Kurdi.
Sw development1 Software Development 1.Define the problem (Analysis) 2.Plan the solution 3.Code 4.Test and debug 5.Maintain and Document.
Pseudocode algorithms using sequence, selection and repetition
Simple Program Design Third Edition A Step-by-Step Approach
Array Processing Simple Program Design Third Edition A Step-by-Step Approach 7.
TMF1013 : Introduction To Computing Lecture 1 : Fundamental of Computer ComputerFoudamentals.
Developing an Algorithm
Selection Control Structures Simple Program Design Third Edition A Step-by-Step Approach 4.
Chapter 7 Array processing. Objectives To introduce arrays and the uses of arrays To develop pseudocode algorithms for common operations on arrays To.
Array Processing.
Chapter 8 High-Level Programming Languages. 8-2 Chapter Goals Describe the translation process and distinguish between assembly, compilation, interpretation,
CSE 102 Introduction to Computer Engineering What is an Algorithm?
Selection Control Structures. Simple Program Design, Fourth Edition Chapter 4 2 Objectives In this chapter you will be able to: Elaborate on the uses.
Developing an Algorithm
Selection Control Structure. Topics Review sequence control structure Structure theorem Selection control structure If statement Relational operators.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
C++ Programming Language Lecture 2 Problem Analysis and Solution Representation By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department.
An Introduction to Programming with C++ Sixth Edition Chapter 7 The Repetition Structure.
Chapter 2 Pseudocode. Objectives To introduce common words, keywords and meaningful names when writing pseudocode To define the three basic control structures.
Pseudocode. Simple Program Design, Fourth Edition Chapter 2 2 Objectives In this chapter you will be able to: Introduce common words, keywords, and meaningful.
Pseudocode Simple Program Design Third Edition A Step-by-Step Approach 2.
ITEC113 Algorithms and Programming Techniques
Pseudocode Algorithms Using Sequence, Selection, and Repetition
Repetition Control Structures Simple Program Design Third Edition A Step-by-Step Approach 5.
Pseudocode Algorithms Using Sequence, Selection, and Repetition Simple Program Design Third Edition A Step-by-Step Approach 6.
First Steps in Modularization. Simple Program Design, Fourth Edition Chapter 8 2 Objectives In this chapter you will be able to: Introduce modularization.
Developing an Algorithm. Simple Program Design, Fourth Edition Chapter 3 2 Objectives In this chapter you will be able to: Introduce methods of analyzing.
Cosc175 - Define Problem/Design Solution/Pseudocode/Trace 1 DEFINE THE PROBLEM.
First Steps in Modularization. Simple Program Design, Fourth Edition Chapter 8 2 Objectives In this chapter you will be able to: Introduce modularization.
1 Program Planning and Design Important stages before actual program is written.
First Steps in Modularization. Simple Program Design, Fourth Edition Chapter 8 2 Objectives In this chapter you will be able to: Introduce modularization.
Algorithm Discovery and Design Objectives: Interpret pseudocode Write pseudocode, using the three types of operations: * sequential (steps in order written)
The Hashemite University Computer Engineering Department
Invitation to Computer Science 5 th Edition Chapter 2 The Algorithmic Foundations of Computer Science.
Chapter 7: The Repetition Structure Introduction to Programming with C++ Fourth Edition.
STEP 3- DEVELOP AN ALGORITHM At this stage we break down the problem into simple manageable steps so that they can be handled easily.
Lecture Notes 1/20/05 Pseudocode.  Pseudocode standard which we will follow in this class: - Statements are written in simple English; - Each instruction.
An Introduction to Programming with C++ Sixth Edition Chapter 5 The Selection Structure.
Pseudocode. Algorithm A procedure for solving a problem in terms of the actions to be executed and the order in which those actions are to be executed.
An Introduction to Programming with C++ Sixth Edition Chapter 8 More on the Repetition Structure.
1-1 Logic and Syntax A computer program is a solution to a problem.
Algorithm & Programming
PROGRAM CONTROL STRUCTURE
The Selection Structure
CHAPTER 2 & 3: Pseudocode and Developing and Algorithm
Program Design Introduction to Computer Programming By:
Pseudocode.
Programming Right from the Start with Visual Basic .NET 1/e
Pseudocode algorithms using sequence, selection and repetition
Lecture Notes 8/24/04 (part 2)
Introduction to Pseudocode
Presentation transcript:

Pseudocode

Simple Program Design, Fourth Edition Chapter 2 Objectives In this chapter you will be able to: Introduce common words, keywords, and meaningful names when writing pseudocode Define the three basic control structures as set out in the Structure Theorem Illustrate the three basic control structures using pseudocode Simple Program Design, Fourth Edition Chapter 2

How to Write Pseudocode When designing a solution algorithm, you need to keep in mind that a computer will eventually perform the set of instructions written If you use words and phrases in the pseudocode which are in line with basic computer operations, the translation from pseudocode algorithm to a specific programming language becomes quite simple Simple Program Design, Fourth Edition Chapter 2

Six Basic Computer Operations A computer can receive information When a computer is required to receive information or input from a particular source, whether it is a terminal, a disk or any other device, the verbs Read and Get are used in pseudocode Read => Input from a record Get => Input from keyboard Example pseudocode Read student name Get system data Read number1, number2 Get tax_code Simple Program Design, Fourth Edition Chapter 2

Six Basic Computer Operations A computer can receive information Usually an output Prompt instruction is required before an input Get instruction Example pseudocode Prompt for student_mark Get student_mark Simple Program Design, Fourth Edition Chapter 2

Six Basic Computer Operations A computer can put out information When a computer is required to supply information or output to a device, the verbs Print, Write, Put, Output, or Display are used in pseudocode Print => send output to printer Write => send out to file Put, Output, Display => send to screen Example pseudocode Print ‘Program Completed’ Write customer record to master file Output total tax Display ‘End of data’ Simple Program Design, Fourth Edition Chapter 2

Six Basic Computer Operations A computer can perform arithmetic Most programs require the computer to perform some sort of mathematical calculation, or formula, and for these, a programmer may use either actual mathematical symbols or the words for those symbols To be consistent with high-level programming languages, the following symbols can be written in pseudocode: + for Add - for Subtract * for Multiply / for Divide ( ) for Parentheses When writing mathematical calculations for the computer, standard mathematical ‘order of operations’ applies to pseudocode and most computer languages Simple Program Design, Fourth Edition Chapter 2

Six Basic Computer Operations A computer can assign a value to a variable or memory location There are three cases where you may write pseudocode to assign a value to a variable or memory location: To give data an initial value in pseudocode, the verbs Initialize or Set are used To assign a value as a result of some processing the symbols ‘=‘ or ‘’ are written To keep a variable for later use, the verbs Save or Store are used Simple Program Design, Fourth Edition Chapter 2

Six Basic Computer Operations A computer can assign a value to a variable or memory location Example pseudocode Initialize total_price to zero Set student_count to zero Total_price = cost_price + sales_tax Total_price  cost_price + sales_tax Store customer_num in last_customer_num Simple Program Design, Fourth Edition Chapter 2

Six Basic Computer Operations A computer can compare two variables and select one or two alternate actions An important computer operation available to the programmer is the ability to compare two variables and then, as a result of the comparison, select one of two alternate actions To represent this operation in pseudocode, special keywords are used: IF, THEN, and ELSE Simple Program Design, Fourth Edition Chapter 2

Six Basic Computer Operations A computer can repeat a group of actions When there is a sequence of processing steps that need to be repeated, two special keywords, DOWHILE and ENDDO, are used in pseudocode The condition for the repetition of a group of actions is established in the DOWHILE clause, and the actions to be repeated are listed beneath it Simple Program Design, Fourth Edition Chapter 2

Simple Program Design, Fourth Edition Chapter 2 Meaningful Names All names should be meaningful A name given to a variable is simply a method of identifying a particular storage location in the computer The uniqueness of a name will differentiate it from other locations Often a name describes the type of data stored in a particular variable Most programming languages do not tolerate a space in a variable name, as a space would signal the end of the variable name and thus imply that there were two variables Simple Program Design, Fourth Edition Chapter 2

Simple Program Design, Fourth Edition Chapter 2 The Structure Theorem The Structure Theorem states that it is possible to write any computer program by using only three basic control structures that are easily represented in pseudocode: Sequence Selection Repetition Simple Program Design, Fourth Edition Chapter 2

The Three Basic Control Structures Sequence The sequence control structure is the straightforward execution of one processing step after another In pseudocode, we represent this construct as a sequence of pseudocode statements Selection The selection control structure is the presentation of a condition and the choice between two actions; the choice depends on whether the condition is true or false In pseudocode, selection is represented by the keywords IF, THEN, ELSE, and ENDIF Simple Program Design, Fourth Edition Chapter 2

The Three Basic Control Structures Repetition The repetition control structure can be defined as the presentation of a set of instructions to be performed repeatedly, as long as a condition is true The basic idea of repetitive code is that a block of statements is executed again and again, until a terminating condition occurs This construct represents the sixth basic computer operation, namely to repeat a group of actions Simple Program Design, Fourth Edition Chapter 2

Simple Program Design, Fourth Edition Chapter 2 Summary In this chapter, six basic computer operations were listed, along with pseudocode words and keywords to represent them These operations were: to receive information, put out information, perform arithmetic, assign a value to a variable, decide between two alternate actions, and repeat a group of actions The Structure Theorem was introduced; it states that it is possible to write any computer program by using only three basic control structures: sequence, selection, and repetition Simple Program Design, Fourth Edition Chapter 2