Outline
4.1 Introduction
4.2 Algorithms
4.3 Pseudocode
4.4 Control Structures
4.5 The if Selection Structure
4.6 The if/else Selection Structure
4.7 The while Repetition Structure
4.8 Formulating Algorithms: Case Study 1 (Counter- Controlled Repetition)4.9 Formulating Algorithms with Top-Down, Stepwise Refinement: Case Study 2 (Sentinel-Controlled Repetition)
4.10 Formulating Algorithms with Top-Down, Stepwise Refinement: Case Study 3 (Nested Control Structures)
4.11 Assignment Operators
4.12 Increment and Decrement Operators
4.13 Primitive Data Types
4.14 (Optional Case Study) Thinking About Objects: Identifying Class Attributes
4.1 Introduction
We learn about Control Structures
Structured-programming principle
Control structures help build and manipulate objects
4.2 Algorithms
Algorithm
Series of actions in specific order
The actions executed
The order in which actions execute
Program control
Specifying the order in which actions execute
Control structures help specify this order
4.3 Pseudocode
Pseudocode
Informal language for developing algorithms
Not executed on computers
Helps developers “think out” algorithms
