Internet & World Wide Web How to Program, 5/e ©1992-2010 by Pearson Education, Inc. All Rights Reserved.

Slides:



Advertisements
Similar presentations
/ 281 Internet Applications Ahmed M. Zeki Sem – / Chapter 9.
Advertisements

More on Algorithms and Problem Solving
3 Decision Making: Equality and Relational Operators A condition is an expression that can be either true or false. Conditions can be formed using the.
 2008 Pearson Education, Inc. All rights reserved JavaScript: Control Statements I.
C How to Program, 6/e Summary © by Pearson Education, Inc. All Rights Reserved.
 Control structures  Algorithm & flowchart  If statements  While statements.
 2002 Prentice Hall. All rights reserved. 1 Outline 4.1 Introduction 4.2 Algorithms 4.3 Pseudocode 4.4 Control Structures 4.5 The if Selection Structure.
Chapter 3 - Structured Program Development
 2001 Deitel & Associates, Inc. All rights reserved. 1 Outline 14.1Introduction 14.2Algorithms 14.3Pseudocode 14.4Control Structures 14.5The if Selection.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 1 Chapter 3 - Structured Program Development Outline.
Outline IS400: Development of Business Applications on the Internet Fall 2004 Instructor: Dr. Boris Jukic JavaScript: Control Structure.
 2007 Pearson Education, Inc. All rights reserved Structured Program Development in C.
 2000 Prentice Hall, Inc. All rights reserved. Chapter 3 - Structured Program Development Outline 3.1Introduction 3.2Algorithms 3.3Pseudocode 3.4Control.
Internet & World Wide Web How to Program, 5/e © by Pearson Education, Inc. All Rights Reserved.
Structured Program Development in C
Lecture 3 Structured Program Development in C
 2002 Prentice Hall. All rights reserved. 1 Chapter 3 – Control Structures Outline 3.1 Introduction 3.2 Algorithms 3.3 Pseudocode 3.4Control Structures.
Chapter 4 Control Statements: Part I
Java™ How to Program, 9/e © Copyright by Pearson Education, Inc. All Rights Reserved.
The University of Texas – Pan American
 2003 Prentice Hall, Inc. All rights reserved.  2004 Prentice Hall, Inc. All rights reserved. Chapter 8 - JavaScript: Control Statements I Outline 8.1.
 2008 Pearson Education, Inc. All rights reserved JavaScript: Control Statements I.
Spring 2005, Gülcihan Özdemir Dağ Lecture 3, Page 1 BIL104E: Introduction to Scientific and Engineering Computing, Spring Lecture 3 Outline 3.1 Introduction.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 1 Structural Program Development: If, If-Else Outline.
Structured Program Development Outline 2.1Introduction 2.2Algorithms 2.3Pseudo code 2.4Control Structures 2.5The If Selection Structure 2.6The If/Else.
Lecture 2: Logical Problems with Choices. Problem Solving Before writing a program Have a thorough understanding of the problem Carefully plan an approach.
Pseudocode When designing an ALGORITHM to solve a problem, Pseudocode, can be used. –Artificial, informal language used to develop algorithms –Similar.
C Lecture Notes 1 Structured Program Development.
Chapter 3 - Structured Program Development Outline 3.1Introduction 3.2Algorithms 3.3Pseudocode 3.4Control Structures 3.5The If Selection Structure 3.6The.
1 C++ How to Program, 7/e © by Pearson Education, Inc. All Rights Reserved. 4.
 2000 Prentice Hall, Inc. All rights reserved. 1 Chapter 3 - Structured Program Development Outline 3.1Introduction 3.2Algorithms 3.3Pseudocode 3.4Control.
 2007 Pearson Education, Inc. All rights reserved Structured Program Development in C.
Dale Roberts 1 Program Control - Algorithms Department of Computer and Information Science, School of Science, IUPUI CSCI N305.
C Programming 2002 Chapter 3 - Structured Program Development Outline 3.1Introduction 3.2Algorithms 3.3Pseudocode 3.4Control Structures 3.5The If Selection.
Chapter 3 - Structured Program Development Outline 3.1Introduction 3.2Algorithms 3.3Pseudocode 3.4Control Structures 3.5The If Selection Structure 3.6The.
 2003 Prentice Hall, Inc. All rights reserved. Chapter 8 - JavaScript: Control Statements I Outline 8.1 Introduction 8.2 Algorithms 8.3 Pseudocode 8.4.
 2008 Pearson Education, Inc. All rights reserved JavaScript: Control Statements I.
 Pearson Education, Inc. All rights reserved Control Statements: Part 1.
 2003 Prentice Hall, Inc. All rights reserved. 1 Outline 4.1 Introduction 4.2 Algorithms 4.3 Pseudocode 4.4 Control Structures 4.5 if Single-Selection.
 2008 Pearson Education, Inc. All rights reserved Control Statements: Part 1.
 2001 Prentice Hall, Inc. All rights reserved. 1 Chapter 8 - JavaScript: Control Structures I Outline 8.1 Introduction 8.2 Algorithms 8.3 Pseudocode 8.4.
