Lecture 7 Pseudo-code Basics

Lecture 7 Pseudo-code Basics - Lecture7:PseudocodeBasics

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
FAST, National University of Computer and Emerging Sciences, Islamabad Lecture 7: Pseudo-code Basics Course: Programming For Engineers-1 Asma Ahmad
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
How to Represent an Algorithm Use natural languages   too verbose  too "context-sensitive"- relies on experience of reader  Use  Formal Programming languages   too low level   requires us to deal with complicated syntax of  programming language  Pseudo-code  natural language constructs modeled to look like  statements available in many programming languages Flow Charts Pictorial Representation 
Background image of page 2
Pseudo-Code Pseudo-Code  is simply a numbered list of  instructions to perform some task.  Number each instruction  This is to enforce the notion of an  ordered sequence of  operations  Furthermore we introduce a  dot  notation (e.g. 3.1 come  after  3 but  before  4) to number subordinate operations for  conditional and iterative operations  Each instruction should be  unambiguous  and  effective Completeness . Nothing is left out. 
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 13

Lecture 7 Pseudo-code Basics - Lecture7:PseudocodeBasics

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online