JavaScript/JScript: Control Structures I - Pearson Learning Solutions

2008934301
Chapter 14 JavaScript/JScript: Control Structures I 399
Outline
14.1 Introduction
14.2 Algorithms
14.3 Pseudocode
14.4 Control Structures
14.5 The if Selection Structure
14.6 The
14.1 Introduction
Before writing a script to solve a problem, it is essential to have a thorough understanding
of the problem and a carefully planned approach to solving the problem. When writing a
script, it is equally essential to understand the types of building blocks that are available
and to employ proven program construction principles. In this chapter and in Chapter 15,
we discuss these issues in our presentation of the theory and principles of structured programming.
The techniques you learn here are applicable to most high-level languages, including
JavaScript.
14.2 Algorithms
if/
else Selection Structure
14.7 The while Repetition Structure
14.8 Formulating Algorithms: Case Study 1 (Counter-Controlled
Repetition)
14.9 Formulating Algorithms with Top-Down, Stepwise Refinement: Case
Study 2 (Sentinel-Controlled Repetition)
14.10 Formulating Algorithms with Top-Down, Stepwise Refinement: Case
Study 3 (Nested Control Structures)
14.11 Assignment Operators
14.12 Increment and Decrement Operators
14.13 A Note on Data Types
14.14 JavaScript Internet and World Wide Web Resources
Summary • Terminology • Self-Review Exercises • Answers to Self-Review Exercises • Exercises
Any computing problem can be solved by executing a series of actions in a specific order.
A procedure for solving a problem in terms of
1. the actions to be executed, and
2. the order in which these actions are to be executed
is called an algorithm.
The following example demonstrates that correctly specifying the
order in which the actions are to be executed is important.
e-Business and e-Commerce: How to Program, by Harvey M. Deitel, Paul J. Deitel, and Tem R. Nieto. Published by Prentice Hall.
Copyright © 2001 by Pearson Education, Inc.