Structured Program Development Angela Chih-Wei Tang ( 唐 之 瑋 ) Department of Communication Engineering National Central University JhongLi, Taiwan 2010.
1 Lecture 3 Control Structures else/if and while.
Chapter 3 Structured Program Development Associate Prof. Yuh-Shyan Chen Dept. of Computer Science and Information Engineering National Chung-Cheng University.
Java™ How to Program, 9/e © Copyright by Pearson Education, Inc. All Rights Reserved.
Java™ How to Program, 9/e © Copyright by Pearson Education, Inc. All Rights Reserved.
1 Lecture 2 Control Structures: Part 1 Selection: else / if and switch.
Internet & World Wide Web How to Program, 5/e © by Pearson Education, Inc. All Rights Reserved.
1 JavaScript/Jscript 2 Control Structures I. 2 Introduction Before programming a script have a –Thorough understanding of problem –Carefully planned approach.
 2007 Pearson Education, Inc. All rights reserved Structured Program Development in C.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 1 Chapter 3 - Structured Program Development Outline.
 2007 Pearson Education, Inc. All rights reserved Structured Program Development in C.
Chapter 3 Structured Program Development in C C How to Program, 8/e, GE © 2016 Pearson Education, Ltd. All rights reserved.1.
Chapter 3 Structured Program Development in C Part II C How to Program, 8/e, GE © 2016 Pearson Education, Ltd. All rights reserved.1.
Chapter 7 JavaScript: Control Statements, Part 1
Algorithm: procedure in terms of
JavaScript: Control Statements I
JavaScript: Control Statements I
Chapter 2.1 Control Structures (Selection)
Chapter 8 - JavaScript: Control Statements I
CSC113: Computer Programming (Theory = 03, Lab = 01)
Ch 7: JavaScript Control Statements I.
JavaScript: Control Statements.
Lecture 2: Logical Problems with Choices
MSIS 655 Advanced Business Applications Programming
Structured Program
Chapter 3 - Structured Program Development
3 Control Statements:.
Chapter 3 - Structured Program Development
Structural Program Development: If, If-Else
Presentation transcript:

Internet & World Wide Web How to Program, 5/e © by Pearson Education, Inc. All Rights Reserved.

 Any computable problem can be solved by executing a series of actions in a specific order  A procedure for solving a problem in terms of  the actions to be executed, and  the order in which the actions are to be executed is called an algorithm © by Pearson Education, Inc. All Rights Reserved.

 Pseudocode  An informal language that helps you develop algorithms  Pseudocode is similar to everyday English; it’s convenient and user friendly, although it’s not an actual computer programming language © by Pearson Education, Inc. All Rights Reserved.

 Sequential execution  Execute statements in the order they appear in the code  Transfer of control  Changing the order in which statements execute  All scripts can be written in terms of only three control statements  sequence  selection  repetition © by Pearson Education, Inc. All Rights Reserved.

 Flowchart  A graphical representation of an algorithm or of a portion of an algorithm  Drawn using certain special-purpose symbols, such as rectangles, diamonds, ovals and small circles  Symbols are connected by arrows called flowlines, which indicate the order in which the actions of the algorithm execute © by Pearson Education, Inc. All Rights Reserved.

 In a flowchart that represents a complete algorithm, oval symbols containing the words “Begin” and “End” represent the start and the end of the algorithm.  In a flowchart that shows only a portion of an algorithm, the oval symbols are omitted in favor of using small circle symbols, also called connector symbols.  Perhaps the most important flowcharting symbol is the diamond symbol, also called the decision symbol, which indicates that a decision is to be made. © by Pearson Education, Inc. All Rights Reserved.

 JavaScript provides three selection structures.  The if statement either performs (selects) an action if a condition is true or skips the action if the condition is false.  Called a single-selection statement because it selects or ignores a single action or group of actions.  The if…else statement performs an action if a condition is true and performs a different action if the condition is false.  Double-selection statement because it selects between two different actions or group of actions.  The switch statement performs one of many different actions, depending on the value of an expression.  Multiple-selection statement because it selects among many different actions or groups of actions. © by Pearson Education, Inc. All Rights Reserved.

 JavaScript provides four repetition statements, namely, while, do … while, for and for … in.  In addition to keywords, JavaScript has other words that are reserved for use by the language, such as the values null, true and false, and words that are reserved for possible future use. © by Pearson Education, Inc. All Rights Reserved.

 Single-entry/single-exit control statements make it easy to build scripts.  Control statements are attached to one another by connecting the exit point of one control statement to the entry point of the next.  Control-statement stacking.  There is only one other way control statements may be connected  Control-statement nesting © by Pearson Education, Inc. All Rights Reserved.

 The JavaScript interpreter ignores white-space characters  blanks, tabs and newlines used for indentation and vertical spacing  A decision can be made on any expression that evaluates to a value of JavaScript’s boolean type (i.e., any expression that evaluates to true or false ).  The indentation convention you choose should be carefully applied throughout your scripts  It is difficult to read scripts that do not use uniform spacing conventions © by Pearson Education, Inc. All Rights Reserved.

 Allows you to specify that different actions should be performed when the condition is true and when the condition is false. © by Pearson Education, Inc. All Rights Reserved.

 Conditional operator ( ?: )  Closely related to the if…else statement  JavaScript’s only ternary operator—it takes three operands  The operands together with the ?: operator form a conditional expression  The first operand is a boolean expression  The second is the value for the conditional expression if the boolean expression evaluates to true  Third is the value for the conditional expression if the boolean expression evaluates to false © by Pearson Education, Inc. All Rights Reserved.

 Nested if…else statements  Test for multiple cases by placing if…else statements inside other if…else statements  The JavaScript interpreter always associates an else with the previous if, unless told to do otherwise by the placement of braces ( {} )  The if selection statement expects only one statement in its body  To include several statements, enclose the statements in braces ( { and } )  A set of statements contained within a pair of braces is called a block © by Pearson Education, Inc. All Rights Reserved.

 A logic error has its effect at execution time.  A fatal logic error causes a script to fail and terminate prematurely.  A nonfatal logic error allows a script to continue executing, but the script produces incorrect results. © by Pearson Education, Inc. All Rights Reserved.

 while  Allows you to specify that an action is to be repeated while some condition remains true  The body of a loop may be a single statement or a block  Eventually, the condition becomes false and repetition terminates © by Pearson Education, Inc. All Rights Reserved.

 Counter-controlled repetition  Often called definite repetition, because the number of repetitions is known before the loop begins executing  A total is a variable in which a script accumulates the sum of a series of values  Variables that store totals should normally be initialized to zero before they are used in a script  A counter is a variable a script uses to count—typically in a repetition statement © by Pearson Education, Inc. All Rights Reserved.

 JavaScript represents all numbers as floating- point numbers in memory  Floating-point numbers often develop through division  The computer allocates only a fixed amount of space to hold such a value, so the stored floating-point value can only be an approximation © by Pearson Education, Inc. All Rights Reserved.

 Sentinel-controlled repetition  Special value called a sentinel value (also called a signal value, a dummy value or a flag value) indicates the end of data entry  Often is called indefinite repetition, because the number of repetitions is not known in advance  Choose a sentinel value that cannot be confused with an acceptable input value © by Pearson Education, Inc. All Rights Reserved.

 Top-down, stepwise refinement  A technique that is essential to the development of well- structured algorithms  Approach begins with pseudocode of the top, the statement that conveys the script’s overall purpose  Divide the top into a series of smaller tasks and list them in the order in which they need to be performed—the first refinement  Second refinement commits to specific variables © by Pearson Education, Inc. All Rights Reserved.

 Control statements may be stacked on top of one another in sequence © by Pearson Education, Inc. All Rights Reserved.

 Control structures may be nested inside of one another © by Pearson Education, Inc. All Rights Reserved.

 JavaScript provides the arithmetic assignment operators +=, -=, *=, /= and %=, which abbreviate certain common types of expressions. © by Pearson Education, Inc. All Rights Reserved.

 The increment operator, ++, and the decrement operator, --, increment or decrement a variable by 1, respectively.  If the operator is prefixed to the variable, the variable is incremented or decremented by 1, then used in its expression.  If the operator is postfixed to the variable, the variable is used in its expression, then incremented or decremented by 1. © by Pearson Education, Inc. All Rights Reserved.

 When incrementing or decrementing a variable in a statement by itself, the preincrement and postincrement forms have the same effect, and the predecrement and postdecrement forms have the same effect  When a variable appears in the context of a larger expression, preincrementing the variable and postincrementing the variable have different effects. Predecrementing and postdecrementing behave similarly. © by Pearson Education, Inc. All Rights Reserved.